Jerry Zhang

collaborators

2 papers

math.CO2026

Asymptotics of the Average Stack-Sorting Depth

Jerry Zhang

Let $D_{n}$ denote the average number of passes of the stack-sorting map $s$ required to sort a permutation in $S_{n}$ . We use the recently introduced framework of stack-sort…

math.CO2026

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

Jerry Zhang

We study the behavior of West's stack-sorting map $s$ on permutations whose last entry is also their least. Let $S_{n}^{'} := {π 0 ∣ I ¨ \in S_{n}}$ where $π 0$ denotes the concatenat…