We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A2n(2143) of alternating permutations of length 2n avoiding 2143 and the set of standard Young tableaux of shape 〈n, n, n〉, and between the set A2n+1(2143) of alternating permutations of length...

We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva in [CDPR12] between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of linear equivalence. We present an explicit formula for computing the v0-reduced divisors (representatives of the equivalence classes) associated to...

This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any tableau with at least $5$ entries its set

Tableaux have long been used to study combinatorial properties of permutations and multiset permutations. Discovered independently by Robinson and Schensted and generalized by Knuth, the Robinson-Schensted correspondence has provided a fundamental tool for relating permutations to tableaux. In 1963, Schützenberger defined a process called evacuation on standard tableaux which gives a relationsh...

The number of words w = w 1 w n , 1 w i k, standard and semi-standard Young tableaux. When n ! 1, the asymptotics of the number of such words is calculated.

For a semisimple Lie algebra g the orbit method attempts to assign representations of g to (coadjoint) orbits in g∗. Orbital varieties are particular Lagrangian subvarieties of such orbits leading to highest weight representations of g. In sln orbital varieties are described by Young tableaux. In this paper we consider so called Richardson orbital varieties in sln. A Richardson orbital variety ...