Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000255: Permutations ⟶ ℤ
Values
{{1}} => [1] => [1] => 1
{{1,2}} => [2,1] => [1,2] => 1
{{1},{2}} => [1,2] => [2,1] => 1
{{1,2,3}} => [2,3,1] => [1,3,2] => 2
{{1,2},{3}} => [2,1,3] => [3,1,2] => 1
{{1,3},{2}} => [3,2,1] => [1,2,3] => 1
{{1},{2,3}} => [1,3,2] => [2,3,1] => 1
{{1},{2},{3}} => [1,2,3] => [3,2,1] => 1
{{1,2,3,4}} => [2,3,4,1] => [1,4,3,2] => 5
{{1,2,3},{4}} => [2,3,1,4] => [4,1,3,2] => 2
{{1,2,4},{3}} => [2,4,3,1] => [1,3,4,2] => 3
{{1,2},{3,4}} => [2,1,4,3] => [3,4,1,2] => 1
{{1,2},{3},{4}} => [2,1,3,4] => [4,3,1,2] => 1
{{1,3,4},{2}} => [3,2,4,1] => [1,4,2,3] => 3
{{1,3},{2,4}} => [3,4,1,2] => [2,1,4,3] => 3
{{1,3},{2},{4}} => [3,2,1,4] => [4,1,2,3] => 1
{{1,4},{2,3}} => [4,3,2,1] => [1,2,3,4] => 1
{{1},{2,3,4}} => [1,3,4,2] => [2,4,3,1] => 2
{{1},{2,3},{4}} => [1,3,2,4] => [4,2,3,1] => 1
{{1,4},{2},{3}} => [4,2,3,1] => [1,3,2,4] => 2
{{1},{2,4},{3}} => [1,4,3,2] => [2,3,4,1] => 1
{{1},{2},{3,4}} => [1,2,4,3] => [3,4,2,1] => 1
{{1},{2},{3},{4}} => [1,2,3,4] => [4,3,2,1] => 1
{{1,2,3,4,5}} => [2,3,4,5,1] => [1,5,4,3,2] => 14
{{1,2,3,4},{5}} => [2,3,4,1,5] => [5,1,4,3,2] => 5
{{1,2,3,5},{4}} => [2,3,5,4,1] => [1,4,5,3,2] => 9
{{1,2,3},{4,5}} => [2,3,1,5,4] => [4,5,1,3,2] => 2
{{1,2,3},{4},{5}} => [2,3,1,4,5] => [5,4,1,3,2] => 2
{{1,2,4,5},{3}} => [2,4,3,5,1] => [1,5,3,4,2] => 10
{{1,2,4},{3,5}} => [2,4,5,1,3] => [3,1,5,4,2] => 8
{{1,2,4},{3},{5}} => [2,4,3,1,5] => [5,1,3,4,2] => 3
{{1,2,5},{3,4}} => [2,5,4,3,1] => [1,3,4,5,2] => 4
{{1,2},{3,4,5}} => [2,1,4,5,3] => [3,5,4,1,2] => 2
{{1,2},{3,4},{5}} => [2,1,4,3,5] => [5,3,4,1,2] => 1
{{1,2,5},{3},{4}} => [2,5,3,4,1] => [1,4,3,5,2] => 7
{{1,2},{3,5},{4}} => [2,1,5,4,3] => [3,4,5,1,2] => 1
{{1,2},{3},{4,5}} => [2,1,3,5,4] => [4,5,3,1,2] => 1
{{1,2},{3},{4},{5}} => [2,1,3,4,5] => [5,4,3,1,2] => 1
{{1,3,4,5},{2}} => [3,2,4,5,1] => [1,5,4,2,3] => 9
{{1,3,4},{2,5}} => [3,5,4,1,2] => [2,1,4,5,3] => 6
{{1,3,4},{2},{5}} => [3,2,4,1,5] => [5,1,4,2,3] => 3
{{1,3,5},{2,4}} => [3,4,5,2,1] => [1,2,5,4,3] => 14
{{1,3},{2,4,5}} => [3,4,1,5,2] => [2,5,1,4,3] => 8
{{1,3},{2,4},{5}} => [3,4,1,2,5] => [5,2,1,4,3] => 3
{{1,3,5},{2},{4}} => [3,2,5,4,1] => [1,4,5,2,3] => 6
{{1,3},{2,5},{4}} => [3,5,1,4,2] => [2,4,1,5,3] => 5
{{1,3},{2},{4,5}} => [3,2,1,5,4] => [4,5,1,2,3] => 1
{{1,3},{2},{4},{5}} => [3,2,1,4,5] => [5,4,1,2,3] => 1
{{1,4,5},{2,3}} => [4,3,2,5,1] => [1,5,2,3,4] => 4
{{1,4},{2,3,5}} => [4,3,5,1,2] => [2,1,5,3,4] => 6
{{1,4},{2,3},{5}} => [4,3,2,1,5] => [5,1,2,3,4] => 1
{{1,5},{2,3,4}} => [5,3,4,2,1] => [1,2,4,3,5] => 3
{{1},{2,3,4,5}} => [1,3,4,5,2] => [2,5,4,3,1] => 5
{{1},{2,3,4},{5}} => [1,3,4,2,5] => [5,2,4,3,1] => 2
{{1,5},{2,3},{4}} => [5,3,2,4,1] => [1,4,2,3,5] => 3
{{1},{2,3,5},{4}} => [1,3,5,4,2] => [2,4,5,3,1] => 3
{{1},{2,3},{4,5}} => [1,3,2,5,4] => [4,5,2,3,1] => 1
{{1},{2,3},{4},{5}} => [1,3,2,4,5] => [5,4,2,3,1] => 1
{{1,4,5},{2},{3}} => [4,2,3,5,1] => [1,5,3,2,4] => 7
{{1,4},{2,5},{3}} => [4,5,3,1,2] => [2,1,3,5,4] => 4
{{1,4},{2},{3,5}} => [4,2,5,1,3] => [3,1,5,2,4] => 5
{{1,4},{2},{3},{5}} => [4,2,3,1,5] => [5,1,3,2,4] => 2
{{1,5},{2,4},{3}} => [5,4,3,2,1] => [1,2,3,4,5] => 1
{{1},{2,4,5},{3}} => [1,4,3,5,2] => [2,5,3,4,1] => 3
{{1},{2,4},{3,5}} => [1,4,5,2,3] => [3,2,5,4,1] => 3
{{1},{2,4},{3},{5}} => [1,4,3,2,5] => [5,2,3,4,1] => 1
{{1,5},{2},{3,4}} => [5,2,4,3,1] => [1,3,4,2,5] => 3
{{1},{2,5},{3,4}} => [1,5,4,3,2] => [2,3,4,5,1] => 1
{{1},{2},{3,4,5}} => [1,2,4,5,3] => [3,5,4,2,1] => 2
{{1},{2},{3,4},{5}} => [1,2,4,3,5] => [5,3,4,2,1] => 1
{{1,5},{2},{3},{4}} => [5,2,3,4,1] => [1,4,3,2,5] => 5
{{1},{2,5},{3},{4}} => [1,5,3,4,2] => [2,4,3,5,1] => 2
{{1},{2},{3,5},{4}} => [1,2,5,4,3] => [3,4,5,2,1] => 1
{{1},{2},{3},{4,5}} => [1,2,3,5,4] => [4,5,3,2,1] => 1
{{1},{2},{3},{4},{5}} => [1,2,3,4,5] => [5,4,3,2,1] => 1
{{1,2,3,4,5,6}} => [2,3,4,5,6,1] => [1,6,5,4,3,2] => 42
{{1,2,3,4,5},{6}} => [2,3,4,5,1,6] => [6,1,5,4,3,2] => 14
{{1,2,3,4,6},{5}} => [2,3,4,6,5,1] => [1,5,6,4,3,2] => 28
{{1,2,3,4},{5,6}} => [2,3,4,1,6,5] => [5,6,1,4,3,2] => 5
{{1,2,3,4},{5},{6}} => [2,3,4,1,5,6] => [6,5,1,4,3,2] => 5
{{1,2,3,5,6},{4}} => [2,3,5,4,6,1] => [1,6,4,5,3,2] => 32
{{1,2,3,5},{4,6}} => [2,3,5,6,1,4] => [4,1,6,5,3,2] => 23
{{1,2,3,5},{4},{6}} => [2,3,5,4,1,6] => [6,1,4,5,3,2] => 9
{{1,2,3,6},{4,5}} => [2,3,6,5,4,1] => [1,4,5,6,3,2] => 14
{{1,2,3},{4,5,6}} => [2,3,1,5,6,4] => [4,6,5,1,3,2] => 4
{{1,2,3},{4,5},{6}} => [2,3,1,5,4,6] => [6,4,5,1,3,2] => 2
{{1,2,3,6},{4},{5}} => [2,3,6,4,5,1] => [1,5,4,6,3,2] => 23
{{1,2,3},{4,6},{5}} => [2,3,1,6,5,4] => [4,5,6,1,3,2] => 2
{{1,2,3},{4},{5,6}} => [2,3,1,4,6,5] => [5,6,4,1,3,2] => 2
{{1,2,3},{4},{5},{6}} => [2,3,1,4,5,6] => [6,5,4,1,3,2] => 2
{{1,2,4,5,6},{3}} => [2,4,3,5,6,1] => [1,6,5,3,4,2] => 32
{{1,2,4,5},{3,6}} => [2,4,6,5,1,3] => [3,1,5,6,4,2] => 20
{{1,2,4,5},{3},{6}} => [2,4,3,5,1,6] => [6,1,5,3,4,2] => 10
{{1,2,4,6},{3,5}} => [2,4,5,6,3,1] => [1,3,6,5,4,2] => 58
{{1,2,4},{3,5,6}} => [2,4,5,1,6,3] => [3,6,1,5,4,2] => 21
{{1,2,4},{3,5},{6}} => [2,4,5,1,3,6] => [6,3,1,5,4,2] => 8
{{1,2,4,6},{3},{5}} => [2,4,3,6,5,1] => [1,5,6,3,4,2] => 22
{{1,2,4},{3,6},{5}} => [2,4,6,1,5,3] => [3,5,1,6,4,2] => 13
{{1,2,4},{3},{5,6}} => [2,4,3,1,6,5] => [5,6,1,3,4,2] => 3
{{1,2,4},{3},{5},{6}} => [2,4,3,1,5,6] => [6,5,1,3,4,2] => 3
{{1,2,5,6},{3,4}} => [2,5,4,3,6,1] => [1,6,3,4,5,2] => 17
>>> Load all 301 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 reduced Kogan faces with the permutation as type.
This is equivalent to finding the number of ways to represent the permutation $\pi \in S_{n+1}$ as a reduced subword of $s_n (s_{n-1} s_n) (s_{n-2} s_{n-1} s_n) \dotsm (s_1 \dotsm s_n)$, or the number of reduced pipe dreams for $\pi$.
This is equivalent to finding the number of ways to represent the permutation $\pi \in S_{n+1}$ as a reduced subword of $s_n (s_{n-1} s_n) (s_{n-2} s_{n-1} s_n) \dotsm (s_1 \dotsm s_n)$, or the number of reduced pipe dreams for $\pi$.
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
Map
reverse
Description
Sends a permutation to its reverse.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
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!