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:
Bodirsky, Manuel, Fusy, Eric, Kang, Mihyun, Vigerske, Stefan (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Leroux, Pierre (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kemkes, Graeme, Merlini, Donatella, Richmond, Bruce (2008)
Integers
Similarity:
Faris, William G. (2010)
Probability Surveys [electronic only]
Similarity:
Gerke, Stefanie, Giménez, Omer, Noy, Marc, Weißl, Andreas (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gittenberger, Bernhard, Mandlburger, Johannes (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pittel, Boris, Yeum, Ji-A (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bender, Edward A., Gao, Zhicheng, Wormald, Nicholas C. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
De Angelis, Valerio (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. Boersma (1962-1964)
Compositio Mathematica
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.