Primes in Arithmetic Progressions to Large Moduli. II.

E. Bombieri; J.B. Friedlander; H. Iwaniec

Displaying similar documents to “Primes in Arithmetic Progressions to Large Moduli. II.”

Primes in arithmetic progressions to spaced moduli

Roger C. Baker (2012)

Acta Arithmetica

Similarity:

Bombieri-Vinogradov type theorems for sparse sets of moduli

Stephan Baier, Liangyi Zhao (2006)

Acta Arithmetica

Similarity:

The Generalized Divisor Problem Over Arithmetic Progressions.

Robert A. Smith (1982)

Mathematische Annalen

Similarity:

A note on small gaps between primes in arithmetic progressions

Deniz A. Kaptan (2016)

Acta Arithmetica

Similarity:

We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.

Irregularities of Sequences Relative to Arithmetic Progressions.

K.F. ROTH (1967)

Mathematische Annalen

Similarity:

Irregularities of Sequences Relative to Arithmetic Progressions. II.

K.F. ROTH (1967)

Mathematische Annalen

Similarity:

The Chen primes contain arbitrarily long arithmetic progressions

Binbin Zhou (2009)

Acta Arithmetica

Similarity:

On the Complete Independence of Schimmack's Postulates for the Arithmetic Mean

Ralph D. Beetle (1915)

Mathematische Annalen

Similarity:

On the Real Points of an Arithmetic Quotient of a Bounded Symmetrie Domain.

Goro Shimura (1975)

Mathematische Annalen

Similarity:

Sums of multiplicative function in special arithmetic progressions

Bin Feng (2019)

Czechoslovak Mathematical Journal

Similarity:

We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic functions on certain APs. It generalizes a result due to Cui and Wu (2014).

On non-intersecting arithmetic progressions

Régis de la Bretèche, Kevin Ford, Joseph Vandehey (2013)

Acta Arithmetica

Similarity:

We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).