On Sárközy-Sós Theorem related to representation functions

Abstract

Let $\mathbb{N}_0$ be the set of all nonnegative integers. For a nonempty set $\mathcal{A}\subseteq \mathbb{N}_0$ and integers $n,h\ge 2$, let $r_{h}(\mathcal{A},n)$ be the number of representations of $n$ as $a_1+\cdots+a_h$, where $a_1\le \cdots\le a_h$ and $a_i\in \mathcal{A}$ for $i=1,\cdots,h$. In 2016, Chen and Tang showed that, for any given distinct positive integers $u_1,\cdots,u_k$ and positive rational numbers $α_1,\cdots,α_k$ with $α_1+\cdots+α_k=1$, there are infinitely many sets $\mathcal{A}\subseteq \mathbb{N}_0$ such that $r_{h}(\mathcal{A},n)\ge 1$ for all nonnegative integers $n$ and the set of $n$ with $r_{h}(\mathcal{A},n)=u_i$ has density $α_i$ for all integer $i=1,\cdots,k$. In this paper, we consider the irrational numbers $α_i$ as well. As a main result, we prove that, for any nonnegative numbers $α_0,\cdots,α_m$ with $α_0+\cdots+α_m=1$, there are infinitely many sets $\mathcal{A}\subseteq \mathbb{N}_0$ such that the set of $n$ with $r_{2}(\mathcal{A},n)=i$ has density $α_i$ for all integer $i=0,\cdots,m$. Other related results are also contained.

Disclosure

“OpN 3{4 q for every 0 ď i ď m. It follows that there exist infinitely many sets A Ď N0 with the desired properties. This completes the proof of Theorem 1.1. Use of AI disclaimer: During the development of this work, the authors used OpenAI ChatGPT (GPT-5.5 Thinking and GPT-5.5 Pro), as an auxiliary tool. Based on the works [1], [2] and a probabilistic method introduced by the authors, one suggestion (the use of some kind of function τ pf pnqq) arises from this interaction. The autho”

PDF page 11

Classification

Proof ideas or individual proof-step assistance

Multiplier

8

Verified

2026-08-24T00:28:51.963Z

Structural counts