Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00257: Permutations —Alexandersson Kebede⟶ Permutations
St000123: Permutations ⟶ ℤ
Values
{{1}} => [1] => [1] => 0
{{1,2}} => [2,1] => [2,1] => 0
{{1},{2}} => [1,2] => [1,2] => 0
{{1,2,3}} => [2,3,1] => [3,2,1] => 1
{{1,2},{3}} => [2,1,3] => [2,1,3] => 0
{{1,3},{2}} => [3,2,1] => [2,3,1] => 0
{{1},{2,3}} => [1,3,2] => [3,1,2] => 0
{{1},{2},{3}} => [1,2,3] => [1,2,3] => 0
{{1,2,3,4}} => [2,3,4,1] => [3,2,4,1] => 1
{{1,2,3},{4}} => [2,3,1,4] => [3,2,1,4] => 1
{{1,2,4},{3}} => [2,4,3,1] => [4,2,3,1] => 2
{{1,2},{3,4}} => [2,1,4,3] => [2,1,4,3] => 0
{{1,2},{3},{4}} => [2,1,3,4] => [2,1,3,4] => 0
{{1,3,4},{2}} => [3,2,4,1] => [2,3,4,1] => 0
{{1,3},{2,4}} => [3,4,1,2] => [4,3,1,2] => 2
{{1,3},{2},{4}} => [3,2,1,4] => [2,3,1,4] => 0
{{1,4},{2,3}} => [4,3,2,1] => [3,4,2,1] => 1
{{1},{2,3,4}} => [1,3,4,2] => [3,1,4,2] => 0
{{1},{2,3},{4}} => [1,3,2,4] => [3,1,2,4] => 0
{{1,4},{2},{3}} => [4,2,3,1] => [2,4,3,1] => 1
{{1},{2,4},{3}} => [1,4,3,2] => [4,1,3,2] => 1
{{1},{2},{3,4}} => [1,2,4,3] => [1,2,4,3] => 0
{{1},{2},{3},{4}} => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,3,4,5}} => [2,3,4,5,1] => [3,2,4,5,1] => 1
{{1,2,3,4},{5}} => [2,3,4,1,5] => [3,2,4,1,5] => 1
{{1,2,3,5},{4}} => [2,3,5,4,1] => [3,2,5,4,1] => 2
{{1,2,3},{4,5}} => [2,3,1,5,4] => [3,2,1,5,4] => 1
{{1,2,3},{4},{5}} => [2,3,1,4,5] => [3,2,1,4,5] => 1
{{1,2,4,5},{3}} => [2,4,3,5,1] => [4,2,3,5,1] => 2
{{1,2,4},{3,5}} => [2,4,5,1,3] => [4,2,5,1,3] => 1
{{1,2,4},{3},{5}} => [2,4,3,1,5] => [4,2,3,1,5] => 2
{{1,2,5},{3,4}} => [2,5,4,3,1] => [5,2,4,3,1] => 4
{{1,2},{3,4,5}} => [2,1,4,5,3] => [2,1,5,4,3] => 1
{{1,2},{3,4},{5}} => [2,1,4,3,5] => [2,1,4,3,5] => 0
{{1,2,5},{3},{4}} => [2,5,3,4,1] => [5,2,3,4,1] => 3
{{1,2},{3,5},{4}} => [2,1,5,4,3] => [2,1,4,5,3] => 0
{{1,2},{3},{4,5}} => [2,1,3,5,4] => [2,1,5,3,4] => 0
{{1,2},{3},{4},{5}} => [2,1,3,4,5] => [2,1,3,4,5] => 0
{{1,3,4,5},{2}} => [3,2,4,5,1] => [2,3,4,5,1] => 0
{{1,3,4},{2,5}} => [3,5,4,1,2] => [5,3,4,1,2] => 4
{{1,3,4},{2},{5}} => [3,2,4,1,5] => [2,3,4,1,5] => 0
{{1,3,5},{2,4}} => [3,4,5,2,1] => [4,3,5,2,1] => 3
{{1,3},{2,4,5}} => [3,4,1,5,2] => [4,3,1,5,2] => 2
{{1,3},{2,4},{5}} => [3,4,1,2,5] => [4,3,1,2,5] => 2
{{1,3,5},{2},{4}} => [3,2,5,4,1] => [2,3,5,4,1] => 1
{{1,3},{2,5},{4}} => [3,5,1,4,2] => [5,3,1,4,2] => 3
{{1,3},{2},{4,5}} => [3,2,1,5,4] => [2,3,1,5,4] => 0
{{1,3},{2},{4},{5}} => [3,2,1,4,5] => [2,3,1,4,5] => 0
{{1,4,5},{2,3}} => [4,3,2,5,1] => [3,4,2,5,1] => 1
{{1,4},{2,3,5}} => [4,3,5,1,2] => [3,4,5,1,2] => 0
{{1,4},{2,3},{5}} => [4,3,2,1,5] => [3,4,2,1,5] => 1
{{1,5},{2,3,4}} => [5,3,4,2,1] => [3,5,4,2,1] => 3
{{1},{2,3,4,5}} => [1,3,4,5,2] => [3,1,4,5,2] => 0
{{1},{2,3,4},{5}} => [1,3,4,2,5] => [3,1,4,2,5] => 0
{{1,5},{2,3},{4}} => [5,3,2,4,1] => [3,5,2,4,1] => 2
{{1},{2,3,5},{4}} => [1,3,5,4,2] => [3,1,5,4,2] => 1
{{1},{2,3},{4,5}} => [1,3,2,5,4] => [3,1,2,5,4] => 0
{{1},{2,3},{4},{5}} => [1,3,2,4,5] => [3,1,2,4,5] => 0
{{1,4,5},{2},{3}} => [4,2,3,5,1] => [2,4,3,5,1] => 1
{{1,4},{2,5},{3}} => [4,5,3,1,2] => [5,4,3,1,2] => 5
{{1,4},{2},{3,5}} => [4,2,5,1,3] => [2,4,5,1,3] => 0
{{1,4},{2},{3},{5}} => [4,2,3,1,5] => [2,4,3,1,5] => 1
{{1,5},{2,4},{3}} => [5,4,3,2,1] => [4,5,3,2,1] => 3
{{1},{2,4,5},{3}} => [1,4,3,5,2] => [4,1,3,5,2] => 1
{{1},{2,4},{3,5}} => [1,4,5,2,3] => [4,1,5,2,3] => 0
{{1},{2,4},{3},{5}} => [1,4,3,2,5] => [4,1,3,2,5] => 1
{{1,5},{2},{3,4}} => [5,2,4,3,1] => [2,5,4,3,1] => 3
{{1},{2,5},{3,4}} => [1,5,4,3,2] => [5,1,4,3,2] => 3
{{1},{2},{3,4,5}} => [1,2,4,5,3] => [1,2,5,4,3] => 1
{{1},{2},{3,4},{5}} => [1,2,4,3,5] => [1,2,4,3,5] => 0
{{1,5},{2},{3},{4}} => [5,2,3,4,1] => [2,5,3,4,1] => 2
{{1},{2,5},{3},{4}} => [1,5,3,4,2] => [5,1,3,4,2] => 2
{{1},{2},{3,5},{4}} => [1,2,5,4,3] => [1,2,4,5,3] => 0
{{1},{2},{3},{4,5}} => [1,2,3,5,4] => [1,2,5,3,4] => 0
{{1},{2},{3},{4},{5}} => [1,2,3,4,5] => [1,2,3,4,5] => 0
{{1,2,3,4,5,6}} => [2,3,4,5,6,1] => [3,2,4,5,6,1] => 1
{{1,2,3,4,5},{6}} => [2,3,4,5,1,6] => [3,2,4,5,1,6] => 1
{{1,2,3,4,6},{5}} => [2,3,4,6,5,1] => [3,2,4,6,5,1] => 2
{{1,2,3,4},{5,6}} => [2,3,4,1,6,5] => [3,2,4,1,6,5] => 1
{{1,2,3,4},{5},{6}} => [2,3,4,1,5,6] => [3,2,4,1,5,6] => 1
{{1,2,3,5,6},{4}} => [2,3,5,4,6,1] => [3,2,5,4,6,1] => 2
{{1,2,3,5},{4,6}} => [2,3,5,6,1,4] => [3,2,5,6,1,4] => 1
{{1,2,3,5},{4},{6}} => [2,3,5,4,1,6] => [3,2,5,4,1,6] => 2
{{1,2,3,6},{4,5}} => [2,3,6,5,4,1] => [3,2,6,5,4,1] => 4
{{1,2,3},{4,5,6}} => [2,3,1,5,6,4] => [3,2,1,5,6,4] => 1
{{1,2,3},{4,5},{6}} => [2,3,1,5,4,6] => [3,2,1,5,4,6] => 1
{{1,2,3,6},{4},{5}} => [2,3,6,4,5,1] => [3,2,6,4,5,1] => 3
{{1,2,3},{4,6},{5}} => [2,3,1,6,5,4] => [3,2,1,6,5,4] => 2
{{1,2,3},{4},{5,6}} => [2,3,1,4,6,5] => [3,2,1,4,6,5] => 1
{{1,2,3},{4},{5},{6}} => [2,3,1,4,5,6] => [3,2,1,4,5,6] => 1
{{1,2,4,5,6},{3}} => [2,4,3,5,6,1] => [4,2,3,5,6,1] => 2
{{1,2,4,5},{3,6}} => [2,4,6,5,1,3] => [4,2,6,5,1,3] => 3
{{1,2,4,5},{3},{6}} => [2,4,3,5,1,6] => [4,2,3,5,1,6] => 2
{{1,2,4,6},{3,5}} => [2,4,5,6,3,1] => [4,2,5,6,3,1] => 2
{{1,2,4},{3,5,6}} => [2,4,5,1,6,3] => [4,2,5,1,6,3] => 1
{{1,2,4},{3,5},{6}} => [2,4,5,1,3,6] => [4,2,5,1,3,6] => 1
{{1,2,4,6},{3},{5}} => [2,4,3,6,5,1] => [4,2,3,6,5,1] => 3
{{1,2,4},{3,6},{5}} => [2,4,6,1,5,3] => [4,2,6,1,5,3] => 2
{{1,2,4},{3},{5,6}} => [2,4,3,1,6,5] => [4,2,3,1,6,5] => 2
{{1,2,4},{3},{5},{6}} => [2,4,3,1,5,6] => [4,2,3,1,5,6] => 2
{{1,2,5,6},{3,4}} => [2,5,4,3,6,1] => [5,2,4,3,6,1] => 4
>>> Load all 325 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map.
- The Simion-Schmidt map takes a permutation and turns each occurrence of [3,2,1] into an occurrence of [3,1,2], thus reducing the number of inversions of the permutation. This statistic records the difference in length of the permutation and its image.
- It is the number of pairs of positions for the pattern letters 2 and 1 in occurrences of 321 in a permutation. Thus, for a permutation $\pi$ this is the number of pairs $(j,k)$ such that there exists an index $i$ satisfying $i < j < k$ and $\pi(i) > \pi(j) > \pi(k)$. See also St000119The number of occurrences of the pattern 321 in a permutation. and St000371The number of mid points of decreasing subsequences of length 3 in a permutation..
- Apparently, this statistic can be described as the number of occurrences of the mesh pattern ([3,2,1], {(0,3),(0,2)}). Equivalent mesh patterns are ([3,2,1], {(0,2),(1,2)}), ([3,2,1], {(0,3),(1,3)}) and ([3,2,1], {(1,2),(1,3)}).
Map
Alexandersson Kebede
Description
Sends a permutation to a permutation and it preserves the set of right-to-left minima.
Take a permutation $\pi$ of length $n$. The mapping looks for a smallest odd integer $i\in[n-1]$ such that swapping the entries $\pi(i)$ and $\pi(i+1)$ preserves the set of right-to-left minima. Otherwise, $\pi$ will be a fixed element of the mapping. Note that the map changes the sign of all non-fixed elements.
There are exactly $\binom{\lfloor n/2 \rfloor}{k-\lceil n/2 \rceil}$ elements in $S_n$ fixed under this map, with exactly $k$ right-to-left minima, see Lemma 35 in [1].
Take a permutation $\pi$ of length $n$. The mapping looks for a smallest odd integer $i\in[n-1]$ such that swapping the entries $\pi(i)$ and $\pi(i+1)$ preserves the set of right-to-left minima. Otherwise, $\pi$ will be a fixed element of the mapping. Note that the map changes the sign of all non-fixed elements.
There are exactly $\binom{\lfloor n/2 \rfloor}{k-\lceil n/2 \rceil}$ elements in $S_n$ fixed under this map, with exactly $k$ right-to-left minima, see Lemma 35 in [1].
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!