ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F1(p,t)\mathcal{F}_1(p,t) be the family of polynomials over Fp\mathbb{F}_p with exactly tt nonzero terms and normalized as in the paper. Let F1(p,t,r)\mathcal{F}_1(p,t,r) denote the subfamily whose members have exactly rr distinct nonzero roots, and write R(f)R(f) for the number of such roots.

Factorial decay conjecture. There exists a constant γ>0\gamma>0 such that

∣F1(p,t,r)∣∣F1(p,t)∣≤(1r!)γ\frac{|\mathcal{F}_1(p,t,r)|}{|\mathcal{F}_1(p,t)|}\leq\left(\frac{1}{r!}\right)^\gamma

for all prime pp, t∈Nt\in\mathbb{N}, and r∈Nr\in\mathbb{N}.

This conjecture formalizes the heuristic that the number of nonzero terms and the number of nonzero roots are statistically independent for a random sparse polynomial. The source reports computational evidence for related logarithmic root bounds but does not state a resolution.

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.