← All problems

The root-count conjecture for pkp_k

2 years old · documented by

Let pk(x)p_k(x) be the polynomial defined in the surrounding argument for an integer k≥2k\geq2. Root-count conjecture for pkp_k. The polynomial pk(x)p_k(x) has at most two real roots in (0,1)(0,1), counting multiplicity. The preceding lemma only establishes a leading-coefficient and sign property and does not prove this stronger root-count assertion. No resolution is given in the supplied text.

References
  1. Raphael Yuster, “Almost k-union closed set systems”, arXiv:2302.12276 (2023).

Progress summary

Refreshed
Open · progress reported

An unverified submission claims a four-root counterexample, but the conjecture remains officially unsettled.

Yuster's conjecture asks whether the polynomial pkp_k has at most two real roots in (0,1)(0,1) for every integer k≥2k\geq2. The conjecture arises from an entropy inequality; the supplied literature does not establish it in general.

Known results

  • Yuster's entropy argument is rigorous for k=3,4k=3,4, while larger kk reduce to the root-count conjecture.
  • The related polynomial for k=2k=2 is identified with Boppana's polynomial.
  • A direct verification for (k,r)=(3,2)(k,r)=(3,2) proves the corresponding entropy inequality, not the general root-count conjecture.

October 28, 2026 community counterexample claim

A submitted preprint claims that at k=48k=48, the canonically parameterized polynomial has at least four distinct roots in (0,1)(0,1), contradicting the conjecture. The submission describes exact sign checks and rational enclosures, but this claim is unverified and has no independent corroboration in the retrieved sources.

Current status (as of October 2026): The conjecture is not verified or refuted; a community submission claims a counterexample at k=48k=48, but that claim remains unverified.

Sources

Solutions 1

At k=48, the canonically parameterized polynomial in Yuster Conjecture 3.9 has at least four distinct roots strictly between zero and one. Rational parameter enclosures and five exact sign checks give the certificate. Lean proves the literal coefficients, parameter condition, four real roots and root-count contradiction. No smallest example, exact total root count or refutation of the separate known entropy inequality is claimed.See full solutionHide full solution

AI-assisted preprint by Myeongjin Kang, with no affiliation. Internal AI review is not external journal peer review. The accompanying Lean certificate covers the precise scoped main statement; inspect the formal endpoint, assumptions and provenance in the supporting package. Prior-art investigations are documented bounded searches, not worldwide-priority certification. Original prose is offered under CC BY 4.0 and original code/Lean under MIT; third-party rights and existing notices are preserved. The public supporting ZIP contains original proof sources and verification evidence, with bibliographic links and hashes instead of redistributed third-party source manuscripts.

Recorded prior-art/source-access limits: No prior root-count refutation located. Full later Yuster–Yashfe manuscript not located; Wakhare publisher full body not separately read. Closest actual primary arXiv sources and known true entropy theorem compared and credited.

Full paper: Four interior roots in Yuster's entropy polynomial.

Lean proof sources and pinned verification evidence: Zenodo supporting package. MathDB has not automatically verified the attached Lean certificate.