A non-iterative formula for straightening fillings of Young diagrams
From MaRDI portal
Publication:6202522
Abstract: Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process, due to Alfred Young, that expresses a filling of a Young diagram as a sum of semistandard tableau subject to certain relations. It has been a long-standing open problem to give a non-iterative, closed formula for this straightening process. This paper gives such a formula, as well as a simple combinatorial description of the coefficients that arise. Moreover, an interpretation of these coefficients in terms of paths in a directed graph is provided.
Recommendations
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 15434 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 1222249 (Why is no real title available?)
- scientific article; zbMATH DE number 3095637 (Why is no real title available?)
- A non-messing-up phenomenon for posets
- Algorithms in invariant theory
- An algorithm for the Rota straightening formula
- Degenerations of flag and Schubert varieties to toric varieties
- Standard monomial theory. Invariant theoretic approach
- Symmetrizing tableaux and the 5th case of the Foulkes conjecture
- Vertices of Specht modules and blocks of the symmetric group.
This page was built for publication: A non-iterative formula for straightening fillings of Young diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202522)