A non-iterative formula for straightening fillings of Young diagrams

From MaRDI portal
Publication:6202522

DOI10.1007/S00029-024-00923-9arXiv1710.05214MaRDI QIDQ6202522FDOQ6202522


Authors: Reuven Hodges Edit this on Wikidata


Publication date: 26 March 2024

Published in: Selecta Mathematica. New Series (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1710.05214




Recommendations




Cites Work






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)