The Unfair 0–1 Polynomial Conjecture for Trinomial Factors
Version 2 / Nov 20, 2026 / CC BY 4.0
Abstract
If a polynomial with coefficients in is the product of two monic polynomials with nonnegative real coefficients and one factor is a trinomial, then both factors have coefficients in . Write the normalized trinomial as . For the product and the other factor, place the coefficient of in row , column of the corresponding array. If , the product array contains a rectangle of ones spanning four rows and at least five columns. Across this rectangle, differences between consecutive columns of the other factor satisfy a homogeneous recurrence. At a conjugate of outside the unit circle, the resulting growth contradicts a uniform Fourier bound on a linear combination of these differences.
Provenance statement
Formalizations
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 changesSupersededNov 19, 2026
- v2 · 8 pagesSubmitted by Alessandro BaravelliSubmitted as a new versionCurrentNov 20, 2026