Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00309: Permutations —inverse toric promotion⟶ Permutations
St000663: 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] => [1,3,2] => 1
{{1,2},{3}} => [2,1,3] => [3,1,2] => 0
{{1,3},{2}} => [3,2,1] => [1,2,3] => 0
{{1},{2,3}} => [1,3,2] => [2,3,1] => 0
{{1},{2},{3}} => [1,2,3] => [3,2,1] => 0
{{1,2,3,4}} => [2,3,4,1] => [1,3,4,2] => 0
{{1,2,3},{4}} => [2,3,1,4] => [3,4,1,2] => 0
{{1,2,4},{3}} => [2,4,3,1] => [3,1,2,4] => 0
{{1,2},{3,4}} => [2,1,4,3] => [3,2,4,1] => 1
{{1,2},{3},{4}} => [2,1,3,4] => [3,4,2,1] => 0
{{1,3,4},{2}} => [3,2,4,1] => [4,1,3,2] => 1
{{1,3},{2,4}} => [3,4,1,2] => [1,4,2,3] => 1
{{1,3},{2},{4}} => [3,2,1,4] => [4,3,1,2] => 0
{{1,4},{2,3}} => [4,3,2,1] => [2,4,1,3] => 2
{{1},{2,3,4}} => [1,3,4,2] => [4,2,1,3] => 1
{{1},{2,3},{4}} => [1,3,2,4] => [4,3,2,1] => 0
{{1,4},{2},{3}} => [4,2,3,1] => [1,2,3,4] => 0
{{1},{2,4},{3}} => [1,4,3,2] => [2,4,3,1] => 1
{{1},{2},{3,4}} => [1,2,4,3] => [3,2,1,4] => 1
{{1},{2},{3},{4}} => [1,2,3,4] => [3,1,4,2] => 1
{{1,2,3,4,5}} => [2,3,4,5,1] => [1,3,4,5,2] => 0
{{1,2,3,4},{5}} => [2,3,4,1,5] => [3,4,5,1,2] => 0
{{1,2,3,5},{4}} => [2,3,5,4,1] => [3,4,1,2,5] => 0
{{1,2,3},{4,5}} => [2,3,1,5,4] => [3,4,2,5,1] => 1
{{1,2,3},{4},{5}} => [2,3,1,4,5] => [3,4,5,2,1] => 0
{{1,2,4,5},{3}} => [2,4,3,5,1] => [3,5,1,4,2] => 2
{{1,2,4},{3,5}} => [2,4,5,1,3] => [1,3,5,2,4] => 3
{{1,2,4},{3},{5}} => [2,4,3,1,5] => [3,5,4,1,2] => 1
{{1,2,5},{3,4}} => [2,5,4,3,1] => [3,2,5,1,4] => 2
{{1,2},{3,4,5}} => [2,1,4,5,3] => [3,5,2,1,4] => 2
{{1,2},{3,4},{5}} => [2,1,4,3,5] => [3,5,4,2,1] => 1
{{1,2,5},{3},{4}} => [2,5,3,4,1] => [3,1,2,4,5] => 0
{{1,2},{3,5},{4}} => [2,1,5,4,3] => [3,2,5,4,1] => 1
{{1,2},{3},{4,5}} => [2,1,3,5,4] => [3,4,2,1,5] => 1
{{1,2},{3},{4},{5}} => [2,1,3,4,5] => [3,4,1,5,2] => 1
{{1,3,4,5},{2}} => [3,2,4,5,1] => [4,1,3,5,2] => 2
{{1,3,4},{2,5}} => [3,5,4,1,2] => [4,1,2,5,3] => 0
{{1,3,4},{2},{5}} => [3,2,4,1,5] => [4,3,5,1,2] => 1
{{1,3,5},{2,4}} => [3,4,5,2,1] => [4,5,1,2,3] => 0
{{1,3},{2,4,5}} => [3,4,1,5,2] => [4,5,2,3,1] => 0
{{1,3},{2,4},{5}} => [3,4,1,2,5] => [1,4,5,3,2] => 0
{{1,3,5},{2},{4}} => [3,2,5,4,1] => [4,3,1,2,5] => 0
{{1,3},{2,5},{4}} => [3,5,1,4,2] => [1,4,2,5,3] => 2
{{1,3},{2},{4,5}} => [3,2,1,5,4] => [4,3,2,5,1] => 1
{{1,3},{2},{4},{5}} => [3,2,1,4,5] => [4,3,5,2,1] => 1
{{1,4,5},{2,3}} => [4,3,2,5,1] => [5,4,1,3,2] => 1
{{1,4},{2,3,5}} => [4,3,5,1,2] => [5,1,4,2,3] => 1
{{1,4},{2,3},{5}} => [4,3,2,1,5] => [5,4,3,1,2] => 0
{{1,5},{2,3,4}} => [5,3,4,2,1] => [2,4,5,1,3] => 1
{{1},{2,3,4,5}} => [1,3,4,5,2] => [4,1,5,2,3] => 1
{{1},{2,3,4},{5}} => [1,3,4,2,5] => [4,1,5,3,2] => 1
{{1,5},{2,3},{4}} => [5,3,2,4,1] => [2,4,1,3,5] => 3
{{1},{2,3,5},{4}} => [1,3,5,4,2] => [4,2,1,5,3] => 1
{{1},{2,3},{4,5}} => [1,3,2,5,4] => [4,3,2,1,5] => 1
{{1},{2,3},{4},{5}} => [1,3,2,4,5] => [4,3,1,5,2] => 1
{{1,4,5},{2},{3}} => [4,2,3,5,1] => [5,1,3,4,2] => 0
{{1,4},{2,5},{3}} => [4,5,3,1,2] => [5,1,2,4,3] => 0
{{1,4},{2},{3,5}} => [4,2,5,1,3] => [5,1,3,2,4] => 2
{{1,4},{2},{3},{5}} => [4,2,3,1,5] => [5,3,4,1,2] => 0
{{1,5},{2,4},{3}} => [5,4,3,2,1] => [2,5,4,1,3] => 2
{{1},{2,4,5},{3}} => [1,4,3,5,2] => [5,4,2,1,3] => 1
{{1},{2,4},{3,5}} => [1,4,5,2,3] => [5,2,1,3,4] => 0
{{1},{2,4},{3},{5}} => [1,4,3,2,5] => [5,4,3,2,1] => 0
{{1,5},{2},{3,4}} => [5,2,4,3,1] => [2,3,5,1,4] => 1
{{1},{2,5},{3,4}} => [1,5,4,3,2] => [2,5,4,3,1] => 1
{{1},{2},{3,4,5}} => [1,2,4,5,3] => [3,1,5,2,4] => 2
{{1},{2},{3,4},{5}} => [1,2,4,3,5] => [3,1,5,4,2] => 1
{{1,5},{2},{3},{4}} => [5,2,3,4,1] => [1,2,3,4,5] => 0
{{1},{2,5},{3},{4}} => [1,5,3,4,2] => [2,4,1,5,3] => 2
{{1},{2},{3,5},{4}} => [1,2,5,4,3] => [3,2,1,5,4] => 1
{{1},{2},{3},{4,5}} => [1,2,3,5,4] => [3,1,4,2,5] => 2
{{1},{2},{3},{4},{5}} => [1,2,3,4,5] => [3,1,4,5,2] => 0
{{1,2,3,4,5,6}} => [2,3,4,5,6,1] => [1,3,4,5,6,2] => 0
{{1,2,3,4,5},{6}} => [2,3,4,5,1,6] => [3,4,5,6,1,2] => 0
{{1,2,3,4,6},{5}} => [2,3,4,6,5,1] => [3,4,5,1,2,6] => 0
{{1,2,3,4},{5,6}} => [2,3,4,1,6,5] => [3,4,5,2,6,1] => 1
{{1,2,3,4},{5},{6}} => [2,3,4,1,5,6] => [3,4,5,6,2,1] => 0
{{1,2,3,5,6},{4}} => [2,3,5,4,6,1] => [3,4,6,1,5,2] => 1
{{1,2,3,5},{4,6}} => [2,3,5,6,1,4] => [1,3,4,6,2,5] => 1
{{1,2,3,5},{4},{6}} => [2,3,5,4,1,6] => [3,4,6,5,1,2] => 0
{{1,2,3,6},{4,5}} => [2,3,6,5,4,1] => [3,4,2,6,1,5] => 2
{{1,2,3},{4,5,6}} => [2,3,1,5,6,4] => [3,4,6,2,1,5] => 1
{{1,2,3},{4,5},{6}} => [2,3,1,5,4,6] => [3,4,6,5,2,1] => 0
{{1,2,3,6},{4},{5}} => [2,3,6,4,5,1] => [3,4,1,2,5,6] => 0
{{1,2,3},{4,6},{5}} => [2,3,1,6,5,4] => [3,4,2,6,5,1] => 1
{{1,2,3},{4},{5,6}} => [2,3,1,4,6,5] => [3,4,5,2,1,6] => 1
{{1,2,3},{4},{5},{6}} => [2,3,1,4,5,6] => [3,4,5,1,6,2] => 1
{{1,2,4,5,6},{3}} => [2,4,3,5,6,1] => [3,5,1,4,6,2] => 3
{{1,2,4,5},{3,6}} => [2,4,6,5,1,3] => [3,5,1,2,6,4] => 1
{{1,2,4,5},{3},{6}} => [2,4,3,5,1,6] => [3,5,4,6,1,2] => 2
{{1,2,4,6},{3,5}} => [2,4,5,6,3,1] => [3,5,6,1,2,4] => 0
{{1,2,4},{3,5,6}} => [2,4,5,1,6,3] => [3,5,6,2,4,1] => 1
{{1,2,4},{3,5},{6}} => [2,4,5,1,3,6] => [1,3,5,6,4,2] => 1
{{1,2,4,6},{3},{5}} => [2,4,3,6,5,1] => [3,5,4,1,2,6] => 1
{{1,2,4},{3,6},{5}} => [2,4,6,1,5,3] => [1,3,5,2,6,4] => 3
{{1,2,4},{3},{5,6}} => [2,4,3,1,6,5] => [3,5,4,2,6,1] => 2
{{1,2,4},{3},{5},{6}} => [2,4,3,1,5,6] => [3,5,4,6,2,1] => 2
{{1,2,5,6},{3,4}} => [2,5,4,3,6,1] => [3,6,5,1,4,2] => 2
>>> Load all 306 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 number of right floats of a permutation.
Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, St000441The number of successions of a permutation., and a right float is a large ascent not consecutive to any raft of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, St000441The number of successions of a permutation., and a right float is a large ascent not consecutive to any raft of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
Map
inverse toric promotion
Description
Toric promotion of a permutation.
Let $\sigma\in\mathfrak S_n$ be a permutation and let
$ \tau_{i, j}(\sigma) = \begin{cases} \sigma & \text{if $|\sigma^{-1}(i) - \sigma^{-1}(j)| = 1$}\\ (i, j)\circ\sigma & \text{otherwise}. \end{cases} $
The toric promotion operator is the product $\tau_{n,1}\tau_{n-1,n}\dots\tau_{1,2}$.
This is the special case of toric promotion on graphs for the path graph. Its order is $n-1$.
Let $\sigma\in\mathfrak S_n$ be a permutation and let
$ \tau_{i, j}(\sigma) = \begin{cases} \sigma & \text{if $|\sigma^{-1}(i) - \sigma^{-1}(j)| = 1$}\\ (i, j)\circ\sigma & \text{otherwise}. \end{cases} $
The toric promotion operator is the product $\tau_{n,1}\tau_{n-1,n}\dots\tau_{1,2}$.
This is the special case of toric promotion on graphs for the path graph. Its order is $n-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!