Irreducibility conjecture for the polynomials
Irreducibility conjecture for the polynomials
Let denote the polynomial discussed in the concluding remarks, with coefficients in . Irreducibility conjecture. For even , is irreducible over . For odd , is the product of and an irreducible polynomial over .
The paper verifies the claim computationally for even and discusses related irreducibility checks, but no general proof is given.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.