On Shank's algorithm for modular square roots.
A criterion for non-automaticity of sequences.
An estimate for Frobenius' Diophantine problem in three dimensions.
Achieving snaky.
The greatest common divisor of two recursive functions.
Lower bounds for -ary codes with large covering radius.
Sumsets avoiding squarefree integers
The exponential sum over squarefree integers
The irrationality of some number theoretical series
Lower bounds for expressions of large sieve type
We show that the large sieve is optimal for almost all exponential sums.
Finiteness of a class of Rabinowitsch polynomials
We prove that there are only finitely many positive integers such that there is some integer such that is 1 or a prime for all , thus solving a problem of Byeon and Stark.
The prime number theorem for Beurling's generalized numbers. New cases
An improvement on Olson's constant for ℤₚ ⊕ ℤₚ
Corrigendum to "An improvement on Olson's constant for ℤₚ ⊕ ℤₚ" (Acta Arith. 141 (2010), 311-319)
On the number of integers represented by systems of Abelian norm forms
Improving on the Brun-Titchmarsh theorem
The structure of maximal zero-sum free sequences
Asymptotic stability for sets of polynomials
We introduce the concept of asymptotic stability for a set of complex functions analytic around the origin, implicitly contained in an earlier paper of the first mentioned author (“Finite group actions and asymptotic expansion of ", Combinatorica 17 (1997), 523 – 554). As a consequence of our main result we find that the collection of entire functions with the set of all real polynomials satisfying Hayman’s condition is asymptotically stable. This answers a question raised in loc. cit.
Page 1