Finite posets and Ferrers shapes
From MaRDI portal
Publication:5937633
DOI10.1006/aima.2000.1966zbMath0986.06003arXivmath/9912126OpenAlexW2079784725WikidataQ105613682 ScholiaQ105613682MaRDI QIDQ5937633
Publication date: 1 November 2001
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9912126
Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07) Combinatorial optimization (90C27)
Related Items
Semistandard tableaux associated with generalized labellings of posets ⋮ Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes ⋮ Chain lengths in the dominance lattice ⋮ Commuting nilpotent matrices and Artinian algebras. ⋮ Bound on the Jordan type of a generic nilpotent matrix commuting with a given matrix ⋮ The poset of the nilpotent commutator of a nilpotent matrix ⋮ The smallest part of the generic partition of the nilpotent commutator of a nilpotent matrix ⋮ Nilpotent matrices having a given Jordan type as maximum commuting nilpotent orbit ⋮ Matrix-ball construction of affine Robinson-Schensted correspondence ⋮ A transitivity result for ad-nilpotent ideals in type \(A\) ⋮ Combinatorial symbolic powers ⋮ Minuscule reverse plane partitions via quiver representations ⋮ Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams ⋮ \(P\)-partition generating function equivalence of naturally labeled posets ⋮ The Burge correspondence and crystal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Robinson-Schensted-Knuth correspondence
- Some sequences associated with combinatorial structures
- An occurrence of the Robinson-Schensted correspondence
- A short proof of the existence of k-saturated partitions of partially ordered sets
- On chain and antichain families of a partially ordered set
- Extending the Greene-Kleitman theorem to directed graphs
- An extension of Schensted's theorem
- Some partitions associated with a partially ordered set
- A Littlewood-Richardson miscellany
- Orthogonal structures in directed graphs
- Brauer diagrams, updown tableaux and nilpotent matrices
- The Robinson-Schensted and Schützenberger algorithms, an elementary approach
- Flag varieties and interpretations of Young tableau algorithms
- A decomposition theorem for partially ordered sets
- Longest Increasing and Decreasing Subsequences
- Addendum to a paper of M. Saks
- Maximum Rank of Powers of a Matrix of a Given Pattern
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- Dilworth Numbers, Incidence Maps and Product Partial Orders
- On greene's theorem for digraphs
- Quelques remarques sur une Construction de Schensted.
- A Dual of Dilworth's Decomposition Theorem
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- The structure of Sperner k-families
