Greene-kleitman Theorem

The Greene-Kleitman Theorem is a fundamental result in algebraic combinatorics that establishes a precise relationship between the shape of a Young tableau and the maximum size of a union of k disjoint increasing subsequences in a permutation, by equating it to the sum of the first k parts of the associated partition via the Robinson-Schensted correspondence.

24

Publications

1.2K

Citations

42

Authors

34

Institutions

Publications per year

2017–2026

4

Authors

42

  1. HE
    H. E. Slaught

    2 publications · 204 citations

    2

    h-index

  2. IA
    Ian Anderson

    University of Manchester, United Kingdom

    2 publications · 492 citations

    2

    h-index

  3. RD
    Rafael de la Llave

    The University of Texas at Austin, United States

    1 publications · 58 citations

    1

    h-index

  4. JR
    Jérémie Rostand

    Université Laval, Canada

    1 publications · 12 citations

    1

    h-index

  5. MA
    Miguel A. Méndez

    Instituto Venezolano de Investigaciones Científicas, Venezuela

    1 publications · 10 citations

    1

    h-index

1–5 of 42

Venues

  1. American Mathematical Monthly

    5 publications · 583 citations

    5

    h-index

  2. Computational Methods and Function Theory

    1 publications · 12 citations

    1

    h-index

  3. Journal of Statistical Physics

    1 publications · 58 citations

    1

    h-index

  4. Journal of Combinatorial Theory Series A

    1 publications · 47 citations

    1

    h-index

  5. Journal of Algebraic Combinatorics

    1 publications · 24 citations

    1

    h-index

1–5