ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be a prime power, let b∈Fq[T]b\in\mathbb F_q[T] have degree m≥1m\geq 1, and let Varbℓ(Trunq,bL)\mathrm{Var}_{b^\ell}(\mathrm{Trun}^L_{q,b}) be the variance defined over polynomials of degree less than mℓm\ell. Polynomial variance conjecture. As ℓ→∞\ell\to\infty, we expect

Varbℓ(Trunq,bL)=1m2(1−1qm)2(qmΦ(b)−1)log⁡2ℓ+Om,q(log⁡ℓ).\mathrm{Var}_{b^\ell}(\mathrm{Trun}^L_{q,b})=\frac{1}{m^2}\left(1-\frac{1}{q^m}\right)^2\left(\frac{q^m}{\Phi(b)}-1\right)\log^2\ell+O_{m,q}(\log\ell).

In particular, when m=1m=1 and b(T)=Tb(T)=T, we expect

VarTℓ(Trunq,TL)=q−1q2log⁡2ℓ+Oq(log⁡ℓ).\mathrm{Var}_{T^\ell}(\mathrm{Trun}^L_{q,T})=\frac{q-1}{q^2}\log^2\ell+O_q(\log\ell).

The conjecture gives the heuristic large-ℓ\ell behavior in the polynomial setting, complementing unconditional estimates available when qq or mm grows. The source provides evidence but no proof.

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.