arXiv (All)
open access
The Unfair 0-1 Polynomial Problem and High-Degree Trinomials
The unfair $0$--$1$ polynomial conjecture asks whether a factorization \[C(x)=A(x)B(x),\] with $A$ and $B$ monic and having nonnegative real coefficients, and $C$ a polynomial with all the coefficients 0 and 1, must already be a factorization into $0$--$1$ polynomials. Let $k$ be odd and $0<a<1$.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Preservation of log-concavity under Hadamard products#999107
- An effective criterion for multiple positive zeros of vertically parametrized polynomial systems#1128538
- Khovanov complexes for bipartite links#1036710
- Bernstein--Sato ideals might not be linear#1116618
- Generalized formulas for the Jones polynomial of a rational link#1076056
Record · ID 820616
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive