Koley and Reddy's irreducibility conjecture for integer polynomials
Let , where for a prime and positive integer . Suppose that for a prime . Koley and Reddy's conjecture. If , , and
then is irreducible over .
References
Status
- Solved: Weilin Zhang and Pingzhi Yuan. A note on an irreducible class of polynomials over integers (arXiv preprint, 2023) https://arxiv.org/abs/2303.03605
Source: Sanjeev Kumar and Jitender Singh, “A study of some recent irreducibility criteria for polynomials having integer coefficients”, arXiv:2310.02860 (2023).
Progress summary
A 2023 preprint claims to prove the conjecture, but the proof has not been independently verified in the retrieved record.
Koley and Reddy’s conjecture asserts irreducibility under a prime-power constant term, a prescribed initial gap in the coefficients, coprimality conditions, and a coefficient-size inequality. A 2023 preprint states that the conjecture follows from a stronger irreducibility theorem proved using Newton polygons.
Known results
- A 2020 paper records related irreducibility criteria for sparse integer polynomials with constant term .
- The earlier catalogue source described the conjecture as open in October 2023, before the relevant proof was identified.
2023 stronger-theorem proof
The preprint proves irreducibility when , , and ; choosing and using that is prime yields the Koley–Reddy statement. Its argument combines Newton polygons with the coefficient-size bound. No retrieved source reports a counterexample, withdrawal, or correction.
Current status (as of September 2026): The conjecture is claimed settled by the 2023 preprint’s stronger theorem, while independent verification of that proof is not recorded here.
Solutions 0
No solutions have been posted yet.