Sum-sets of small upper density
Guillaume Bordes (2005)
Acta Arithmetica
Similarity:
Displaying similar documents to “On relations between $f$-density and $(R)$-density”
Sum-sets of small upper density
Corrigendum to Theorem 5 of the paper "Asymptotic density of A ⊂ ℕ and density of the ratio set R(A) (Acta Arith. 87 (1998), 67-78)
Oto Strauch, Janos T. Toth (2002)
Acta Arithmetica
Similarity:
On the density maxima of a function
James Foran (1977)
Colloquium Mathematicae
Similarity:
On Density of Pairs of Natural Numbers
Rzepecka, Genowefa (2015-12-08T07:20:54Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
On a density problem of Erdös
David Lubell (1971)
Acta Arithmetica
Similarity:
Sets of positive integers with prescribed values of densities
Ladislav Mišík (2002)
Mathematica Slovaca
Similarity:
Extended rotation of the covariant vector density
Michał Lorens (1974)
Annales Polonici Mathematici
Similarity:
Green's sumset problem at density one half
Tom Sanders (2011)
Acta Arithmetica
Similarity:
Remarks on differential concomitants of densities
Erwin Kasparek, Michal Lorens (1971)
Annales Polonici Mathematici
Similarity:
Asymptotic density, computable traceability, and 1-randomness
Uri Andrews, Mingzhong Cai, David Diamondstone, Carl Jockusch, Steffen Lempp (2016)
Fundamenta Mathematicae
Similarity:
Let r ∈ [0,1]. A set A ⊆ ω is said to be coarsely computable at density r if there is a computable function f such that {n | f(n) = A(n)} has lower density at least r. Our main results are that A is coarsely computable at density 1/2 if A is computably traceable or truth-table reducible to a 1-random set. In the other direction, we show that if a degree a is hyperimmune or PA, then there is an a-computable set which is not coarsely computable at any positive density.