← All problems

Irreducibility conjecture for even sorted binomial polynomials

19 years old · documented by

Let Pn(z)P_n(z) be the sorted binomial polynomial with parameter nn. Irreducibility conjecture. Pn(z)P_n(z) is irreducible over Q\mathbb{Q} for all even nn. The analogous factorization for odd nn has just been proved in the surrounding text, while this even-nn assertion is supported only by numerical computations for low nn.

References

12 papers in this index state this conjecture (2006–2025). The statement above is taken from the most recent of them; the others are arXiv:2402.00739, arXiv:2308.14202, arXiv:2206.11778, arXiv:2004.00233, arXiv:1912.12253, arXiv:1701.01160, arXiv:1502.07307, arXiv:1408.4881, arXiv:1001.2873, arXiv:0804.0112, arXiv:math/0605318.

Source: Owen John Levens, “Polynomials Arising from Sorted Binomial Coefficients”, arXiv:2511.03082 (2025).

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.