Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00066: Permutations —inverse⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001461: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 1
[1,0,1,0] => [1,2] => [1,2] => [2,1] => 1
[1,1,0,0] => [2,1] => [2,1] => [1,2] => 2
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => [2,3,1] => 1
[1,0,1,1,0,0] => [1,3,2] => [1,3,2] => [3,2,1] => 2
[1,1,0,0,1,0] => [2,1,3] => [2,1,3] => [1,3,2] => 2
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => [3,1,2] => 1
[1,1,1,0,0,0] => [3,2,1] => [3,2,1] => [2,1,3] => 2
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 1
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,4,3] => [2,4,3,1] => 2
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,3,2,4] => [3,2,4,1] => 2
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,4,2,3] => [3,4,2,1] => 1
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,4,3,2] => [4,3,2,1] => 2
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => [1,3,4,2] => 2
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [2,1,4,3] => [1,4,3,2] => 3
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => [3,1,4,2] => 1
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => [3,4,1,2] => 1
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [4,1,3,2] => [4,3,1,2] => 1
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [3,2,1,4] => [2,1,4,3] => 2
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [4,2,1,3] => [2,4,1,3] => 1
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [4,2,3,1] => [2,3,1,4] => 2
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [4,3,2,1] => [3,2,1,4] => 3
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,5,4] => [2,3,5,4,1] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,4,3,5] => [2,4,3,5,1] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [1,2,5,3,4] => [2,4,5,3,1] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,5,4,3] => [2,5,4,3,1] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,3,2,4,5] => [3,2,4,5,1] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,3,2,5,4] => [3,2,5,4,1] => 3
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [1,4,2,3,5] => [3,4,2,5,1] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [1,5,2,3,4] => [3,4,5,2,1] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [1,5,2,4,3] => [3,5,4,2,1] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,4,3,2,5] => [4,3,2,5,1] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [1,5,3,2,4] => [4,3,5,2,1] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [1,5,3,4,2] => [5,3,4,2,1] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,5,4,3,2] => [5,4,3,2,1] => 3
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => [1,3,4,5,2] => 2
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [2,1,3,5,4] => [1,3,5,4,2] => 3
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [2,1,4,3,5] => [1,4,3,5,2] => 3
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,1,5,3,4] => [1,4,5,3,2] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [2,1,5,4,3] => [1,5,4,3,2] => 3
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => [3,1,4,5,2] => 1
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [3,1,2,5,4] => [3,1,5,4,2] => 2
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,1,2,3,5] => [3,4,1,5,2] => 1
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => [3,4,5,1,2] => 1
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [5,1,2,4,3] => [3,5,4,1,2] => 1
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [4,1,3,2,5] => [4,3,1,5,2] => 1
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [5,1,3,2,4] => [4,3,5,1,2] => 1
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [5,1,3,4,2] => [5,3,4,1,2] => 1
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [5,1,4,3,2] => [5,4,3,1,2] => 2
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [3,2,1,4,5] => [2,1,4,5,3] => 2
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [3,2,1,5,4] => [2,1,5,4,3] => 3
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [4,2,1,3,5] => [2,4,1,5,3] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [5,2,1,3,4] => [2,4,5,1,3] => 1
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [5,2,1,4,3] => [2,5,4,1,3] => 1
[1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [4,2,3,1,5] => [2,3,1,5,4] => 2
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [5,2,3,1,4] => [2,3,5,1,4] => 1
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [5,2,3,4,1] => [2,3,4,1,5] => 2
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [5,2,4,3,1] => [2,4,3,1,5] => 3
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [4,3,2,1,5] => [3,2,1,5,4] => 3
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [5,3,2,1,4] => [3,2,5,1,4] => 2
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [5,3,2,4,1] => [3,2,4,1,5] => 3
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [5,4,2,3,1] => [3,4,2,1,5] => 2
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [5,4,3,2,1] => [4,3,2,1,5] => 3
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [1,2,3,4,6,5] => [2,3,4,6,5,1] => 2
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [1,2,3,5,4,6] => [2,3,5,4,6,1] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [1,2,3,6,4,5] => [2,3,5,6,4,1] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,6,5,4] => [2,3,6,5,4,1] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [1,2,4,3,5,6] => [2,4,3,5,6,1] => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,4,3,6,5] => [2,4,3,6,5,1] => 3
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [1,2,5,3,4,6] => [2,4,5,3,6,1] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [1,2,6,3,4,5] => [2,4,5,6,3,1] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [1,2,6,3,5,4] => [2,4,6,5,3,1] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,5,4,3,6] => [2,5,4,3,6,1] => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [1,2,6,4,3,5] => [2,5,4,6,3,1] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,6,4,5,3] => [1,2,6,4,5,3] => [2,6,4,5,3,1] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,6,5,4,3] => [2,6,5,4,3,1] => 3
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [1,3,2,4,5,6] => [3,2,4,5,6,1] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [1,3,2,4,6,5] => [3,2,4,6,5,1] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,3,2,5,4,6] => [3,2,5,4,6,1] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [1,3,2,6,4,5] => [3,2,5,6,4,1] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,3,2,6,5,4] => [3,2,6,5,4,1] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [1,4,2,3,5,6] => [3,4,2,5,6,1] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [1,4,2,3,6,5] => [3,4,2,6,5,1] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [1,5,2,3,4,6] => [3,4,5,2,6,1] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [1,6,2,3,4,5] => [3,4,5,6,2,1] => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [1,6,2,3,5,4] => [3,4,6,5,2,1] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [1,5,2,4,3,6] => [3,5,4,2,6,1] => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [1,6,2,4,3,5] => [3,5,4,6,2,1] => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => [1,6,2,4,5,3] => [3,6,4,5,2,1] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [1,6,2,5,4,3] => [3,6,5,4,2,1] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [1,4,3,2,5,6] => [4,3,2,5,6,1] => 2
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,4,3,2,6,5] => [4,3,2,6,5,1] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [1,5,3,2,4,6] => [4,3,5,2,6,1] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [1,6,3,2,4,5] => [4,3,5,6,2,1] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [1,6,3,2,5,4] => [4,3,6,5,2,1] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,5,3,4,2,6] => [1,5,3,4,2,6] => [5,3,4,2,6,1] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => [1,6,3,4,2,5] => [5,3,4,6,2,1] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => [1,6,3,4,5,2] => [6,3,4,5,2,1] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [1,6,3,5,4,2] => [6,3,5,4,2,1] => 3
>>> Load all 220 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 topologically connected components of the chord diagram of a permutation.
The chord diagram of a permutation π∈Sn is obtained by placing labels 1,…,n in cyclic order on a cycle and drawing a (straight) arc from i to π(i) for every label i.
This statistic records the number of topologically connected components in the chord diagram. In particular, if two arcs cross, all four labels connected by the two arcs are in the same component.
The permutation π∈Sn stabilizes an interval I={a,a+1,…,b} if π(I)=I. It is stabilized-interval-free, if the only interval π stablizes is {1,…,n}. Thus, this statistic is 1 if π is stabilized-interval-free.
The chord diagram of a permutation π∈Sn is obtained by placing labels 1,…,n in cyclic order on a cycle and drawing a (straight) arc from i to π(i) for every label i.
This statistic records the number of topologically connected components in the chord diagram. In particular, if two arcs cross, all four labels connected by the two arcs are in the same component.
The permutation π∈Sn stabilizes an interval I={a,a+1,…,b} if π(I)=I. It is stabilized-interval-free, if the only interval π stablizes is {1,…,n}. Thus, this statistic is 1 if π is stabilized-interval-free.
Map
inverse
Description
Sends a permutation to its inverse.
Map
Inverse Kreweras complement
Description
Sends the permutation π∈Sn to the permutation cπ−1 where c=(1,…,n) is the long cycle.
Map
to non-crossing permutation
Description
Sends a Dyck path D with valley at positions {(i1,j1),…,(ik,jk)} to the unique non-crossing permutation π having descents {i1,…,ik} and whose inverse has descents {j1,…,jk}.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
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!