Splitting sums of binary polynomials
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) ℓ .
Fields of Study & Subjects
Coding theory and cryptography
Advanced Combinatorial Mathematics
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti
- Volume
- 30
- Pages
- 65–73
- Publication date
- 1 January 2026
- Language
- HR