MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Are there any computer algebra systems (e.g. Macaulay2 og singular) that allows one to compute the Picard number (i.e. the rank of the Neron-Severi group) of a given variety?

share|cite|improve this question
For surfaces over finite fields, see the link in the following answer:… – Felipe Voloch May 30 '10 at 17:18
up vote 11 down vote accepted

A more basic question is whether there even exists an algorithm to compute this number. I've wondered this for a long time, and I honestly don't know what to expect. Any algorithm would have to be quite subtle. In the early 1980's Shioda had to work quite hard to construct explicit examples of surfaces in $\mathbb{P}^3$, defined over $\mathbb{Q}$, with Picard number 1.

Added: Of course, I should have said Shioda's example have degree >1. As further evidence of subtlety of the problem: one can decide whether an elliptic curve $E$ has CM by computing the Picard number of $E\times E$.

share|cite|improve this answer
I really like the elliptic curve example! – S. Carnahan May 30 '10 at 16:59
Assuming the Tate conjecture, one can imagine an algorithm computing l-adic cohomology. – Felipe Voloch May 30 '10 at 17:20
Are you saying that there may be an algorithm to compute the Galois invariant part? I would be interested to see this spelled out if you have some thoughts on this. – Donu Arapura May 30 '10 at 18:07
@Donu: I don't claim to have thought this through but I don't see an obstacle for a simple-minded approach, as long as one doesn't care about efficiency. Chebotarev should provide a finite set of matrices that describe the action and then it's just linear algebra (?). – Felipe Voloch May 30 '10 at 20:00
I'm probably showing my ignorance, but is the first step involving Chebotarev effective? – Donu Arapura May 31 '10 at 13:57

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.