HAL (France)
open access
Splitting sums of binary polynomials
We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that m = 5 is the minimal number such that the sums of any two distinct polynomials in a set of m polynomials over F 2 [x] cannot all be of the form x k (x + 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
- A Note On Certain Minimal Excludants Over Overpartitions#1036044
- Properties of LCM Lattices of Monomial Ideals#158711
- From subtractive ideals of semirings to deductive and inductive sets in general algebras#1083026
- Internal congruences modulo powers of $2$ for overpartition tuples with odd parts#999492
- The Prouhet--Tarry--Escott problem for subsets with small doubling in integral domains#972013
Record · ID 1166402
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