Additive bases with many representations
Paul Erdös, Melvyn Nathanson (1989)
Acta Arithmetica
Similarity:
Displaying similar documents to “The Erdős-Turán property for a class of bases”
Additive bases with many representations
A new upper bound for finite additive bases
C. Sinan Güntürk, Melvyn B. Nathanson (2006)
Acta Arithmetica
Similarity:
An improvement of an estimate for finite additive bases
G. Horváth (2007)
Acta Arithmetica
Similarity:
Unique representation bases for the integers
Melvyn B. Nathanson (2003)
Acta Arithmetica
Similarity:
Bases of web Configurations
Aleksandar Krapež, M.A. Taylor (1985)
Publications de l'Institut Mathématique
Similarity:
Small digitwise perturbations of a number make it normal to unrelated bases.
Pushkin, L. (2002)
Lobachevskii Journal of Mathematics
Similarity:
The Erdős-Heilbronn problem for finite groups
Paul Balister, Jeffrey Paul Wheeler (2009)
Acta Arithmetica
Similarity:
Extremal problems about additive bases
Georges Grekos (1998)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Optimum transportation bases
W. Grabowski, W. Szwarc (1966)
Applicationes Mathematicae
Similarity:
Uniformly thin bases of order two
Christoph Schmitt (2006)
Acta Arithmetica
Similarity:
M-bases in spaces of continuous functions on ordinals
Ondrej F. K. Kalenda (2002)
Colloquium Mathematicae
Similarity:
We prove, among other things, that the space C[0,ω₂] has no countably norming Markushevich basis. This answers a question asked by G. Alexandrov and A. Plichko.
On additive bases with two elements
Giampiero Chiaselotti (2002)
Acta Arithmetica
Similarity:
Lower bounds for a conjecture of Erdős and Turán
Ioannis Konstantoulas (2013)
Acta Arithmetica
Similarity:
We study representation functions of asymptotic additive bases and more general subsets of ℕ (sets with few nonrepresentable numbers). We prove that if ℕ∖(A+A) has sufficiently small upper density (as in the case of asymptotic bases) then there are infinitely many numbers with more than five representations in A+A, counting order.