Related papers: Standard Rothe Tableaux
We generalize the work of Fomin, Greene, Reiner, and Shimozono on balanced labellings in two directions: (1) we define the diagrams of affine permutations and the balanced labellings on them; (2) we define the set-valued version of the…
The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec…
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard…
In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…
We introduce tableau stabilization, a new phenomenon and statistic on Young tableaux based on jeu de taquin. We investigate bounds for tableau stabilization, the shape of stabilized tableaux, and tableau stabilization as a permutation…
Richardson tableaux are a remarkable subfamily of standard Young tableaux introduced by Karp and Precup in order to index the irreducible components of Springer fibers equal to Richardson varieties. We show that the set of insertion…
Given a finite word $w$, Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial $\phi_w(t)$ of $w$, which records the set of self-overlaps of $w$, explicitly determines for each $n$, the…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of even or…
We explain how genomic tableaux [Pechenik-Yong '15] are a semistandard complement to increasing tableaux [Thomas-Yong '09]. From this perspective, one inherits genomic versions of jeu de taquin, Knuth equivalence, infusion and Bender-Knuth…
This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R.…
A EW-tableau is a certain 0/1-filling of a Ferrers diagram, corresponding uniquely to an acyclic orientation, with a unique sink, of a certain bipartite graph called a Ferrers graph. We give a bijective proof of a result of Ehrenborg and…
In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-off between domain and endpoint constraints. We present a family of such bijections for simple walks in Weyl chambers which use arc…
Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…
Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…
It has been more than twenty years since Moshe Newman, based on work by Neil Calkin and Herbert Wilf, introduced an explicit bijection between the rational and natural numbers. Interestingly, this bijection is dynamic in nature. Indeed,…
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…
We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG…
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants.…