Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Citations (3)

Summary

We haven't generated a summary for this paper yet.