The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “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)”

On relations between f -density and ( R ) -density

Václav Kijonka (2007)

Acta Mathematica Universitatis Ostraviensis

Similarity:

In this paper it is discus a relation between f -density and ( R ) -density. A generalization of Šalát’s result concerning this relation in the case of asymptotic density is proved.

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.

On the sumset of the primes and a linear recurrence

Christian Ballot, Florian Luca (2013)

Acta Arithmetica

Similarity:

Romanoff (1934) showed that integers that are the sum of a prime and a power of 2 have positive lower asymptotic density in the positive integers. We adapt his method by showing more generally the existence of a positive lower asymptotic density for integers that are the sum of a prime and a term of a given nonconstant nondegenerate integral linear recurrence with separable characteristic polynomial.