Identifier
-
Mp00089:
Permutations
—Inverse Kreweras complement⟶
Permutations
Mp00209: Permutations —pattern poset⟶ Posets
Mp00125: Posets —dual poset⟶ Posets
St000528: Posets ⟶ ℤ (values match St000080The rank of the poset.)
Values
[1] => [1] => ([],1) => ([],1) => 1
[1,2] => [2,1] => ([(0,1)],2) => ([(0,1)],2) => 2
[2,1] => [1,2] => ([(0,1)],2) => ([(0,1)],2) => 2
[1,2,3] => [2,3,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 3
[1,3,2] => [3,2,1] => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 3
[2,1,3] => [1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 3
[2,3,1] => [1,2,3] => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 3
[3,1,2] => [3,1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 3
[3,2,1] => [2,1,3] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 3
[1,2,3,4] => [2,3,4,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[1,4,2,3] => [3,4,2,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[1,4,3,2] => [4,3,2,1] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 4
[2,1,4,3] => [1,4,3,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[2,3,1,4] => [1,2,4,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[2,3,4,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 4
[3,2,1,4] => [2,1,4,3] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => 4
[3,2,4,1] => [2,1,3,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[3,4,1,2] => [4,1,2,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[4,1,2,3] => [3,4,1,2] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => 4
[4,1,3,2] => [4,3,1,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[4,3,2,1] => [3,2,1,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 4
[1,5,4,3,2] => [5,4,3,2,1] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[2,3,4,5,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[1,6,5,4,3,2] => [6,5,4,3,2,1] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[2,3,4,5,6,1] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[1,7,6,5,4,3,2] => [7,6,5,4,3,2,1] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[2,3,4,5,6,7,1] => [1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
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 height of a poset.
This equals the rank of the poset St000080The rank of the poset. plus one.
This equals the rank of the poset St000080The rank of the poset. plus one.
Map
Inverse Kreweras complement
Description
Sends the permutation $\pi \in \mathfrak{S}_n$ to the permutation $c\pi^{-1}$ where $c = (1,\ldots,n)$ is the long cycle.
Map
dual poset
Description
The dual of a poset.
The dual (or opposite) of a poset $(\mathcal P,\leq)$ is the poset $(\mathcal P^d,\leq_d)$ with $x \leq_d y$ if $y \leq x$.
The dual (or opposite) of a poset $(\mathcal P,\leq)$ is the poset $(\mathcal P^d,\leq_d)$ with $x \leq_d y$ if $y \leq x$.
Map
pattern poset
Description
The pattern poset of a permutation.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
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!