An Erdos--Fuchs Theorem for Ordered Representation Functions
Abstract
Let k≥ 2 be a positive integer. We study concentration results for the ordered representation functions r≤k(A,n) = \# \ (a1 ≤ … ≤ ak) ∈ Ak : a1+…+ak = n \ and r<k(A,n) = \# \ (a1 < … < ak) ∈ Ak : a1+…+ak = n \ for any infinite set of non-negative integers A. Our main theorem is an Erdos--Fuchs-type result for both functions: for any c > 0 and ∈ \≤,<\ we show that Σj = 0n ( rk(A,j) - c ) = o(n1/4 -1/2n ) is not possible. We also show that the mean squared error Ek,c(A,n)=1n Σj = 0n ( rk(A,j) - c )2 satisfies n ∞ Ek,c(A,n)>0. These results extend two theorems for the non-ordered representation function proved by Erdos and Fuchs in the case of k=2 (J. of the London Math. Society 1956).
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.