Concepedia

Hook-length Formula

The Hook-Length Formula is a combinatorial theorem that belongs to the class of enumeration methods in algebraic combinatorics and specifically provides a closed-form expression for the number of standard Young tableaux of a given integer partition shape by taking the factorial of the partition size divided by the product of the hook lengths of the cells in the corresponding Young diagram.

43

Publications

2.4K

Citations

55

Authors

47

Institutions

Publications per year

2017–2026

5

Variants

Frame-robinson-thrall Formula

Parents

Publications

43

Binomial determinants, paths, and hook length formulae

Ira M. Gessel, Gérard Viennot · Advances in Mathematics · 1985 · 791 citations

, , +6

ON A GENERALIZATION OF THE NOTION OF MANIFOLD

Ichirō Satake · Proceedings of the National Academy of Sciences · 1956 · 579 citations · Full text

, , +7

q-Hook length formulas for forests

Anders Björner, Michelle L. Wachs · Journal of Combinatorial Theory Series A · 1989 · 67 citations

, , +2

A Refinement of Cayley's Formula for Trees

Ira M. Gessel, Seunghyun Seo · The Electronic Journal of Combinatorics · 2006 · 61 citations · Full text

, , +8

Dimensions of irreducible representations of the classical Lie groups

N El Samra, Ronald C. King · Journal of Physics A Mathematical and General · 1979 · 58 citations

, , +12

1–5 of 43

Authors

55

  1. GH
    Guo-Niu Han

    Centre National de la Recherche Scientifique, France

    6 publications · 129 citations

    6

    h-index

  2. IP
    Igor Pak

    University of California, Los Angeles, United States

    5 publications · 151 citations

    5

    h-index

  3. MP
    Maria Pickering

    University of Connecticut, United States

    3 publications · 36 citations

    3

    h-index

  4. GP
    Greta Panova

    University of California, Los Angeles, United States

    3 publications · 61 citations

    3

    h-index

  5. JN
    Janine N. Caira

    University of Connecticut, United States

    3 publications · 36 citations

    3

    h-index

1–5 of 55

Institutions

47

  1. Nankai University

    Tianjin, China

    4 h-index

    7 publications

    110 citations

  2. Centre National de la Recherche Scientifique

    Paris, France

    4 h-index

    4 publications

    86 citations

  3. University of California, Los Angeles

    Los Angeles, United States

    3 h-index

    5 publications

    107 citations

  4. Université de Strasbourg

    Strasbourg, France

    3 h-index

    3 publications

    51 citations

  5. University of Minnesota

    Minneapolis, United States

    2 h-index

    2 publications

    38 citations

  6. Institut de Recherche Mathématique Avancée

    Strasbourg, France

    2 h-index

    2 publications

    59 citations

  7. Massachusetts Institute of Technology

    Cambridge, United States

    2 h-index

    2 publications

    59 citations

  8. University of California San Diego

    San Diego, United States

    2 h-index

    3 publications

    65 citations

1–8 of 47

Venues

  1. The Electronic Journal of Combinatorics

    5 publications · 143 citations

    5

    h-index

  2. ArXiv.org

    Repository · 4 publications · 57 citations

    4

    h-index

  3. European Journal of Combinatorics

    4 publications · 89 citations

    4

    h-index

  4. The Ramanujan Journal

    3 publications · 67 citations

    3

    h-index

  5. Journal of Combinatorial Theory Series A

    3 publications · 144 citations

    3

    h-index

1–5