scholarly journals Two Partial Orders for Standard Young Tableaux

10.37236/5967 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Justyna Kosakowska ◽  
Markus Schmidmeier ◽  
Hugh Thomas
Keyword(s):  
Symmetric Group ◽  
Invariant Subspaces ◽  
Bruhat Order ◽  
Partial Orders ◽  
Linear Operators ◽  
Dominance Order ◽  
Representation Space ◽  
Young Tableaux ◽  
Standard Young Tableaux

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.

scholarly journals The Combinatorics of Orbital Varieties Closures of Nilpotent Order 2 in sl${}_n$

10.37236/1918 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Anna Melnikov
Keyword(s):  
Symmetric Group ◽  
Linear Algebra ◽  
Young Tableau ◽  
Dominance Order ◽  
Young Tableaux ◽  
Young Diagrams ◽  
Special Linear ◽  
A Chain ◽  
Standard Young Tableaux ◽  
Right Order

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.$

scholarly journals The Robinson―Schensted Correspondence and $A_2$-webs

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Matthew Housley ◽  
Heather M. Russell ◽  
Julianna Tymoczko
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Quantum Group ◽  
Classical Limit ◽  
Young Tableaux ◽  
Tensor Power ◽  
Recent Interest ◽  
International Audience ◽  
Standard Young Tableaux ◽  
Graphical Algorithm

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.

scholarly journals Minimal Orbits of Promotion

10.37236/5885 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Kevin Purbhoo ◽  
Donguk Rhee
Keyword(s):  
Symmetric Group ◽  
Young Tableaux ◽  
Jeu De Taquin ◽  
Rectangular Shape ◽  
Standard Young Tableaux

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. 

scholarly journals Commutation Classes of the Reduced Words for the Longest Element of ${\mathfrak S}_n$

10.37236/9481 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Gonçalo Gutierres ◽  
Ricardo Mamede ◽  
José Luis Santos
Keyword(s):  
Symmetric Group ◽  
Planar Graph ◽  
Finite Sequence ◽  
Group Element ◽  
The Other ◽  
Single Element ◽  
Young Tableaux ◽  
Braid Relation ◽  
Standard Young Tableaux ◽  
Reduced Words

 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.

scholarly journals The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene

10.37236/1554 ◽  
2000 ◽  
Vol 8 (1) ◽  
Author(s):  
Stefan Felsner
Keyword(s):  
Bruhat Order ◽  
Young Tableaux ◽  
Reduced Word ◽  
Reduced Decompositions ◽  
Bijective Proof ◽  
Identity Permutation ◽  
Weak Bruhat Order ◽  
Classical Correspondence ◽  
Standard Young Tableaux ◽  
Maximal Chains

Stanley conjectured that the number of maximal chains in the weak Bruhat order of $S_n$, or equivalently the number of reduced decompositions of the reverse of the identity permutation $ w_0 = n,n-1,n-2,\ldots,2,1$, equals the number of standard Young tableaux of staircase shape $s=\{n-1,n-2,\ldots,1\}$. Originating from this conjecture remarkable connections between standard Young tableaux and reduced words have been discovered. Stanley proved his conjecture algebraically, later Edelman and Greene found a bijective proof. We provide an extension of the Edelman and Greene bijection to a larger class of words. This extension is similar to the extension of the Robinson-Schensted correspondence to two line arrays. Our proof is inspired by Viennot's planarized proof of the Robinson-Schensted correspondence. As it is the case with the classical correspondence the planarized proofs have their own beauty and simplicity.

Standard Young tableaux in a (2,1)-hook and Motzkin paths

2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu
Keyword(s):  
Young Tableaux ◽  
Standard Young Tableaux ◽  
Motzkin Paths

Partial orders on the power sets of Baer rings

2019 ◽  
Vol 19 (01) ◽  
pp. 2050011 ◽  
Author(s):  
B. Ungor ◽  
S. Halicioglu ◽  
A. Harmanci ◽  
J. Marovt
Keyword(s):  
Partial Order ◽  
Partial Orders ◽  
Linear Operators ◽  
Bounded Linear ◽  
Von Neumann ◽  
Baer Ring ◽  
Power Set ◽  
Von Neumann Regular ◽  
Baer Rings ◽  
The Right

Let [Formula: see text] be a ring. Motivated by a generalization of a well-known minus partial order to Rickart rings, we introduce a new relation on the power set [Formula: see text] of [Formula: see text] and show that this relation, which we call “the minus order on [Formula: see text]”, is a partial order when [Formula: see text] is a Baer ring. We similarly introduce and study properties of the star, the left-star, and the right-star partial orders on the power sets of Baer ∗-rings. We show that some ideals generated by projections of a von Neumann regular and Baer ∗-ring [Formula: see text] form a lattice with respect to the star partial order on [Formula: see text]. As a particular case, we present characterizations of these orders on the power set of [Formula: see text], the algebra of all bounded linear operators on a Hilbert space [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document