Ordinary Generating Functions
Ordinary Generating Functions is a type of formal power series in which the sequence of coefficients corresponds directly to a sequence of combinatorial counts, distinguished from other generating functions by encoding the sequence $\{a_n\}$ as $\sum_{n=0}^{\infty} a_n x^n$ without additional weighting factors such as factorial denominators or exponential terms.
27
Publications
654
Citations
43
Authors
23
Institutions
Publications per year
2017–2026
6
Variants
OgfOrdinary Generating Function
27
The enumeration of simple permutations
Michael Albert, M. D. Atkinson, Martin Klazar · ArXiv.org · 2003 · 76 citations · Full text
1–5 of 27
43
5
h-index
3
h-index
National Agency for New Technologies, Energy and Sustainable Economic Development, Italy
2 publications · 48 citations
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 56 citations
2
h-index
2
h-index
1–5 of 43
23
University of Trás-os-Montes and Alto Douro
Vila Real, Portugal
3 h-index
5 publications
152 citations
National Agency for New Technologies, Energy and Sustainable Economic Development
Rome, Italy
2 h-index
4 publications
110 citations
Henan Polytechnic University
Jiaozuo, China
1 h-index
1 publications
12 citations
Tbilisi State University
Tbilisi, Georgia
1 h-index
1 publications
17 citations

Indian Institute of Technology Madras
Chennai, India
1 h-index
1 publications
20 citations

Sapienza University of Rome
Rome, Italy
1 h-index
1 publications
17 citations
Inspiration Innovation Synergy University
Jaipur, India
1 h-index
1 publications
14 citations
Inner Mongolia University for Nationalities
Tongliao, China
1 h-index
1 publications
12 citations
1–8 of 23
2 publications · 53 citations
2
h-index
Repository · 2 publications · 86 citations
2
h-index
Repository · 2 publications · 34 citations
2
h-index
Repository · 1 publications · 27 citations
1
h-index
1 publications · 63 citations
1
h-index
1–5