Corpus ID: 237562784

Crystal Pop-Stack Sorting and Type A Crystal Lattices

@inproceedings{Defant2021CrystalPS,
  title={Crystal Pop-Stack Sorting and Type A Crystal Lattices},
  author={Colin Defant and Nathan Williams},
  year={2021}
}
  • Colin Defant, Nathan Williams
  • Published 16 September 2021
  • Mathematics
Given a complex simple Lie algebra g and a dominant weight λ, let Bλ be the crystal poset associated to the irreducible representation of g with highest weight λ. In the first part of the article, we introduce the crystal pop-stack sorting operator Pop♦ : Bλ → Bλ, 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 Pop♦ contains the minimal element of Bλ, which is fixed by Pop… Expand

Figures from this paper

References

SHOWING 1-10 OF 23 REFERENCES
$k$-Pop Stack Sortable Permutations and $2$-Avoidance
TLDR
It is shown that for any permutations sortable by $k$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Expand
How Many Pop-Stacks Does It Take To Sort A Permutation?
TLDR
A new proof of this result inspired by Knuth’s zero-one principle is given that every permutation of length $n$ can be sorted by $n-1$ passes through a deterministic pop-stack. Expand
Meeting covered elements in ν-Tamari lattices, arXiv preprint arXiv:2104.03890 (2021)
  • 2021
Flip-sort and combinatorial aspects of pop-stack sorting
TLDR
The shape of the permutations after one iteration is given, and several families of permutations related to the best and worst cases of flip-sort are characterized. Expand
Combinatorics of regular A 2 - crystals
  • Adv . Appl . Math .
  • 2019
Counting Pop-Stacked Permutations in Polynomial Time
Permutations in the image of the pop-stack operator are said to be pop-stacked. We give a polynomial-time algorithm to count pop-stacked permutations up to a fixed length and we use it to compute theExpand
Enumerating permutations sortable by k passes through a pop-stack
TLDR
In an exercise in the first volume of his famous series of books, Knuth considered sorting permutations by passing them through a stack, it is shown that the generating function P_k(x) is rational for any $k$ and an algorithm to derive it is given. Expand
Pop-stack sorting and its image: Permutations with overlapping runs
TLDR
This paper focuses on pop-stack sorting, an important variation for sorting permutations via a stack that reverses all the maximal descements of a stack. Expand
Two-stack-sorting with pop stacks
We consider the set of permutations that are sortable after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns and enumerate them according to theExpand
...
1
2
3
...