Your data matches 59 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001279
St001279: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 2 = 3 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 3 = 4 - 1
[2,1]
=> 2 = 3 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 4 = 5 - 1
[3,1]
=> 3 = 4 - 1
[2,2]
=> 4 = 5 - 1
[2,1,1]
=> 2 = 3 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 5 = 6 - 1
[4,1]
=> 4 = 5 - 1
[3,2]
=> 5 = 6 - 1
[3,1,1]
=> 3 = 4 - 1
[2,2,1]
=> 4 = 5 - 1
[2,1,1,1]
=> 2 = 3 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
[6]
=> 6 = 7 - 1
[5,1]
=> 5 = 6 - 1
[4,2]
=> 6 = 7 - 1
[4,1,1]
=> 4 = 5 - 1
[3,3]
=> 6 = 7 - 1
[3,2,1]
=> 5 = 6 - 1
[3,1,1,1]
=> 3 = 4 - 1
[2,2,2]
=> 6 = 7 - 1
[2,2,1,1]
=> 4 = 5 - 1
[2,1,1,1,1]
=> 2 = 3 - 1
[1,1,1,1,1,1]
=> 0 = 1 - 1
Description
The sum of the parts of an integer partition that are at least two.
Matching statistic: St001255
Mp00045: Integer partitions reading tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St001255: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => [1,0]
=> 1
[2]
=> [[1,2]]
=> [1,2] => [1,0,1,0]
=> 3
[1,1]
=> [[1],[2]]
=> [2,1] => [1,1,0,0]
=> 1
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,0,1,0,1,0]
=> 4
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => [1,1,0,0,1,0]
=> 3
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [1,1,1,0,0,0]
=> 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 5
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 4
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 5
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 3
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 6
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 5
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 6
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 4
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 5
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 7
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 6
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => [1,1,1,0,1,0,0,0,1,0,1,0]
=> 7
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> 5
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,1,1,1,0,1,0,1,0,0,0,0]
=> 7
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => [1,1,1,1,0,0,1,0,0,0,1,0]
=> 6
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> 4
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> 7
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 5
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 3
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
Description
The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J.
Matching statistic: St001468
Mp00045: Integer partitions reading tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00239: Permutations CorteelPermutations
St001468: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => [1] => 1
[2]
=> [[1,2]]
=> [1,2] => [1,2] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => [2,1] => 3
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,2,3] => 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => [2,1,3] => 3
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [2,3,1] => 4
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,2,3,4] => 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => [2,1,3,4] => 3
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [4,3,2,1] => 5
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => [2,3,1,4] => 4
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [3,4,1,2] => 5
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => [2,1,3,4,5] => 3
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => [4,3,2,1,5] => 5
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => [2,3,1,4,5] => 4
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [2,5,4,3,1] => 6
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [3,4,1,2,5] => 5
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [3,4,5,1,2] => 6
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => 3
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => [4,3,2,1,5,6] => 5
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => [2,3,1,4,5,6] => 4
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [6,5,4,3,2,1] => 7
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => [2,5,4,3,1,6] => 6
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => [3,4,1,2,5,6] => 5
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [4,3,5,6,2,1] => 7
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [3,6,1,5,4,2] => 7
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [3,4,5,1,2,6] => 6
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [4,5,6,1,2,3] => 7
Description
The smallest fixpoint of a permutation. A fixpoint of a permutation of length $n$ if an index $i$ such that $\pi(i) = i$, and we set $\pi(n+1) = n+1$.
Matching statistic: St000394
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00222: Dyck paths peaks-to-valleysDyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4 = 5 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 5 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 5 = 6 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 5 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 6 = 7 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 5 = 6 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 6 = 7 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 6 = 7 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St000915
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St000915: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => ([],1)
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,2] => ([],2)
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2 = 3 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 3 = 4 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 4 = 5 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 4 = 5 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 4 = 5 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 3 = 4 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 5 = 6 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 5 = 6 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => ([],6)
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => ([(4,5)],6)
=> 2 = 3 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(3,5),(4,5)],6)
=> 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6 = 7 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 5 = 6 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(2,5),(3,5),(4,5)],6)
=> 4 = 5 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6 = 7 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 6 = 7 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 6 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 6 = 7 - 1
Description
The Ore degree of a graph. This is the maximal Ore degree of an edge, which is the sum of the degrees of its two endpoints.
Mp00045: Integer partitions reading tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00239: Permutations CorteelPermutations
St000673: Permutations ⟶ ℤResult quality: 97% values known / values provided: 97%distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => [1] => ? = 1 - 1
[2]
=> [[1,2]]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,1]
=> [[1],[2]]
=> [2,1] => [2,1] => 2 = 3 - 1
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => [2,1,3] => 2 = 3 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [2,3,1] => 3 = 4 - 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => [2,1,3,4] => 2 = 3 - 1
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [4,3,2,1] => 4 = 5 - 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => [2,3,1,4] => 3 = 4 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [3,4,1,2] => 4 = 5 - 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => [2,1,3,4,5] => 2 = 3 - 1
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => [4,3,2,1,5] => 4 = 5 - 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => [2,3,1,4,5] => 3 = 4 - 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [2,5,4,3,1] => 5 = 6 - 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [3,4,1,2,5] => 4 = 5 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [3,4,5,1,2] => 5 = 6 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => 2 = 3 - 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => [4,3,2,1,5,6] => 4 = 5 - 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => [2,3,1,4,5,6] => 3 = 4 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [6,5,4,3,2,1] => 6 = 7 - 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => [2,5,4,3,1,6] => 5 = 6 - 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => [3,4,1,2,5,6] => 4 = 5 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [4,3,5,6,2,1] => 6 = 7 - 1
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [3,6,1,5,4,2] => 6 = 7 - 1
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [3,4,5,1,2,6] => 5 = 6 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [4,5,6,1,2,3] => 6 = 7 - 1
Description
The number of non-fixed points of a permutation. In other words, this statistic is $n$ minus the number of fixed points ([[St000022]]) of $\pi$.
Matching statistic: St000718
Mp00045: Integer partitions reading tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St000718: Graphs ⟶ ℤResult quality: 90% values known / values provided: 90%distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => ([],1)
=> 0 = 1 - 1
[2]
=> [[1,2]]
=> [1,2] => ([],2)
=> 0 = 1 - 1
[1,1]
=> [[1],[2]]
=> [2,1] => ([(0,1)],2)
=> 2 = 3 - 1
[3]
=> [[1,2,3]]
=> [1,2,3] => ([],3)
=> 0 = 1 - 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => ([(1,2)],3)
=> 2 = 3 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 3 = 4 - 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => ([],4)
=> 0 = 1 - 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => ([(2,3)],4)
=> 2 = 3 - 1
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4 = 5 - 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 5 - 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => ([],5)
=> 0 = 1 - 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 2 = 3 - 1
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 4 = 5 - 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ? = 6 - 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5 = 6 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => ([],6)
=> 0 = 1 - 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => ([(4,5)],6)
=> 2 = 3 - 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => ([(2,4),(2,5),(3,4),(3,5)],6)
=> 4 = 5 - 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 6 = 7 - 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ? ∊ {6,7} - 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 5 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 6 = 7 - 1
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? ∊ {6,7} - 1
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 6 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(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)
=> 6 = 7 - 1
Description
The largest Laplacian eigenvalue of a graph if it is integral. This statistic is undefined if the largest Laplacian eigenvalue of the graph is not integral. Various results are collected in Section 3.9 of [1]
Matching statistic: St001278
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St001278: Dyck paths ⟶ ℤResult quality: 79% values known / values provided: 79%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 5 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 5 = 6 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4 = 5 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 4 = 5 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 6 = 7 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 5 = 6 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 6 = 7 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? ∊ {1,3,4,5,6,7} - 1
Description
The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. The statistic is also equal to the number of non-projective torsionless indecomposable modules in the corresponding Nakayama algebra. See theorem 5.8. in the reference for a motivation.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00327: Dyck paths inverse Kreweras complementDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St001232: Dyck paths ⟶ ℤResult quality: 72% values known / values provided: 72%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 5 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 5 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? ∊ {5,6} - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4 = 5 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? ∊ {5,6} - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6 = 7 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? ∊ {5,6,7,7,7} - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ? ∊ {5,6,7,7,7} - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ? ∊ {5,6,7,7,7} - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 4 = 5 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? ∊ {5,6,7,7,7} - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> ? ∊ {5,6,7,7,7} - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 3 - 1
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St000422: Graphs ⟶ ℤResult quality: 59% values known / values provided: 59%distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0]
=> [1] => ([],1)
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,2] => ([],2)
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2 = 3 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ? = 4 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 4 = 5 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> ? ∊ {4,5} - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ? ∊ {4,5} - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 4 = 5 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ? ∊ {4,6,6} - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ? ∊ {4,6,6} - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> ? ∊ {4,6,6} - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 5 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => ([],6)
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => ([(4,5)],6)
=> 2 = 3 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(3,5),(4,5)],6)
=> ? ∊ {4,6,6,7,7,7} - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ? ∊ {4,6,6,7,7,7} - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {4,6,6,7,7,7} - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(2,5),(3,5),(4,5)],6)
=> ? ∊ {4,6,6,7,7,7} - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6 = 7 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {4,6,6,7,7,7} - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ? ∊ {4,6,6,7,7,7} - 1
Description
The energy of a graph, if it is integral. The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3]. The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
The following 49 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001090The number of pop-stack-sorts needed to sort a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000864The number of circled entries of the shifted recording tableau of a permutation. St000089The absolute variation of a composition. St000711The number of big exceedences of a permutation. St000456The monochromatic index of a connected graph. St000567The sum of the products of all pairs of parts. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001645The pebbling number of a connected graph. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001778The largest greatest common divisor of an element and its image in a permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000338The number of pixed points of a permutation. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000664The number of right ropes of a permutation. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000990The first ascent of a permutation. St001058The breadth of the ordered tree. St001209The pmaj statistic of a parking function. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001536The number of cyclic misalignments of a permutation. St001556The number of inversions of the third entry of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001893The flag descent of a signed permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000740The last entry of a permutation. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001268The size of the largest ordinal summand in the poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001557The number of inversions of the second entry of a permutation. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001811The Castelnuovo-Mumford regularity of a permutation.