Related papers: Signed enumeration of ribbon tableaux
We study some properties of domino insertion, focusing on aspects related to Fomin's growth diagrams. We give a self-contained proof of the semistandard domino-Schensted correspondence given by Shimozono and White, bypassing the connections…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in ${\bf N}$, and standard Young tableaux by semistandard ones. For $r>0$, the Robinson-Schensted…
Permutation tableaux were introduced by Steingr\'{\i}msson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length $n$ is…
This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…
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…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We generalize a formula obtained independently by A. Reifegerste and J. Sj\"ostrand for the sign of a permutation under the classical Robinson-Schensted map to a family of domino Robinson-Schensted algorithms.
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…
We study the ribbon discs that arise from a symmetric union presentation of a ribbon knot. A natural notion of symmetric ribbon number is introduced and compared with the classical ribbon number. We show that the gap between these numbers…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…
We consider combinatorial aspects of $\lambda$-terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for $\lambda$-terms corresponds also to two families of binary…
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Schuetzenberger's jeu de taquin. More precisely, we describe certain structure constants…
We continue work begun in \cite{ptab} which introduced \emph{perforated tableaux} as a combinatorial model for crystals of type $A_{n-1}$, emphasizing connections to the classical Robinson-Schensted-Knuth (RSK) correspondence and Lusztig…
Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…
We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of…
The (dual) Cauchy identity has an easy algebraic proof utilising a commutation relation between the up and (dual) down operators. By using Fomin's growth diagrams, a bijective proof of the commutation relation can be "bijectivised" to…
As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant. First, a signed bigrassmannian polynomial is a variant of the statistic given…