Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:A non-iterative rule for straightening fillings of Young diagrams
Speaker:Reuven Hodges
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 16 October 2018
Duration:30 Minutes
Building:E1 4
Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on a straightening process, originally due to Alfred Young, that expresses a filling of a Young diagram as a sum of semistandard tableaux subject to certain relations. All previously existing algorithms for straightening a filling have been iterative processes and it has been a long-standing open problem to give a non-iterative algorithm. In this talk I will provide such an algorithm, as well as a simple combinatorial description of the coefficients that arise. This non-iterative method is both more useful for proofs and considerably more efficient than the classical straightening algorithms. I will cover all the combinatorial background necessary for this topic, the only prerequisite is some basic linear algebra.
Name(s):Reuven Hodges
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Keywords:straightening; Young diagrams; tableau; representation theory
Attachments, File(s):
Reuven Hodges, 10/09/2018 01:59 PM
Last modified:
Uwe Brahm/MPII/DE, 10/16/2018 04:01 AM
  • Reuven Hodges, 10/09/2018 01:59 PM -- Created document.