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

Authors

396

  1. LC
    L. Carlitz

    Duke University, United States

    13 publications · 869 citations

    12

    h-index

  2. TK
    Taekyun Kim

    Kwangwoon University, South Korea

    13 publications · 581 citations

    11

    h-index

  3. DS
    Dae San Kim

    Sogang University, South Korea

    8 publications · 158 citations

    8

    h-index

  4. GE
    George E. Andrews

    Pennsylvania State University, United States

    7 publications · 284 citations

    7

    h-index

  5. JZ
    Jiang Zeng

    Université Claude Bernard Lyon 1, France

    7 publications · 174 citations

    7

    h-index

1–5 of 396

Venues

  1. Discrete Mathematics

    13 publications · 501 citations

    12

    h-index

  2. Journal of Combinatorial Theory Series A

    11 publications · 224 citations

    10

    h-index

  3. Duke Mathematical Journal

    DMJ · 11 publications · 371 citations

    10

    h-index

  4. The Electronic Journal of Combinatorics

    12 publications · 286 citations

    10

    h-index

  5. Journal of Number Theory

    9 publications · 307 citations

    9

    h-index

1–5