A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics.
Flajolet, Philippe, Fusy, Eric, Gourdon, Xavier, Panario, Daniel, Pouyanne, Nicolas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Flajolet, Philippe, Fusy, Eric, Gourdon, Xavier, Panario, Daniel, Pouyanne, Nicolas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kellner, Bernd C. (2009)
Integers
Similarity:
Broughan, Kevin A. (2001)
Journal of Integer Sequences [electronic only]
Similarity:
Hideaki Ishikawa, Kohji Matsumoto (2011)
Open Mathematics
Similarity:
We prove an explicit formula of Atkinson type for the error term in the asymptotic formula for the mean square of the product of the Riemann zeta-function and a Dirichlet polynomial. To deal with the case when coefficients of the Dirichlet polynomial are complex, we apply the idea of the first author in his study on mean values of Dirichlet L-functions.
Hamel, A.M., King, R.C. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Knessl, Charles, Szpankowski, Wojciech (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Javier Cilleruelo, Florian Luca, Juanjo Rué, Ana Zumalacárregui (2013)
Open Mathematics
Similarity:
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
Loveless, Andrew D. (2006)
Integers
Similarity:
Manstavicius, Eugenijus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kühleitner, M. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Sapounakis, A., Tsikouras, P. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Peter J. Grabner (1993)
Acta Arithmetica
Similarity: