Splitting sums of binary polynomials
Year: 2026
Type: preprint
Abstract: 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)^{\ell}$.
Source: arXiv (Cornell University)
Author: Gallardo, Luis H.
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7129066410
Cites:
Cited by:
Related to: