Related papers: The number of inversions of permutations with fixe…
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…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
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$,…
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…
Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Spatial random permutations were originally studied due to their connections to Bose-Einstein condensation, but they possess many interesting properties of their own. For random permutations of a regular lattice with periodic boundary…
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…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…
An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known…
We consider the structure of roller coaster permutations as introduced by Ahmed & Snevily[1]. A roller coaster permutation is described as a permuta- tion that maximizes the total switches from ascending to descending or visa versa for the…
A {\em pointed partition} of $n$ is a pair $(\lambda, v)$ where $\lambda\vdash n$ and $v$ is a cell in its Ferrers diagram. We construct an involution on pointed partitions of $n$ exchanging "hook length" and "part length". This gives a…
In the symmetric group $S_n$, each element $\sigma$ has an associated cycle type $\alpha$, a partition of $n$ that identifies the conjugacy class of $\sigma$. The Robinson-Schensted (RS) correspondence links each $\sigma$ to another…