Sets of integers that do not contain long arithmetic progressions.
O'Bryant, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
O'Bryant, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Benjamini, Itai, Yadin, Ariel, Zeitouni, Ofer (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Manfred Kühleitner, Werner Nowak (2013)
Open Mathematics
Similarity:
The paper deals with lower bounds for the remainder term in asymptotics for a certain class of arithmetic functions. Typically, these are generated by a Dirichlet series of the form ζ 2(s)ζ(2s−1)ζ M(2s)H(s), where M is an arbitrary integer and H(s) has an Euler product which converges absolutely for R s > σ0, with some fixed σ0 < 1/2.
Graham, Ron (2006)
Integers
Similarity:
G. Jogesh Babu (1975)
Acta Arithmetica
Similarity:
John Friedlander, Andrew Granville (1992)
Compositio Mathematica
Similarity:
Ekkehard Krätzel, Werner Nowak, László Tóth (2012)
Open Mathematics
Similarity:
The paper deals with asymptotics for a class of arithmetic functions which describe the value distribution of the greatest-common-divisor function. Typically, they are generated by a Dirichlet series whose analytic behavior is determined by the factor ζ2(s)ζ(2s − 1). Furthermore, multivariate generalizations are considered.
Heini Halberstam (1971-1972)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity: