Computations up to n=14 and proven bounds show maximum and average sort-numbers under SC_231 grow faster than linearly for tested ranges, with n-1 lower and (n+1)(n-2)/2 upper bounds.
Stack Sorting with Restricted Stacks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort
Computations up to n=14 and proven bounds show maximum and average sort-numbers under SC_231 grow faster than linearly for tested ranges, with n-1 lower and (n+1)(n-2)/2 upper bounds.