Exponential Generating Functions

Exponential Generating Functions is a type of generating function in which the coefficients of the series are weighted by factorials, specifically defined as a formal power series of the form $ \sum_{n=0}^{\infty} a_n \frac{x^n}{n!} $, distinguishing it from ordinary generating functions by its incorporation of the exponential denominator to encode combinatorial structures involving labeled objects.

180

Publications

9.5K

Citations

294

Authors

187

Institutions

Publications per year

2017–2026

19

Authors

294

  1. HM
    H. M. Srivastava

    University of Victoria, Canada

    5 publications · 229 citations

    5

    h-index

  2. CA
    Chinnaraji Annamalai

    Indian Institute of Technology Kharagpur, India

    3 publications · 96 citations

    3

    h-index

  3. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 113 citations

    3

    h-index

  4. NW
    Nicholas Wormald

    The University of Melbourne, Australia

    2 publications · 31 citations

    2

    h-index

  5. NK
    N.B. Karayiannis

    University of Houston, United States

    2 publications · 330 citations

    2

    h-index

1–5 of 294

Venues

  1. American Mathematical Monthly

    6 publications · 240 citations

    6

    h-index

  2. arXiv (Cornell University)

    Repository · 6 publications · 101 citations

    6

    h-index

  3. Proceedings of the American Mathematical Society

    PROC · 4 publications · 65 citations

    4

    h-index

  4. Duke Mathematical Journal

    DMJ · 4 publications · 288 citations

    4

    h-index

  5. Pacific Journal of Mathematics

    4 publications · 104 citations

    4

    h-index

1–5