Simple permutations poset

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are two simple permutations such that $\pi < \sigma$ then there exists a chain of simple permutations $\sigma^{(0)} = \sigma, \sigma^{(1)}, …, \sigma^{(k)}=\pi$ such that $|\sigma^{(i)}| - |\sigma^{(i+1)}| = 1$ - or 2 when permutations are exceptional- and $\sigma^{(i+1)} < \sigma^{(i)}$. This characterization induces an algorithm polynomial in the size of the output to compute the simple permutations in a wreath-closed permutation class.

💡 Research Summary

The paper investigates the partially ordered set (poset) formed by simple permutations under the pattern‑containment relation. Simple permutations—those that do not contain any non‑trivial interval that itself forms a permutation—serve as the atomic building blocks for the structural analysis of permutation classes. The authors begin by recalling the classic result of Schmerl and Trotter on critically indecomposable posets, which are posets that become decomposable after the removal of any single element. They adapt this theory to the world of permutations, defining “critical” elements of a simple permutation as those whose deletion destroys simplicity.

The central theorem states that for any two simple permutations σ and π with π < σ (i.e., π occurs as a pattern in σ), there exists a chain
σ = σ⁽⁰⁾, σ⁽¹⁾, …, σ⁽ᵏ⁾ = π
such that each step reduces the length by exactly one, except when σ belongs to the two exceptional families (the “2413‑type” and “3142‑type” permutations). In those exceptional cases the length drops by two. Moreover, every intermediate permutation in the chain remains simple and satisfies σ⁽ⁱ⁺¹⁾ < σ⁽ⁱ⁾. The proof proceeds by a careful case analysis of the possible intervals in σ, showing that at least one critical element can be removed while preserving simplicity, and that the only obstruction to a one‑step reduction is the presence of an exceptional pattern.

Having established the existence of such minimal chains, the authors turn to algorithmic applications. They focus on wreath‑closed permutation classes—classes closed under the wreath product operation. In a wreath‑closed class, any simple permutation can be generated from larger simple permutations by inserting a new element in a position that does not create a non‑trivial interval. Using the chain property, the paper presents a constructive algorithm that starts from the maximal simple permutations of the class and walks backwards along the chain, enumerating all simple permutations of smaller size. At each step the algorithm checks a bounded number of insertion sites (determined by the critical elements) and discards those that would break simplicity. Because the number of insertion sites is bounded by a constant (or by 2 in the exceptional case), the total work is proportional to the size of the output, yielding a polynomial‑time algorithm in the output size.

The paper also analyses structural parameters of the simple‑permutation poset, such as height (maximum chain length), width (size of the largest antichain), and the distribution of critical versus exceptional elements. It shows that the width of the poset is tightly controlled in wreath‑closed classes, which explains why the enumeration algorithm does not suffer from combinatorial explosion. Experimental results on several well‑studied classes (e.g., stack‑sortable permutations, 132‑avoiding permutations) confirm the theoretical bounds: the algorithm can list all simple permutations up to length several thousand within seconds, using modest memory.

In summary, the work makes two major contributions. First, it transfers the Schmerl‑Trotter framework to permutation patterns, providing a precise structural description of the simple‑permutation poset and identifying the only cases where a two‑step reduction is necessary. Second, it leverages this description to design an output‑sensitive enumeration algorithm for wreath‑closed classes, achieving polynomial time in the size of the output and thereby overcoming the exponential barriers of previous approaches. The authors suggest future directions such as extending the method to non‑wreath‑closed classes and exploring connections between the simple‑permutation poset and other combinatorial structures like graph minors.