Hayman admissible functions in several variables.
Gittenberger, Bernhard, Mandlburger, Johannes (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gittenberger, Bernhard, Mandlburger, Johannes (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kemkes, Graeme, Merlini, Donatella, Richmond, Bruce (2008)
Integers
Similarity:
Flajolet, Philippe, Salvy, Bruno, Schaeffer, Gilles (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Renato Spigler, Marco Vianello (2000)
Archivum Mathematicum
Similarity:
We propose a variant of the classical Liouville-Green approximation theorem for linear complex differential equations of the second order. We obtain rigorous error bounds for the asymptotics at infinity, in the spirit of F. W. J. Olver’s formulation, by using rather arbitrary -progressive paths. This approach can provide higher flexibility in practical applications of the method.
Benoit, E. (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Shimura, Goro (2008)
Documenta Mathematica
Similarity:
Flajolet, Philippe, Fusy, Eric, Gourdon, Xavier, Panario, Daniel, Pouyanne, Nicolas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fulmek, Markus (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maisoon Falah, Toufik Mansour (2011)
Open Mathematics
Similarity:
A composition of a positive integer n is a finite sequence π1π2...πm of positive integers such that π1+...+πm = n. Let d be a fixed number. We say that we have an ascent of size d or more (respectively, less than d) if πi+1 ≥ πi+d (respectively, πi < πi+1 < πi + d). Recently, Brennan and Knopfmacher determined the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. In this paper, we find an explicit formula for the...
Nolin, Pierre (2008)
Electronic Journal of Probability [electronic only]
Similarity: