Dynamical aspects of $\sigma$-machines

TL;DR

This paper investigates the properties and enumeration of permutations sortable by $\sigma$-machines, which involve two constrained stacks, providing new characterizations, counting methods, and classifications of these sorting devices.

Contribution

It introduces a geometric decomposition for $\xi$-avoiding permutations, characterizes effective permutations, and classifies $\sigma$-machines, advancing understanding of constrained permutation sorting.

Findings

Most sortable permutations avoid a bivincular pattern $\xi$

Provided a direct counting method for $\xi$-avoiding permutations

Classified $\sigma$-machines and identified the most challenging cases

Abstract

The $\sigma$-machine was recently introduced by Cerbai, Claesson and Ferrari as a tool to gain a better insight on the problem of sorting permutations with two stacks in series. It consists of two consecutive stacks, which are restricted in the sense that their content must at all times avoid a certain pattern: a given $\sigma$, in the first stack, and $21$, in the second. Here we prove that in most cases sortable permutations avoid a bivincular pattern $\xi$. We provide a geometric decomposition of $\xi$-avoiding permutations and use it to count them directly. Then we characterize the permutations with the property that the output of the $\sigma$-avoiding stack does not contain $\sigma$, which we call effective. For $\sigma=123$, we obtain an alternative method to enumerate sortable permutations. Finally, we classify $\sigma$-machines and determine the most challenging to be studied.