Identifier
Values
[1,1,1,0,0,0] => [[0,0,1],[1,0,0],[0,1,0]] => [3,1,2] => ([(0,2),(1,2)],3) => 2
[1,0,1,1,1,0,0,0] => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]] => [1,4,2,3] => ([(1,3),(2,3)],4) => 2
[1,1,0,1,1,0,0,0] => [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]] => [1,4,2,3] => ([(1,3),(2,3)],4) => 2
[1,1,1,0,0,0,1,0] => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]] => [3,1,2,4] => ([(1,3),(2,3)],4) => 2
[1,1,1,0,1,0,0,0] => [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]] => [1,4,2,3] => ([(1,3),(2,3)],4) => 2
[1,1,1,1,0,0,0,0] => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4) => 3
[1,0,1,1,1,1,0,0,0,0] => [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5) => 3
[1,1,0,1,1,1,0,0,0,0] => [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5) => 3
[1,1,1,0,1,1,0,0,0,0] => [[0,0,1,0,0],[1,0,-1,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5) => 3
[1,1,1,1,0,0,0,0,1,0] => [[0,0,0,1,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]] => [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5) => 3
[1,1,1,1,0,1,0,0,0,0] => [[0,0,0,1,0],[1,0,0,-1,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5) => 3
[1,1,1,1,1,0,0,0,0,0] => [[0,0,0,0,1],[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[1,0,1,1,1,1,1,0,0,0,0,0] => [[1,0,0,0,0,0],[0,0,0,0,0,1],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,0,1,1,1,1,0,0,0,0,0] => [[0,1,0,0,0,0],[1,-1,0,0,0,1],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,1,0,0,0,1,1,1,0,0,0] => [[0,0,1,0,0,0],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [3,1,2,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6) => 3
[1,1,1,0,1,1,1,0,0,0,0,0] => [[0,0,1,0,0,0],[1,0,-1,0,0,1],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,1,1,0,0,0,1,1,0,0,0] => [[0,0,0,1,0,0],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,-1,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [3,1,2,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6) => 3
[1,1,1,1,0,1,1,0,0,0,0,0] => [[0,0,0,1,0,0],[1,0,0,-1,0,1],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,1,1,1,0,0,0,0,0,1,0] => [[0,0,0,0,1,0],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1]] => [5,1,2,3,4,6] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,1,1,1,0,0,0,1,0,0,0] => [[0,0,0,0,1,0],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,-1,1],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [3,1,2,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6) => 3
[1,1,1,1,1,0,1,0,0,0,0,0] => [[0,0,0,0,1,0],[1,0,0,0,-1,1],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,1,1,1,1,0,0,0,0,0,0] => [[0,0,0,0,0,1],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0]] => [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 5
search for individual values
searching the database for the individual values of this statistic
Description
The distinguishing index of a graph.
This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism.
If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.
Map
to left key permutation
Description
Return the permutation of the left key of an alternating sign matrix.
This was originally defined by Lascoux and then further studied by Aval [1].
Map
to alternating sign matrix
Description
Return the Dyck path as an alternating sign matrix.
This is an inclusion map from Dyck words of length $2n$ to certain
$n \times n$ alternating sign matrices.
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.