ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X=X(Δ)X=X(\Delta) be a complete toric variety of dimension rr, let GG be a TT-invariant Cartier divisor, let PGP_G be the polytope associated to GG, and let MM be the lattice associated to XX. For the toric evaluation code CL=CL(G,P,X)C_L=C_L(G,P,X), write nn for its length and dd for its minimum distance. Suppose XX is nonsingular and projective, and suppose there is an integer N>1N>1 such that

2N⋅vol⁡(PG)≤n≤2N2⋅vol⁡(PG).2N\cdot \operatorname{vol}(P_G)\leq n\leq 2N^2\cdot \operatorname{vol}(P_G).

Hansen's conjecture. If qq is sufficiently large, then every f∈L(G)=H0(X,O⁡(G))f\in L(G)=H^0(X,\operatorname{\mathcal O}(G)) has at most nn zeros in X(Fq)X(\mathbb{F}_q), and consequently

d≥n−2N⋅vol⁡(PG).d\geq n-2N\cdot \operatorname{vol}(P_G).

The meaning of sufficiently large may depend on XX, PP, and GG, but not on ff. The estimate was conjecturally proposed for toric codes and verified computationally for many examples; its general validity is not resolved by the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.