Generating Functions

Generating Functions is a mathematical tool in combinatorics and probability theory that belongs to the class of formal power series, distinguished by its use of coefficients to encode sequences of numbers or probabilities for the purpose of solving enumeration and distribution problems.

10.2K

Publications

501.2K

Citations

9.7K

Authors

2.7K

Institutions

Publications per year

2017–2026

1.2K

Authors

9.7K

  1. HM
    H. M. Srivastava

    University of Victoria, Canada

    174 publications · 7.7K citations

    48

    h-index

  2. GE
    George E. Andrews

    Pennsylvania State University, United States

    60 publications · 2.5K citations

    30

    h-index

  3. LC
    L. Carlitz

    Duke University, United States

    60 publications · 2.3K citations

    29

    h-index

  4. YŞ
    Yılmaz Şimşek

    Akdeniz University, Türkiye

    75 publications · 2.6K citations

    29

    h-index

  5. TK
    Taekyun Kim

    Kwangwoon University, South Korea

    108 publications · 2.9K citations

    28

    h-index

1–5 of 9.7K

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 195 publications · 9.5K citations

    53

    h-index

  2. Discrete Mathematics

    159 publications · 6.9K citations

    46

    h-index

  3. Duke Mathematical Journal

    DMJ · 118 publications · 6.9K citations

    46

    h-index

  4. Proceedings of the London Mathematical Society

    108 publications · 7.5K citations

    44

    h-index

  5. Mathematics of Computation

    MCOM · 138 publications · 52.7K citations

    44

    h-index

1–5