Kohen's first-zero bound conjecture for univariate constant term sequences

About 1 year old · traced to

Let PP be a univariate Laurent polynomial and let pp be prime. For the constant term sequence Ap(n)=ct⁡[Pn] mod pA_p(n)=\operatorname{ct}[P^n]\bmod p, suppose there exists some n∈Nn\in\mathbb{N} such that p∣ct⁡[Pn]p\mid\operatorname{ct}[P^n]. Kohen's first-zero bound conjecture. The bound in Proposition 6 holds with

BP,p=pdeg⁡(P),B_{P,p}=p^{\deg(P)},

so there exists an n0<BP,pn_0<B_{P,p} such that p∣ct⁡[Pn0]p\mid\operatorname{ct}[P^{n_0}]. This conjecture sharpens the general automaton-theoretic bound for the location of the first zero; it was suggested by computational experiments in the univariate case, and no proof or counterexample is given here.

References

Primary source

Justin Offutt, “Automatic Bounds on Constant Term Sequences Modulo Primes”, arXiv:2504.19031 (2025).

Additional references

2 papers in this index state this conjecture (2025). The statement above is taken from the most recent of them; the others are arXiv:2503.21988.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.