Carnevale–Voll polynomial nonvanishing conjecture

About 6 years old · traced to

For positive integers λ1>λ2\lambda_1>\lambda_2, define

Cλ1,λ2(x,1)=∑j=0λ2(λ1j)(λ2j)xj.C_{\lambda_1,\lambda_2}(x,1)=\sum_{j=0}^{\lambda_2}{\lambda_1\choose j}{\lambda_2\choose j}x^j.

Carnevale–Voll conjecture.

Cλ1,λ2(−1,1)≠0.C_{\lambda_1,\lambda_2}(-1,1)\neq0.

This is the formulation of Carnevale and Voll's Conjecture A relevant to the absence of unitary factors in their polynomial. The paper proves the assertion in several parameter ranges and studies its asymptotic validity, while the full conjecture remains open.

References

Primary source

Laurent Habsieger, “Explicit Asymptotics for Signed Binomial Sums and Applications to Carnevale-Voll Conjecture”, arXiv:2006.09704 (2020).

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.