A non-iterative formula for straightening fillings of Young diagrams

Reuven Hodges
Friday, December 6, 2019 - 3:30pm to 4:30pm
Vincent Hall 570

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 that expresses a filling of a Young diagram as a sum of semistandard tableaux subject to certain relations. It has been a long-standing open problem to give a non-iterative formula for this straightening process. In this talk I will give such a formula. I will then use this non-iterative formula give a proof that the coefficient of the leading term in the straightening is either 1 or -1, generalizing a theorem of Gonciulea and Lakshmibai.