Abstract
Many recurrences that occur in combinatorics incorporate linear and self-convolutive terms. The generating function associated to these is usually not well defined because it has zero radius of convergence. However, the sequence may be identifiable as the asymptotic expansion of a function, and then contour integration can be applied to obtain an expression as the moment sequence of a (possibly signed) measure. We find examples that in combinatorics are all connected with permutations, and whose generating functions are related to the exponential integral function.
Similar content being viewed by others
References
M. Abramowitz and I. A. Stegun: Handbook of Mathematical Functions, Dover, New York, 1964.
N. Bergeron, C. Hohlweg and M. Zabrocki: Posets related to the connectivity set of Coxeter groups. J. of Algebra 303 (2006), 831–846.
L. Comtet: Sur les coefficients de l’inverse de la série formelle ∑n n!t n, Comptes Rendus Acad. Sci. Paris A275 (1972), 569–572.
L. Comtet: Advanced Combinatorics, Reidel, 1974.
P. Flajolet and R. Sedgewick: Analytic Combinatorics, CUP, 2009.
R. J. Martin and M. J. Kearney: An exactly solvable self-convolutive recurrence. Aequationes Math. 80 (2010), 291–318.
OEIS Foundation: Online Encyclopedia of Integer Sequences, www.oeis.org.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martin, R.J., Kearney, M.J. Integral representation of certain combinatorial recurrences. Combinatorica 35, 309–315 (2015). https://doi.org/10.1007/s00493-014-3183-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-014-3183-3