Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000741: Graphs ⟶ ℤ
Values
[1,0] => [1] => [1] => ([],1) => 0
[1,0,1,0] => [1,2] => [1,2] => ([],2) => 1
[1,1,0,0] => [2,1] => [2,1] => ([(0,1)],2) => 1
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => ([],3) => 1
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => ([(0,2),(1,2)],3) => 2
[1,1,1,0,0,0] => [3,2,1] => [2,3,1] => ([(0,2),(1,2)],3) => 2
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => ([],4) => 1
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,4,2,3] => ([(1,3),(2,3)],4) => 1
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,3,4,2] => ([(1,3),(2,3)],4) => 1
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => ([(1,3),(2,3)],4) => 1
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4) => 2
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [2,3,1,4] => ([(1,3),(2,3)],4) => 1
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4) => 1
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4) => 2
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => ([],5) => 1
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5) => 1
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5) => 1
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [1,4,2,3,5] => ([(2,4),(3,4)],5) => 1
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,3,4,2,5] => ([(2,4),(3,4)],5) => 1
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5) => 1
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5) => 1
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5) => 1
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => ([(2,4),(3,4)],5) => 1
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5) => 1
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5) => 2
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [2,3,1,4,5] => ([(2,4),(3,4)],5) => 1
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5) => 1
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5) => 1
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 2
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [2,4,3,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [3,2,5,1,4] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => 2
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6) => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [1,2,3,6,4,5] => ([(3,5),(4,5)],6) => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,5,6,4] => ([(3,5),(4,5)],6) => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [1,2,5,3,4,6] => ([(3,5),(4,5)],6) => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,4,5,3,6] => ([(3,5),(4,5)],6) => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [1,2,4,6,3,5] => ([(2,5),(3,4),(4,5)],6) => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,5,4,6,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [1,3,2,6,4,5] => ([(1,2),(3,5),(4,5)],6) => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,3,2,5,6,4] => ([(1,2),(3,5),(4,5)],6) => 1
[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,5),(4,5)],6) => 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] => ([(1,2),(3,5),(4,5)],6) => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [1,3,4,2,5,6] => ([(3,5),(4,5)],6) => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,3,4,2,6,5] => ([(1,2),(3,5),(4,5)],6) => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [1,3,5,2,4,6] => ([(2,5),(3,4),(4,5)],6) => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [1,3,5,4,6,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => [1,4,3,5,2,6] => ([(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,1,1,1,0,0,0,1,0,0] => [1,5,4,3,6,2] => [1,4,3,6,2,5] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,0,1,1,1,1,0,0,1,0,0,0] => [1,6,4,3,5,2] => [1,4,3,5,6,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,1,1,1,0,1,0,0,0,0] => [1,6,4,5,3,2] => [1,5,3,4,6,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => [1,4,5,3,6,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,0,1,0,1,1,0,1,0,0] => [2,1,3,5,6,4] => [2,1,3,6,4,5] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => [2,1,3,5,6,4] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => [2,1,5,3,4,6] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => [2,1,4,5,3,6] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,0,1,1,1,0,0,1,0,0] => [2,1,5,4,6,3] => [2,1,4,6,3,5] => ([(0,1),(2,5),(3,4),(4,5)],6) => 1
[1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => [2,1,5,4,6,3] => ([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,1,0,0,1,0,1,0,1,0] => [2,3,1,4,5,6] => [3,1,2,4,5,6] => ([(3,5),(4,5)],6) => 1
[1,1,0,1,0,0,1,0,1,1,0,0] => [2,3,1,4,6,5] => [3,1,2,4,6,5] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,1,0,0,1,1,0,0,1,0] => [2,3,1,5,4,6] => [3,1,2,5,4,6] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,0,1,0,0,1,1,0,1,0,0] => [2,3,1,5,6,4] => [3,1,2,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6) => 1
[1,1,0,1,0,0,1,1,1,0,0,0] => [2,3,1,6,5,4] => [3,1,2,5,6,4] => ([(0,5),(1,5),(2,4),(3,4)],6) => 1
[1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,0,0,0,1,0,1,0,1,0] => [3,2,1,4,5,6] => [2,3,1,4,5,6] => ([(3,5),(4,5)],6) => 1
[1,1,1,0,0,0,1,0,1,1,0,0] => [3,2,1,4,6,5] => [2,3,1,4,6,5] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,1,0,0,0,1,1,0,0,1,0] => [3,2,1,5,4,6] => [2,3,1,5,4,6] => ([(1,2),(3,5),(4,5)],6) => 1
[1,1,1,0,0,0,1,1,0,1,0,0] => [3,2,1,5,6,4] => [2,3,1,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6) => 1
[1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => [2,3,1,5,6,4] => ([(0,5),(1,5),(2,4),(3,4)],6) => 1
[1,1,1,0,0,1,0,0,1,0,1,0] => [3,2,4,1,5,6] => [2,4,1,3,5,6] => ([(2,5),(3,4),(4,5)],6) => 1
[1,1,1,0,0,1,0,0,1,1,0,0] => [3,2,4,1,6,5] => [2,4,1,3,6,5] => ([(0,1),(2,5),(3,4),(4,5)],6) => 1
[1,1,1,0,1,0,1,0,1,0,0,0] => [6,2,3,4,5,1] => [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,0,1,0,1,1,0,0,0,0] => [6,2,3,5,4,1] => [2,3,5,4,6,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,1,0,0,0,0,1,0] => [5,2,4,3,1,6] => [2,4,3,5,1,6] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,1,0,0,0,1,0,0] => [5,2,4,3,6,1] => [2,4,3,6,1,5] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,0,1,1,0,0,1,0,0,0] => [6,2,4,3,5,1] => [2,4,3,5,6,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,1,0,1,0,0,0,0] => [6,2,4,5,3,1] => [2,5,3,4,6,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,1,1,0,0,0,0,0] => [6,2,5,4,3,1] => [2,4,5,3,6,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => [3,2,4,1,5,6] => ([(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => [3,2,4,1,6,5] => ([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,1,0,0,1,0] => [4,3,2,5,1,6] => [3,2,5,1,4,6] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,1,0,1,0,0] => [4,3,2,5,6,1] => [3,2,6,1,4,5] => ([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,1,1,0,0,0] => [4,3,2,6,5,1] => [3,2,5,6,1,4] => ([(0,3),(0,4),(1,2),(1,5),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,0,0,0,1,0] => [5,3,2,4,1,6] => [3,2,4,5,1,6] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,0,0,1,0,0] => [5,3,2,4,6,1] => [3,2,4,6,1,5] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,0,1,0,0,0] => [6,3,2,4,5,1] => [3,2,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,1,0,0,0,0] => [6,3,2,5,4,1] => [3,2,5,4,6,1] => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,1,0,0,0,0,1,0] => [5,3,4,2,1,6] => [4,2,3,5,1,6] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,1,0,0,0,1,0,0] => [5,3,4,2,6,1] => [4,2,3,6,1,5] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,0,1,0,0,1,0,0,0] => [6,3,4,2,5,1] => [4,2,3,5,6,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => [3,4,2,5,1,6] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,0,0,1,0,0] => [5,4,3,2,6,1] => [3,4,2,6,1,5] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,0,1,0,0,0] => [6,4,3,2,5,1] => [3,4,2,5,6,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,1,0,0,0,0] => [6,4,3,5,2,1] => [3,5,2,4,6,1] => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => [4,3,5,2,6,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
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 Colin de Verdière graph invariant.
Map
graph of inversions
Description
The graph of inversions of a permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
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..
Map
inverse first fundamental transformation
Description
Let $\sigma = (i_{11}\cdots i_{1k_1})\cdots(i_{\ell 1}\cdots i_{\ell k_\ell})$ be a permutation given by cycle notation such that every cycle starts with its maximal entry, and all cycles are ordered increasingly by these maximal entries.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the 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!