← All problems

Koley and Reddy's irreducibility conjecture for integer polynomials

3 years old · traced to

Let f=a0+a1x+⋯+anxn∈Z[x]f=a_0+a_1x+\cdots+a_nx^n\in\mathbb Z[x], where a0=±pka_0=\pm p^k for a prime pp and positive integer kk. Suppose that a1=a2=⋯=aq−1=0a_1=a_2=\cdots=a_{q-1}=0 for a prime q≤nq\leq n. Koley and Reddy's conjecture. If p∤aqanp\nmid a_qa_n, q∤kq\nmid k, and

pk>∣aq∣+∣aq+1∣+⋯+∣an∣,p^k>|a_q|+|a_{q+1}|+\cdots+|a_n|,

then ff is irreducible over Q\mathbb Q.

References

Status

Source: Sanjeev Kumar and Jitender Singh, “A study of some recent irreducibility criteria for polynomials having integer coefficients”, arXiv:2310.02860 (2023).

Progress summary

Refreshed
Open · solution reported

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 ±pu\pm p^u.
  • 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 p∤amp\nmid a_m, gcd⁡(u,m)=1\gcd(u,m)=1, and pu>∣an∣+⋯+∣am∣p^u>|a_n|+\cdots+|a_m|; choosing m=qm=q and using that qq 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.

Sources

Solutions 0

No solutions have been posted yet.