A note on the lower bound of representation functions
Xing-Wang Jiang, Csaba Sandor, Quan-Hui Yang

TL;DR
This paper investigates the lower bounds of representation functions for sets of nonnegative integers, showing that previous bounds are nearly optimal and exploring related properties of such sets.
Contribution
It demonstrates that the earlier established lower bounds are nearly optimal and presents additional results on the structure of representation functions.
Findings
The previous lower bound on R_2(A,n) is nearly best possible.
Conditions under which the representation functions are equal for large n.
Additional results on the behavior of representation functions for specific sets.
Abstract
For a set of nonnegative integers, let denote the number of solutions to with , . Let be the Thue-Morse sequence and . Let and be a positive integer such that for all . Previously, the first author proved that if and , then for all . In this paper, we prove that the above lower bound is nearly best possible. We also get some other results.
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
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography · semigroups and automata theory
