The Hook Graphs of the Symmetric Group

1954/01/01 by J. S. Frame, G. de B. Robinson, Robert Thrall · 13 citations
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Finite Group Theory Research

paper · pdf · doi:10.4153/cjm-1954-030-1

openalex publication_date 1954/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

Each irreducible representation [λ] of the symmetric group S n may be identified by a partition [λ] of n into non-negative integral parts λ 1 ≥ λ 2 ≥ … λ n ≥ 0, of which the first λ' j parts are ≥ j , or by a right (Young) diagram also called [λ], that contains λ i nodes in its ith row and λ' j nodes in its jth column.

Citations

• On the Representations of the Symmetric Group

Cited by

• Longest Increasing and Decreasing Subsequences
• A nonparametric independence test using random permutations
• A cornucopia of quasi-Yamanouchi tableaux
• The inequality on the number of 1-hooks, 2-hooks and 3-hooks in t-regular partitions
• A measure of the agreement between rankings
• Limit shapes for random square Young tableaux and plane partitions
• Intersecting families of permutations
• On the minimal degrees of characters of Sn
• Random sorting networks
• Generalization of the Tavis–Cummings model for multi-level anharmonic systems
• Quantum mutual information along unitary orbits
• The number of two-way tables satisfying certain additivity axioms
• Gilbert de Beauregard Robinson [wikipedia]