Abstract
For a subset A of ℕ = {0, 1, 2, . . .}, the representation function of A is defined by rA(n) = |{(a, b) ∈ A × A : a + b = n}|, for n ∈ ℕ, where |E| denotes the cardinality of a set E. Its supremum is the element s(A) = sup{rA(n) : n ∈ ℕ} of
. Interested in the question “when is s(A) = ∞?”, we study some properties of the function A ↦ s(A), determine its range, and construct some subsets A of ℕ for which s(A) satisfies certain prescribed conditions.
Published Online: 2011-08-07
Published in Print: 2011-October
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On Congruent Numbers with Three Prime Factors
- Projective p-Orderings and Homogeneous Integer-Valued Polynomials
- Analyzing Two-Color Babylon
- On the Number of Points in a Lattice Polytope
- Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers
- An Extreme Family of Generalized Frobenius Numbers
- On the Distance Between Smooth Numbers
- Analogs of the Stern Sequence
- On Some Equations Related to Ma's Conjecture
- Normality, Projective Normality and EGZ Theorem
- The (Exponential) Bipartitional Polynomials and Polynomial Sequences of Trinomial Type: Part II
- Supremum of Representation Functions
Articles in the same Issue
- On Congruent Numbers with Three Prime Factors
- Projective p-Orderings and Homogeneous Integer-Valued Polynomials
- Analyzing Two-Color Babylon
- On the Number of Points in a Lattice Polytope
- Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers
- An Extreme Family of Generalized Frobenius Numbers
- On the Distance Between Smooth Numbers
- Analogs of the Stern Sequence
- On Some Equations Related to Ma's Conjecture
- Normality, Projective Normality and EGZ Theorem
- The (Exponential) Bipartitional Polynomials and Polynomial Sequences of Trinomial Type: Part II
- Supremum of Representation Functions