A lower bound for the ratio of the polynomials R_d and P_d
Let and be the polynomials whose ratio is under consideration. Lower-bound conjecture. If and , then
This conjecture is presented as information needed to make the paper's expression for the focal function useful; the source provides no resolution evidence.
References
- Donald M. Davis, “Maximizing a combinatorial expression arising from crowd estimation”, arXiv:0910.5725 (2009).
Progress summary
A reader-written submission claims a proof covering every case, but no independent source has checked it.
The conjecture asserts a lower bound for when and . The catalogued source reported no resolution as of October 2009.
Community submission (unverified; October 28, 2026)
A submitted proof argues that the conjecture holds throughout its stated domain: a general comparison is claimed for , with exact polynomial certificates for the remaining degrees. The submission explicitly presents this as an AI-assisted preprint and notes limits on prior-art checking; its mathematical correctness is unverified.
Current status (as of October 2026): The conjecture has no independently verified resolution; a reader submission claims a complete proof, which remains unverified.
Sources
Solutions 1
We prove Davis Conjecture 3.1 strictly throughout its stated degree and real-variable domain. A finite detailed-balance identity rewrites the source quotient through second and fourth moments. A general comparison covers degrees at least 43, and 38 exact polynomial certificates cover the remaining degrees. The explicit source equation-2.4 difference remainder and full bound are certified in Lean; Euclidean division is not separately formalized.See full solution
We prove Davis Conjecture 3.1 strictly throughout its stated degree and real-variable domain. A finite detailed-balance identity rewrites the source quotient through second and fourth moments. A general comparison covers degrees at least 43, and 38 exact polynomial certificates cover the remaining degrees. The explicit source equation-2.4 difference remainder and full bound are certified in Lean; Euclidean division is not separately formalized. No optimality or separate critical-point conjecture is claimed.
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: Final paginated IJMM5(2010)129-148 body unlocated; actual arXiv and revised author-hosted2010 manuscript read and agree verbatim on conjecture; Euclidean division not separately formalized; source explicit equation2.4 difference used without residual premise; Bounded independent primary-source/follow-up/subsumption screen; no known prior resolution found; No MathSciNet/Scopus/Google Scholar sweep; S2 429; zbMATH inconclusive; Zero indexed citers and empty MathDB not treated as global novelty certificate; no worldwide priority claim
Full paper: Davis all-degree rational-function conjecture via a fourth-moment bound.
Lean proof sources and pinned verification evidence: Zenodo supporting package. MathDB has not automatically verified the attached Lean certificate.