Four correspondences between graphs and generalized Young tableaux

DOI10.1016/0097-3165(74)90024-7zbMath0286.05115OpenAlexW2053554440MaRDI QIDQ1845893

William H. Burge

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90024-7

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vector and tensor algebra, theory of invariants (15A72) Enumeration in graph theory (05C30)

Related Items (39)

Hidden invariance of last passage percolation and directed polymers ⋮ The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices ⋮ MacMahon’s Dream ⋮ Colored tournaments and Weyl's denominator formula ⋮ Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux ⋮ Orthosymplectic Cauchy identities ⋮ Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes ⋮ Tableaux and matrix correspondences ⋮ The bijection between plane partitions and nonnegative matrices ⋮ The oriented swap process and last passage percolation ⋮ Fishburn trees ⋮ \(q\)-Whittaker functions, finite fields, and Jordan forms ⋮ Muttalib-Borodin plane partitions and the hard edge of random matrix ensembles ⋮ The Eulerian distribution on the fixed-point free involutions of the hyperoctahedral group ⋮ Gröbner bases of ideals cogenerated by Pfaffians ⋮ Determinantal point processes from symplectic and orthogonal characters and applications ⋮ On the combinatorics of LLT polynomials in \(Sp_{2n}\) ⋮ On the equality of two plane partition correspondences ⋮ The Hillman-Grassl correspondence and the enumeration of reverse plane partitions ⋮ Tournaments and generalized Young tableaux ⋮ The Cauchy identity for \(Sp(2n)\) ⋮ On the weighted enumeration of alternating sign matrices and descending plane partitions ⋮ A symmetry property for \(q\)-weighted Robinson-Schensted and other branching insertion algorithms ⋮ Algorithms for generating labelled graphs with given degree ⋮ Algebraic random walks in the setting of symmetric functions ⋮ Enumeration of generalized Young tableaux with bounded height ⋮ Tableau correspondences and representation theory ⋮ Lusztig data of Kashiwara-Nakashima tableaux in type D ⋮ Quantum nilpotent subalgebras of classical quantum groups and affine crystals ⋮ Quantum nilpotent subalgebras of classical quantum groups and affine crystals ⋮ The geometric Burge correspondence and the partition function of polymer replicas ⋮ Orthogonal tableaux and an insertion algorithm for \(SO(2n+1)\) ⋮ On a conjecture of Naito-Sagaki: Littelmann paths and Littlewood-Richardson Sundaram tableaux ⋮ A combinatorial realization of Kirillov-Reshetikhin crystals for type E arising from translations ⋮ Quantum field theory meets Hopf algebra ⋮ Minimal and maximal elements in two-sided cells of \(S_n\) and Robinson-Schensted correspondence ⋮ A Schensted algorithm for rim hook tableaux ⋮ Transport of patterns by Burge transpose ⋮ The Burge correspondence and crystal graphs

Cites Work

• Permutations, matrices, and generalized Young tableaux
• Enumeration of plane partitions
• Group Characters and the Structure of Groups
• The Use of S-Functions in Combinatorial Analysis
• The Enumeration of Locally Restricted Graphs (II)
• Theory and Application of Plane Partitions. Part 2

This page was built for publication: Four correspondences between graphs and generalized Young tableaux