2000 character limit reached
A Dombi Counterexample with Positive Lower Density (2302.02138v1)
Published 4 Feb 2023 in math.NT and cs.FL
Abstract: Let $r(k,A,n)$ denote the number of representations of $n$ as a sum of $k$ elements of a set $A \subseteq \mathbb{N}$. In 2002, Dombi conjectured that if $A$ is co-infinite, then the sequence $(r(k,A,n))_{n \geq 0}$ cannot be strictly increasing. Using tools from automata theory and logic, we give an explicit counterexample where $\mathbb{N} \setminus A$ has positive lower density.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.