Introduces stack-sorting tableaux to enable the first polynomial-time enumeration of t-stack-sortable permutations ending in their least entry.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial Time Enumeration of t-Stack-Sortable Permutations Ending in Their Least Entry
Introduces stack-sorting tableaux to enable the first polynomial-time enumeration of t-stack-sortable permutations ending in their least entry.