Layered permutation
In the mathematics of permutations, a layered permutation is a permutation that reverses contiguous blocks of elements. Equivalently, it is the direct sum of decreasing permutations.[1] One of the earlier works establishing the significance of layered permutations was (Bóna 1999), which established the Stanley–Wilf conjecture for classes of permutations forbidding a layered permutation, before the conjecture was proven more generally.[2]
Example
For instance, the layered permutations of length four, with the reversed blocks separated by spaces, are the eight permutations
- 1 2 3 4
- 1 2 43
- 1 32 4
- 1 432
- 21 3 4
- 21 43
- 321 4
- 4321
Characterization by forbidden patterns
The layered permutations can also be equivalently described as the permutations that do not contain the permutation patterns 231 or 312. That is, no three elements in the permutation (regardless of whether they are consecutive) have the same ordering as either of these forbidden triples.
Enumeration
A layered permutation on the numbers from [math]\displaystyle{ 1 }[/math] to [math]\displaystyle{ n }[/math] can be uniquely described by the subset of the numbers from [math]\displaystyle{ 1 }[/math] to [math]\displaystyle{ n-1 }[/math] that are the first element in a reversed block. (The number [math]\displaystyle{ n }[/math] is always the first element in its reversed block, so it is redundant for this description.) Because there are [math]\displaystyle{ 2^{n-1} }[/math] subsets of the numbers from [math]\displaystyle{ 1 }[/math] to [math]\displaystyle{ n-1 }[/math], there are also [math]\displaystyle{ 2^{n-1} }[/math] layered permutation of length [math]\displaystyle{ n }[/math].
The layered permutations are Wilf equivalent to other permutation classes, meaning that the numbers of permutations of each length are the same. For instance, the Gilbreath permutations are counted by the same function [math]\displaystyle{ 2^{n-1} }[/math].[3]
Superpatterns
The shortest superpattern of the layered permutations of length [math]\displaystyle{ n }[/math] is itself a layered permutation. Its length is a sorting number, the number of comparisons needed for binary insertion sort to sort [math]\displaystyle{ n+1 }[/math] elements.[1][4] For [math]\displaystyle{ n=1,2,3,\dots }[/math] these numbers are
and in general they are given by the formula
- [math]\displaystyle{ (n+1)\bigl\lceil\log_2 (n+1)\bigr\rceil - 2^{\left\lceil\log_2 (n+1)\right\rceil} + 1. }[/math][1]
Related permutation classes
Every layered permutation is an involution. They are exactly the 231-avoiding involutions, and they are also exactly the 312-avoiding involutions.[5]
The layered permutations are a subset of the stack-sortable permutations, which forbid the pattern 231 but not the pattern 312. Like the stack-sortable permutations, they are also a subset of the separable permutations, the permutations formed by recursive combinations of direct and skew sums.
References
- ↑ 1.0 1.1 1.2 "Universal layered permutations", Electronic Journal of Combinatorics 25 (3): P23:1–P23:5, 2018
- ↑ "The solution of a conjecture of Stanley and Wilf for all layered patterns", Journal of Combinatorial Theory, Series A 85 (1): 96–104, 1999, doi:10.1006/jcta.1998.2908
- ↑ Robertson, Aaron (2001), "Permutations restricted by two distinct patterns of length three", Advances in Applied Mathematics 27 (2-3): 548–561, doi:10.1006/aama.2001.0749
- ↑ Gray, Daniel (2015), "Bounds on superpatterns containing all layered permutations", Graphs and Combinatorics 31 (4): 941–952, doi:10.1007/s00373-014-1429-x
- ↑ Egge, Eric S.; Mansour, Toufik (2004), "231-avoiding involutions and Fibonacci numbers", The Australasian Journal of Combinatorics 30: 75–84
 |  |
