The Unfair 0–1 Polynomial Conjecture for Trinomial Factors
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
Let two monic polynomials with nonnegative real coefficients have a product whose coefficients are all zero or one. If one factor has exactly three nonzero terms, we prove that every nonzero coefficient in both factors equals one. The exponents of the three terms and the degree of the other factor are arbitrary. Equivalently, if two independent, finitely supported integer-valued random variables have a sum uniform on its support, and one takes exactly three values, each is uniform on its own support. A fractional middle coefficient would have an algebraic conjugate of modulus greater than one. At this conjugate the recurrence forces certain differences between coefficients of the other factor to grow. We bound explicit linear combinations of these differences by counting walks on the integers and applying polynomial approximation on a real interval.
Provenance statement
Tools used
- OpenAI
- CodexVersion GPT-6.2 Astra
References
- A. Dvorsky, The unfair 0--1 polynomial problem and high-degree trinomials , 2026, arXiv:2608.19173v2 (https://arxiv.org/abs/2608.19173v2).arXiv
- A. Dvorsky, Trinomials of the type in the unfair -- polynomial problem , manuscript, version 4, 4 August 2026.
- L. Ghidelli, Progress on the unfair 0--1-polynomials conjecture using linear recurrences and numerical analysis , 2022, arXiv:2209.09843 (https://arxiv.org/abs/2209.09843).arXiv
- K. G. Hare, Computational progress on the unfair 0--1 polynomial conjecture , Experimental Mathematics, published online 15 July 2025, doi:10.1080/10586458.2025.2527786 (https://doi.org/10.1080/10586458.2025.2527786).DOI
- E. Hasanbegović, Structural results on the unfair 0--1 polynomial conjecture , 2026, arXiv:2611.14596 (https://arxiv.org/abs/2611.14596).arXiv
Version history
- v1 · 8 pagesSubmitted by Alessandro BaravelliRevised after moderator-requested changesCurrentNov 19, 2026