Identifier
-
Mp00081:
Standard tableaux
—reading word permutation⟶
Permutations
Mp00248: Permutations —DEX composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001060: Graphs ⟶ ℤ
Values
[[1],[2],[3]] => [3,2,1] => [2,1] => ([(0,2),(1,2)],3) => 2
[[1,4],[2],[3]] => [3,2,1,4] => [2,2] => ([(1,3),(2,3)],4) => 2
[[1,3],[2],[4]] => [4,2,1,3] => [2,2] => ([(1,3),(2,3)],4) => 2
[[1],[2],[3],[4]] => [4,3,2,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[[1,5],[2],[3],[4]] => [4,3,2,1,5] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[[1,4],[2],[3],[5]] => [5,3,2,1,4] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[[1,3],[2],[4],[5]] => [5,4,2,1,3] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[[1,2],[3],[4],[5]] => [5,4,3,1,2] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[[1],[2],[3],[4],[5]] => [5,4,3,2,1] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[[1,3],[2,4],[5,6]] => [5,6,2,4,1,3] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[[1,3],[2,4],[5],[6]] => [6,5,2,4,1,3] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,6],[2],[3],[4],[5]] => [5,4,3,2,1,6] => [1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,5],[2],[3],[4],[6]] => [6,4,3,2,1,5] => [1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,4],[2],[3],[5],[6]] => [6,5,3,2,1,4] => [1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,3],[2],[4],[5],[6]] => [6,5,4,2,1,3] => [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1,2],[3],[4],[5],[6]] => [6,5,4,3,1,2] => [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[[1],[2],[3],[4],[5],[6]] => [6,5,4,3,2,1] => [1,1,2,1,1] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
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.
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
DEX composition
Description
The DEX composition of a permutation.
Let π be a permutation in Sn. Let ˉπ be the word in the ordered set ˉ1<⋯<ˉn<1⋯<n obtained from π by replacing every excedance π(i)>i by ¯π(i). Then the DEX set of π is the set of indices 1≤i<n such that ˉπ(i)>ˉπ(i+1). Finally, the DEX composition c1,…,ck of n corresponds to the DEX subset {c1,c1+c2,…,c1+⋯+ck−1}.
The (quasi)symmetric function
∑π∈Sλ,jFDEX(π),
where the sum is over the set of permutations of cycle type λ with j excedances, is the Eulerian quasisymmetric function.
Let π be a permutation in Sn. Let ˉπ be the word in the ordered set ˉ1<⋯<ˉn<1⋯<n obtained from π by replacing every excedance π(i)>i by ¯π(i). Then the DEX set of π is the set of indices 1≤i<n such that ˉπ(i)>ˉπ(i+1). Finally, the DEX composition c1,…,ck of n corresponds to the DEX subset {c1,c1+c2,…,c1+⋯+ck−1}.
The (quasi)symmetric function
∑π∈Sλ,jFDEX(π),
where the sum is over the set of permutations of cycle type λ with j excedances, is the Eulerian quasisymmetric function.
Map
to threshold graph
Description
The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
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!