Related papers: An Involution on Involutions and a Generalization …
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$…
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 study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence…
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…
Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…
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$…
The study of longest increasing subsequences (LIS) in permutations led to that of Young diagrams via Robinson-Schensted's (RS) correspondence. In a celebrated paper, Vershik and Kerov obtained a limit theorem for such diagrams and found…
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…
We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to $[n,n,n]$: the {\em reduced web} basis associated to Kuperberg's combinatorial description of the spider category; and…
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…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
We define involution algebroids which generalise Lie algebroids to the abstract setting of tangent categories. As a part of this generalisation the Jacobi identity which appears in classical Lie theory is replaced by an identity similar to…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…
We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…
Hierarchies of evolution equations of pseudo-spherical type are introduced, generalizing the notion of a single equation describing pseudo-spherical surfaces due to S.S. Chern and K. Tenenblat, and providing a connection between…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…