Polynomial Time Enumeration of t-Stack-Sortable Permutations Ending in Their Least Entry

TL;DR

This paper introduces a polynomial time algorithm for counting t-stack-sortable permutations ending in their least entry, using a new combinatorial object called the stack-sorting tableau.

Contribution

It presents the first polynomial time method to enumerate t-stack-sortable permutations ending in their least element, via the novel stack-sorting tableau.

Findings

Defined the stack-sorting tableau as a key combinatorial tool.

Established a relationship between the behavior of the stack-sorting map on different permutation sets.

Developed a polynomial time algorithm for counting t-stack-sortable permutations ending in their least entry.

Abstract

We study the behavior of West's stack-sorting map $s$ on permutations whose last entry is also their least. Let $S_{n}':=\{\pi0\mid \pi\in S_n\}$ where $\pi0$ denotes the concatenation of $\pi$ and $0$. For each permutation $\pi\in S_n'$, we introduce a new combinatorial object known as the stack-sorting tableau $T_{\pi}$, which ultimately serves as the key ingredient in the first polynomial time algorithm for counting the number of $t$-stack-sortable permutations in $S_n'$. We then establish a precise relationship between the behavior of $s$ on $S_{n}'$ and on $S_{n}$.