Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Crystal Pop-Stack Sorting and Type A Crystal Lattices (2109.08251v1)

Published 16 Sep 2021 in math.CO and math.RT

Abstract: Given a complex simple Lie algebra $\mathfrak g$ and a dominant weight $\lambda$, let $\mathcal B_\lambda$ be the crystal poset associated to the irreducible representation of $\mathfrak g$ with highest weight $\lambda$. In the first part of the article, we introduce the \emph{crystal pop-stack sorting operator} $\mathsf{Pop}{\lozenge}\colon\mathcal B\lambda\to\mathcal B_\lambda$, a noninvertible operator whose definition extends that of the pop-stack sorting map and the recently-introduced Coxeter pop-stack sorting operators. Every forward orbit of $\mathsf{Pop}{\lozenge}$ contains the minimal element of $\mathcal B\lambda$, which is fixed by $\mathsf{Pop}{\lozenge}$. We prove that the maximum size of a forward orbit of $\mathsf{Pop}{\lozenge}$ is the Coxeter number of the Weyl group of $\mathfrak g$. In the second part of the article, we characterize exactly when a type $A$ crystal is a lattice.

Summary

We haven't generated a summary for this paper yet.