A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T yet lack the appropriate relative ordering to make T column-standard. An i-inverted Young tableau is a row-standard tableau along with precisely i inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number of i-inverted tableaux that standardize to a fixed standard Young tableau corresponding to a specific Betti number of the associated fiber. In this paper we approach the topic of tableau inversions from a completely combinatorial perspective. We develop formulas enumerating the number of i-inverted Young tableaux for a variety of tableaux shapes, not ...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fil...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
Abstract. The number of standard Young tableaux of a fixed shape is famously given by the hook-lengt...
AbstractThe conjugacy class of nilpotent n×n matrices can be parameterized by partitions λ of n, and...
AbstractWe give a family of weighted inversion numbers with the same generating function which inter...
AbstractFor their bijective proof of the hook-length formula for the number of standard tableaux of ...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
Young tableaux are combinatorial objects related to the partitions of an integer and have various ap...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
We develop two combinatorial proofs of the fact that certain Young tableaux are counted by the Catal...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fil...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
Abstract. The number of standard Young tableaux of a fixed shape is famously given by the hook-lengt...
AbstractThe conjugacy class of nilpotent n×n matrices can be parameterized by partitions λ of n, and...
AbstractWe give a family of weighted inversion numbers with the same generating function which inter...
AbstractFor their bijective proof of the hook-length formula for the number of standard tableaux of ...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
Young tableaux are combinatorial objects related to the partitions of an integer and have various ap...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
We develop two combinatorial proofs of the fact that certain Young tableaux are counted by the Catal...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fil...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...