Related papers: An RSK correspondence for cylindric tableaux
Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation \sigma\ as a pattern, the shape of w contains the…
The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…
We construct classes of ${\cal N}=1$ superconformal theories elements of which are labeled by punctured Riemann surfaces. Degenerations of the surfaces correspond, in some cases, to weak coupling limits. Different classes are labeled by two…
A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due…
Littlewood-Richardson (LR) coefficients $c_{\mu\nu}^\lambda$ may be evaluated by means of several combinatorial models, including the original LR tableaux of skew shape $\lambda/\mu$ and weight $\nu$ and the LR hives with boundary edge…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
Dyck tilings are certain tilings in the region surrounded by two Dyck paths. We study bijections and combinatorial objects bijective to Dyck tilings, which include Dyck tiling strip (DTS) and Dyck tiling ribbon (DTR) bijections, increasing…
We consider two examples of a fully decodable combinatorial encoding of Bernoulli schemes: the encoding via Weyl simplices and the much more complicated encoding via the RSK (Robinson--Schensted--Knuth) correspondence. In the first case,…
Let $r$ and $n$ be positive integers, let $G_n$ be the complex reflection group of $n \times n$ monomial matrices whose entries are $r^{\textrm{th}}$ roots of unity and let $0 \leq k \leq n$ be an integer. Recently, Haglund, Rhoades and…
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…
We start with an ``algebraic'' RSK-correspondence due to Noumi and Yamada. Given a matrix $X$, we consider a pyramidal array of solid minors of $X$. It turns out that this array satisfies an algebraic variant of octahedron recurrence. The…
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
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.…
A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…
In this paper we investigate a permutation statistic that was independently introduced by Romik in 2005. This statistic counts the number of bumps that occur during the execution of the Robinson-Schensted procedure when applied to a given…
Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…
Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2$, $2n$, $2n+2$, $2n$, $2n+2$, $2n$ and a central triangular hole of size $2$ that…
By a nondegenerate $k$-parameterized family $K$ of periodic solutions we understand the situation when the geometric multiplicity of the multiplier +1 of the linearized on $K$ system equals to $k.$ Bifurcation of asymptotically stable…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…