Browsing by Author "Thomas, Hugh"

Now showing items 1-2 of 2

    • Cataland: Why the Fuß? 

      [OWP-2019-01] Stump, Christian; Thomas, Hugh; Williams, Nathan (Mathematisches Forschungsinstitut Oberwolfach, 2019-01-21)
      The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuß-Catalan generalizations. ...

    • The Robinson–Schensted algorithm 

      [SNAP-2022-002-EN] Thomas, Hugh (Mathematisches Forschungsinstitut Oberwolfach, 2022-05-06)
      I am going to describe the Robinson–Schensted algorithm which transforms a permutation of the numbers from 1 to n into a pair of combinatorial objects called “standard Young tableaux”. I will then say a little bit about a ...