Related papers: Permutations whose reverse shares the same recordi…
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…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…
Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let $\mathcal{F}_d(n)$ denote the set of minimal permutations of length $n$ with $d$…
In this note I introduce a mysterious approximation called the rotating wave approximation (RWA) to undergraduates or non-experts who are interested in both Mathematics and Quantum Optics. In Quantum Optics it plays a very important role in…
Iterating the skew RSK correspondence discovered by Sagan and Stanley in the late '80s, we define a deterministic dynamics on the space of pairs of skew Young tableaux $(P,Q)$. We find that this skew RSK dynamics displays conservation laws…
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…
The coinvariant algebra is a quotient of the polynomial ring $\mathbb{Q}[x_1,\ldots,x_n]$ whose algebraic properties are governed by the combinatorics of permutations of length $n$. A word $w = w_1 \dots w_n$ over the positive integers is…
Super RSK correspondence is a bijective correspondence between superbiwords and pairs of semistandard supertableaux. Such a bijection was given by Bonetti, Senato and Venezia, via an insertion algorithm closely related to Schensted…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
Given two operators $\hat D$ and $\hat E$ subject to the relation $\hat D\hat E -q \hat E \hat D =p$, and a word $w$ in $M$ and $N$, the rewriting of $w$ in normal form is combinatorially described by rook placements in a Young diagram. We…
In this paper, we connect two types of representations of a permutation $\sigma$ of the finite field $\F_q$. One type is algebraic, in which the permutation is represented as the composition of degree-one polynomials and $k$ copies of…
We study relations between the two-parameter $\U_q(sl(n))$-invariant deformation quantization on $sl^*(n)$ and the reflection equation algebra. The latter is described by a quantum permutation on $\End(\C^n)$ given explicitly. The…
In arXiv:1808.06095 we have introduced the Knuth class of the word recording a sequence of locations for repeated internal insertion operations in the Sagan-Stanley skew RSK correspondence, with no prescribed external insertion of new…
Originating in the work of A.M. Semikhatov and D. Adamovi\'c, inverse reductions are embeddings involving W-algebras corresponding to the same Lie algebra but different nilpotent orbits. Here, we show that an inverse reduction embedding…
A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely…
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…
Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…
In symmetric groups, a two-sided cell is the set of all permutations which are mapped by the Robinson-Schensted correspondence on a pair of tableaux of the same shape. In this article, we show that the set of permutations in a two-sided…
Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…