On a problem of Sidon for polynomials over finite fields
Wentang Kuo, Shuntaro Yamagishi

TL;DR
This paper extends a classical problem about the distribution of sums in integer sequences to polynomials over finite fields, proving the existence of sequences with controlled sum representations.
Contribution
It establishes an analogue of Sidon's conjecture for polynomials over finite fields, showing sequences with sum representation counts between linear bounds in degree.
Findings
Existence of polynomial sequences with sum counts between degree bounds
Analogues of Sidon's conjecture in finite field polynomial setting
Bounds on the number of representations for large degrees
Abstract
Let be a sequence of positive integers. Given a positive integer , we define S. Sidon conjectured that there exists a sequence such that for all sufficiently large and, for all , P. Erd\H{o}s proved this conjecture by showing the existence of a sequence of positive integers such that In this paper, we prove an analogue of this conjecture in , where is a finite field of elements. More precisely, let be a sequence in . Given a polynomial , we define $$ r_h(\omega) = |\{(f,g) \in \mathbb{F}_q[T]\times \mathbb{F}_q[T] : f,g\in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Limits and Structures in Graph Theory · semigroups and automata theory
