Generalizations of some results about the regularity properties of an additive representation function
Abstract
Let A = \a1,a2,…\ (a1 < a2 < …) be an infinite sequence of nonnegative integers, and let RA,2(n) denote the number of solutions of ax+ay=n (ax,ay∈ A). P. Erdos, A. S\'ark\"ozy and V. T. S\'os proved that if N∞B(A,N)N=+∞ then |1(RA,2(n))| cannot be bounded, where B(A,N) denotes the number of blocks formed by consecutive integers in A up to N and l denotes the l-th difference. Their result was extended to l(RA,2(n)) for any fixed l2. In this paper we give further generalizations of this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.