Four correspondences between graphs and generalized Young tableaux

DOI10.1016/0097-3165(74)90024-7zbMATH Open0286.05115OpenAlexW2053554440MaRDI QIDQ1845893FDOQ1845893

Authors: 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)

Cites Work

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

Cited In (42)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1845893)