SearcharxivSearch

arXiv subjects

David B Rush

Publications and source records attributed to David B Rush.

5 recordsLinked to original sources

Restriction of Global Bases and Rhoades's Theorem

It is shown that if $λ$ is a multiple of a fundamental weight of $\mathfrak{sl}_k$, the lower global basis of the irreducible $U_q(\mathfrak{sl}_k)$-representation $V^λ$ with highest weight $λ$ comprises the disjoint union of the lower global bases of the irreducible $U_q(\mathfrak{sl}_{k-1})$-representations appearing in the decomposition of the restriction of $V^λ$ to $U_q(\mathfrak{sl}_{k-1})$. Rhoades's description of the action of the long cycle on the dual canonical basis of $V^λ$ is then deduced from Berenstein--Zelevinsky's description of the action of the long element. This yields a short proof of Rhoades's result on tableaux fixed under promotion which directly relates it to Stembridge's result on tableaux fixed under evacuation.

math.RT

Computing the Lusztig--Vogan Bijection

Let $G$ be a connected complex reductive algebraic group with Lie algebra $\mathfrak{g}$. The Lusztig--Vogan bijection relates two bases for the bounded derived category of $G$-equivariant coherent sheaves on the nilpotent cone $\mathcal{N}$ of $\mathfrak{g}$. One basis is indexed by $Λ^+$, the set of dominant weights of $G$, and the other by $Ω$, the set of pairs $(\mathcal{O}, \mathcal{E})$ consisting of a nilpotent orbit $\mathcal{O} \subset \mathcal{N}$ and an irreducible $G$-equivariant vector bundle $\mathcal{E} \rightarrow \mathcal{O}$. The existence of the Lusztig--Vogan bijection $γ\colon Ω\rightarrow Λ^+$ was proven by Bezrukavnikov, and an algorithm computing $γ$ in type $A$ was given by Achar. Herein we present a combinatorial description of $γ$ in type $A$ that subsumes and dramatically simplifies Achar's algorithm.

math.RT

Cyclic Sieving and Plethysm Coefficients

A combinatorial expression for the coefficient of the Schur function $s_λ$ in the expansion of the plethysm $p_{n/d}^d \circ s_μ$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $λ$ is rectangular. In these cases, the coefficient $\langle p_{n/d}^d \circ s_μ, s_λ \rangle$ is shown to count, up to sign, the number of fixed points of an $\langle s_μ^n, s_λ \rangle$-element set under the $d^{\text{th}}$ power of an order-$n$ cyclic action. If $n=2$, the action is the Schützenberger involution on semistandard Young tableaux (also known as evacuation), and, if $λ$ is rectangular, the action is a certain power of Schützenberger and Shimozono's jeu-de-taquin promotion. This work extends results of Stembridge and Rhoades linking fixed points of the Schützenberger actions to ribbon tableaux enumeration. The conclusion for the case $n=2$ is equivalent to the domino tableaux rule of Carré and Leclerc for discriminating between the symmetric and antisymmetric parts of the square of a Schur function.

math.CO

On Order Ideals of Minuscule Posets III: The CDE Property

Recent work of Hopkins establishes that the lattice of order ideals of a minuscule poset satisfies the coincidental down-degree expectations property of Reiner, Tenner, and Yong. His approach appeals to the classification of minuscule posets. A uniform proof is presented herein. The blueprint follows that of Rush and Wang in their uniform proof that various cardinality statistics are homomesic on orbits of order ideals of minuscule posets under the Fon-Der-Flaass action. The underpinning remains the original insight of Rush and Shi into the structure of the isomorphism between the weight lattice of a minuscule representation of a complex simple Lie algebra and the lattice of order ideals of the corresponding minuscule poset.

math.CO

On Orbits of Order Ideals of Minuscule Posets

An action on order ideals of posets considered by Fon-Der-Flaass is analyzed in the case of posets arising from minuscule representations of complex simple Lie algebras. For these minuscule posets, it is shown that the Fon-Der-Flaass action exhibits the cyclic sieving phenomenon, as defined by Reiner, Stanton, and White. A uniform proof is given by investigation of a bijection due to Stembridge between order ideals of minuscule posets and fully commutative Weyl group elements. This bijection is proven to be equivariant with respect to a conjugate of the Fon-Der-Flaass action and an arbitrary Coxeter element. If $P$ is a minuscule poset, it is shown that the Fon-Der-Flaass action on order ideals of the Cartesian product $P \times [2]$ also exhibits the cyclic sieving phenomenon, only the proof is by appeal to the classification of minuscule posets and is not uniform.

math.CO