Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000664: Permutations ⟶ ℤ
Values
[1] => [1,0,1,0] => [3,1,2] => [1,3,2] => 0
[2] => [1,1,0,0,1,0] => [2,4,1,3] => [3,1,4,2] => 0
[1,1] => [1,0,1,1,0,0] => [3,1,4,2] => [2,4,1,3] => 0
[3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => [4,3,1,5,2] => 0
[2,1] => [1,0,1,0,1,0] => [4,1,2,3] => [1,4,3,2] => 0
[1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => [3,5,2,1,4] => 0
[4] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => [5,4,3,1,6,2] => 0
[3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => [1,3,5,4,2] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => [4,2,5,1,3] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => [1,5,2,4,3] => 0
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => [4,6,3,2,1,5] => 0
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => [1,4,3,6,5,2] => 0
[3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => [4,1,5,3,2] => 0
[3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => [3,5,1,4,2] => 0
[2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => [2,5,4,1,3] => 0
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [6,1,4,5,2,3] => [1,6,3,2,5,4] => 0
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [2,6,4,1,3,5] => [5,1,3,6,4,2] => 0
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => [3,4,6,1,5,2] => 1
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => [5,4,2,6,1,3] => 0
[3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => [1,5,4,3,2] => 0
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => [4,6,1,2,5,3] => 1
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => [5,3,6,2,1,4] => 0
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [5,1,4,2,6,3] => [2,6,3,5,1,4] => 0
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => [5,4,1,6,3,2] => 0
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => [1,3,6,5,4,2] => 0
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => [4,6,3,1,5,2] => 0
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [5,3,1,2,6,4] => [2,4,6,5,1,3] => 0
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [2,6,1,5,3,4] => [5,1,6,2,4,3] => 0
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [6,1,5,2,3,4] => [1,6,2,5,4,3] => 0
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => [3,6,5,2,1,4] => 0
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [7,5,4,1,2,3,6] => [1,3,4,7,6,5,2] => 1
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [6,3,1,2,4,5] => [1,4,6,5,3,2] => 0
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => [5,3,6,1,4,2] => 0
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => [1,6,3,5,4,2] => 0
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => [5,2,6,4,1,3] => 0
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => [4,6,2,5,1,3] => 0
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [6,1,2,5,3,4] => [1,6,5,2,4,3] => 0
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [2,6,1,3,4,5] => [5,1,6,4,3,2] => 0
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => [4,6,1,5,3,2] => 0
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => [3,6,5,1,4,2] => 0
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => [2,6,5,4,1,3] => 0
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => [1,6,5,4,3,2] => 0
[] => [] => [1] => [1] => 0
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 ropes 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 rope is a large ascent after a 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 rope is a large ascent after a raft of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
Map
complement
Description
Sents a permutation to its complement.
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!