scholarly journals Minimal Orbits of Promotion

10.37236/5885 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Kevin Purbhoo ◽  
Donguk Rhee

We give a bijection between the symmetric group $S_n$, and the set of standard Young tableaux of rectangular shape $m^n$, $m \geq n$, that have order $n$ under jeu de taquin promotion. 

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Matthew Housley ◽  
Heather M. Russell ◽  
Julianna Tymoczko

International audience The $A_2$-spider category encodes the representation theory of the $sl_3$ quantum group. Kuperberg (1996) introduced a combinatorial version of this category, wherein morphisms are represented by planar graphs called $\textit{webs}$ and the subset of $\textit{reduced webs}$ forms bases for morphism spaces. A great deal of recent interest has focused on the combinatorics of invariant webs for tensors powers of $V^+$, the standard representation of the quantum group. In particular, the invariant webs for the 3$n$th tensor power of $V^+$ correspond bijectively to $[n,n,n]$ standard Young tableaux. Kuperberg originally defined this map in terms of a graphical algorithm, and subsequent papers of Khovanov–Kuperberg (1999) and Tymoczko (2012) introduce algorithms for computing the inverse. The main result of this paper is a redefinition of Kuperberg's map through the representation theory of the symmetric group. In the classical limit, the space of invariant webs carries a symmetric group action. We use this structure in conjunction with Vogan's generalized tau-invariant and Kazhdan–Lusztig theory to show that Kuperberg's map is a direct analogue of the Robinson–Schensted correspondence.


10.37236/5967 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Justyna Kosakowska ◽  
Markus Schmidmeier ◽  
Hugh Thomas

In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of  the box order and the dominance order for tableaux. Both are algorithmic. The first of these proofs emphasizes links to the Bruhat order for the symmetric group and the second provides a more straightforward construction of the cover relations. This work is motivated by the known result that the equivalence of the two combinatorial orders leads to a description of the geometry of the representation space of invariant subspaces of nilpotent linear operators.


10.37236/6806 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Herman Z. Q. Chen ◽  
Arthur L. B. Yang ◽  
Philip B. Zhang

In the study of Kostka numbers and Catalan numbers, Kirillov posed a unimodality conjecture for the rectangular Narayana polynomials. We prove that the rectangular Narayana polynomials have only real zeros, and thereby confirm Kirillov's unimodality conjecture. By using an equidistribution property between descent numbers and ascent numbers on ballot paths due to Sulanke and a bijection between lattice words and standard Young tableaux, we show that the rectangular Narayana polynomial is equal to the descent generating function on standard Young tableaux of certain rectangular shape, up to a power of the indeterminate. Then we obtain the real-rootedness of the rectangular Narayana polynomial based on a result of Brenti which implies that the descent generating function of standard Young tableaux has only real zeros.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Robin Sulzgruber

International audience The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin which transforms an arbitrary filling of a partition into a standard Young tableau by exchanging adjacent entries. Recently, Krattenthaler and Müller defined the complexity of this algorithm as the average number of performed exchanges, and Neumann and the author proved it fulfils some nice symmetry properties. In this paper we recall and extend the previous results and provide new bijective proofs.


10.37236/1918 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Anna Melnikov

We consider two partial orders on the set of standard Young tableaux. The first one is induced to this set from the weak right order on symmetric group by Robinson-Schensted algorithm. The second one is induced to it from the dominance order on Young diagrams by considering a Young tableau as a chain of Young diagrams. We prove that these two orders of completely different nature coincide on the subset of Young tableaux with 2 columns or with 2 rows. This fact has very interesting geometric implications for orbital varieties of nilpotent order 2 in special linear algebra $sl_n.$


10.37236/6836 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Oliver Pechenik

A key fact about M.-P. Schützenberger's (1972) promotion operator on rectangular standard Young tableaux is that iterating promotion once per entry recovers the original tableau. For tableaux with strictly increasing rows and columns, H. Thomas and A. Yong (2009) introduced a theory of $K$-jeu de taquin with applications to $K$-theoretic Schubert calculus. The author (2014) studied a $K$-promotion operator $\mathcal{P}$ derived from this theory, but observed that this key fact does not generally extend to $K$-promotion of such increasing tableaux. Here, we show that the key fact holds for labels on the boundary of the rectangle. That is, for $T$ a rectangular increasing tableau with entries bounded by $q$, we have $\mathsf{Frame}(\mathcal{P}^q(T)) = \mathsf{Frame}(T)$, where $\mathsf{Frame}(U)$ denotes the restriction of $U$ to its first and last row and column. Using this fact, we obtain a family of homomesy results on the average value of certain statistics over $K$-promotion orbits, extending a $2$-row theorem of J. Bloom, D. Saracino, and the author (2016) to arbitrary rectangular shapes.


2016 ◽  
Vol Vol. 18 no. 2, Permutation... (Permutation Patterns) ◽  
Author(s):  
Ran Pan ◽  
Jeffrey B. Remmel

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in $S_j$ is at least $3 -e$. Given a permutation $\sigma$, we let $\text{Des}(\sigma)$ denote the set of descents of $\sigma$. We study the class of permutations $\sigma \in S_{kn}$ whose descent set is contained in the set $\{k,2k, \ldots (n-1)k\}$. For example, up-down permutations in $S_{2n}$ are the set of permutations whose descent equal $\sigma$ such that $\text{Des}(\sigma) = \{2,4, \ldots, 2n-2\}$. There are natural analogues of the minimal overlapping permutations for such classes of permutations and we study the proportion of minimal overlapping patterns for each such class. We show that the proportion of minimal overlapping permutations in such classes approaches $1$ as $k$ goes to infinity. We also study the proportion of minimal overlapping patterns in standard Young tableaux of shape $(n^k)$. Comment: Accepted by Discrete Math and Theoretical Computer Science. Thank referees' for their suggestions


10.37236/9481 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Gonçalo Gutierres ◽  
Ricardo Mamede ◽  
José Luis Santos

 Using the standard Coxeter presentation for the symmetric group $\mathfrak{S}_{n}$, two reduced expressions for the same group element $\textsf{w}$ are said to be commutationally equivalent if one expression can be obtained from the other one  by applying a finite sequence of commutations. The commutation classes can be seen as the vertices of a graph $\widehat{G}(\textsf{w})$, where two classes are connected by an edge if elements of those classes differ by a long braid relation. We compute the radius and diameter of the graph $\widehat{G}(\textsf{w}_{\bf 0})$,  for the longest element  $\textsf{w}_{\bf 0}$ in the symmetric group $\mathfrak{S}_{n}$, and show that it is not a planar graph for $n\geq 6$. We also describe a family of commutation classes which contains all atoms, that is classes with one single element, and a subfamily of commutation classes whose elements are in bijection with standard Young tableaux of certain moon-polyomino shapes.


2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.


Sign in / Sign up

Export Citation Format

Share Document