Eulerian Numbers
Eulerian Numbers is a combinatorial enumeration construct that counts the number of permutations of a finite set with a specified number of descents, distinguishing it from other permutation statistics by focusing on the distribution of ascents and descents within linear orderings.
300
Publications
11.9K
Citations
396
Authors
265
Institutions
Publications per year
2017–2026
41
300
THE EULERIAN FUNCTIONS OF A GROUP
P. Hall · The Quarterly Journal of Mathematics · 1936 · 342 citations
Eulerian Numbers and Polynomials
L. Carlitz · Mathematics Magazine · 1959 · 224 citations
𝑞-Bernoulli and Eulerian numbers
L. Carlitz · Transactions of the American Mathematical Society · 1954 · 211 citations · Full text
1–5 of 300
396
12
h-index
11
h-index
8
h-index
7
h-index
7
h-index
1–5 of 396
265

Kwangwoon University
Seoul, South Korea
10 h-index
15 publications
374 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
11 publications
269 citations

Pennsylvania State University
State College, United States
9 h-index
9 publications
310 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
7 publications
1.1K citations
Université Claude Bernard Lyon 1
Villeurbanne, France
5 h-index
7 publications
190 citations

University of Minnesota
Minneapolis, United States
5 h-index
5 publications
295 citations
Sogang University
Seoul, South Korea
5 h-index
5 publications
118 citations
Duke University
Durham, United States
5 h-index
5 publications
246 citations
1–8 of 265
13 publications · 501 citations
12
h-index
11 publications · 224 citations
10
h-index
DMJ · 11 publications · 371 citations
10
h-index
12 publications · 286 citations
10
h-index
9 publications · 307 citations
9
h-index
1–5