searching the database
Your data matches 121 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000981
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000981: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000981: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 6
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 8
Description
The length of the longest zigzag subpath.
This is the length of the longest consecutive subpath that is a zigzag of the form $010...$ or of the form $101...$.
Matching statistic: St000983
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
St000983: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00104: Binary words —reverse⟶ Binary words
St000983: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => 01 => 2
[1,0,1,0]
=> 1010 => 0101 => 4
[1,1,0,0]
=> 1100 => 0011 => 2
[1,0,1,0,1,0]
=> 101010 => 010101 => 6
[1,0,1,1,0,0]
=> 101100 => 001101 => 3
[1,1,0,0,1,0]
=> 110010 => 010011 => 3
[1,1,0,1,0,0]
=> 110100 => 001011 => 4
[1,1,1,0,0,0]
=> 111000 => 000111 => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => 01010101 => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => 00110101 => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => 01001101 => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => 00101101 => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => 00011101 => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => 01010011 => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => 00110011 => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => 01001011 => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => 00101011 => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => 00011011 => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => 01000111 => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => 00100111 => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => 00010111 => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => 00001111 => 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 0010101011 => 8
Description
The length of the longest alternating subword.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
Matching statistic: St000381
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => [1,1] => [2] => 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [4] => 4
[1,1,0,0]
=> 1100 => [2,2] => [1,2,1] => 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [6] => 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [3,2,1] => 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,2,3] => 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,4,1] => 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,2,1,1] => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [8] => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [5,2,1] => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [3,2,3] => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [3,4,1] => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [3,1,2,1,1] => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,2,5] => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,2,2,2,1] => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,4,3] => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,6,1] => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,3,2,1,1] => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,2,1,3] => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,2,3,1] => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,4,1,1] => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,2,1,1,1] => 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [1,8,1] => 8
Description
The largest part of an integer composition.
Matching statistic: St000982
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00158: Binary words —alternating inverse⟶ Binary words
St000982: Binary words ⟶ ℤResult quality: 96% ●values known / values provided: 96%●distinct values known / distinct values provided: 100%
Mp00158: Binary words —alternating inverse⟶ Binary words
St000982: Binary words ⟶ ℤResult quality: 96% ●values known / values provided: 96%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => 11 => 2
[1,0,1,0]
=> 1010 => 1111 => 4
[1,1,0,0]
=> 1100 => 1001 => 2
[1,0,1,0,1,0]
=> 101010 => 111111 => 6
[1,0,1,1,0,0]
=> 101100 => 111001 => 3
[1,1,0,0,1,0]
=> 110010 => 100111 => 3
[1,1,0,1,0,0]
=> 110100 => 100001 => 4
[1,1,1,0,0,0]
=> 111000 => 101101 => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => 11111111 => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => 11111001 => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => 11100111 => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => 11100001 => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => 11101101 => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => 10011111 => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => 10011001 => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => 10000111 => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => 10000001 => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => 10001101 => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => 10110111 => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => 10110001 => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => 10111101 => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => 10100101 => 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 1000000001 => ? = 8
Description
The length of the longest constant subword.
Matching statistic: St000534
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00223: Permutations —runsort⟶ Permutations
St000534: Permutations ⟶ ℤResult quality: 57% ●values known / values provided: 57%●distinct values known / distinct values provided: 67%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00223: Permutations —runsort⟶ Permutations
St000534: Permutations ⟶ ℤResult quality: 57% ●values known / values provided: 57%●distinct values known / distinct values provided: 67%
Values
[1,0]
=> [[1],[2]]
=> [2,1] => [1,2] => 0 = 2 - 2
[1,0,1,0]
=> [[1,3],[2,4]]
=> [2,4,1,3] => [1,3,2,4] => 2 = 4 - 2
[1,1,0,0]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,2,3,4] => 0 = 2 - 2
[1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,4,6,1,3,5] => [1,3,5,2,4,6] => 4 = 6 - 2
[1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => [1,3,4,2,5,6] => 1 = 3 - 2
[1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> [3,4,6,1,2,5] => [1,2,5,3,4,6] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => [1,2,4,3,5,6] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,2,3,4,5,6] => 0 = 2 - 2
[1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [2,4,6,8,1,3,5,7] => [1,3,5,7,2,4,6,8] => ? = 8 - 2
[1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,4,7,8,1,3,5,6] => [1,3,5,6,2,4,7,8] => ? = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> [2,5,6,8,1,3,4,7] => [1,3,4,7,2,5,6,8] => ? = 3 - 2
[1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,5,7,8,1,3,4,6] => [1,3,4,6,2,5,7,8] => ? = 4 - 2
[1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,6,7,8,1,3,4,5] => [1,3,4,5,2,6,7,8] => ? = 3 - 2
[1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> [3,4,6,8,1,2,5,7] => [1,2,5,7,3,4,6,8] => ? = 5 - 2
[1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> [3,4,7,8,1,2,5,6] => [1,2,5,6,3,4,7,8] => 0 = 2 - 2
[1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> [3,5,6,8,1,2,4,7] => [1,2,4,7,3,5,6,8] => ? = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [3,5,7,8,1,2,4,6] => [1,2,4,6,3,5,7,8] => ? = 6 - 2
[1,1,0,1,1,0,0,0]
=> [[1,2,4,5],[3,6,7,8]]
=> [3,6,7,8,1,2,4,5] => [1,2,4,5,3,6,7,8] => ? = 3 - 2
[1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> [4,5,6,8,1,2,3,7] => [1,2,3,7,4,5,6,8] => 1 = 3 - 2
[1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [4,5,7,8,1,2,3,6] => [1,2,3,6,4,5,7,8] => 1 = 3 - 2
[1,1,1,0,1,0,0,0]
=> [[1,2,3,5],[4,6,7,8]]
=> [4,6,7,8,1,2,3,5] => [1,2,3,5,4,6,7,8] => 2 = 4 - 2
[1,1,1,1,0,0,0,0]
=> [[1,2,3,4],[5,6,7,8]]
=> [5,6,7,8,1,2,3,4] => [1,2,3,4,5,6,7,8] => 0 = 2 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> [3,5,7,9,10,1,2,4,6,8] => [1,2,4,6,8,3,5,7,9,10] => ? = 8 - 2
Description
The number of 2-rises of a permutation.
A 2-rise of a permutation $\pi$ is an index $i$ such that $\pi(i)+2 = \pi(i+1)$.
For 1-rises, or successions, see [[St000441]].
Matching statistic: St000684
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 52% ●values known / values provided: 52%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 52% ●values known / values provided: 52%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 8
Description
The global dimension of the LNakayama algebra associated to a Dyck path.
An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$.
The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$.
One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0].
Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$.
Examples:
* For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192.
* For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St001232
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 48% ●values known / values provided: 48%●distinct values known / distinct values provided: 67%
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 48% ●values known / values provided: 48%●distinct values known / distinct values provided: 67%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> ? = 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> ? = 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,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]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 6
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,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]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,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
[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,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> 8
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Matching statistic: St000422
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000422: Graphs ⟶ ℤResult quality: 48% ●values known / values provided: 48%●distinct values known / distinct values provided: 67%
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000422: Graphs ⟶ ℤResult quality: 48% ●values known / values provided: 48%●distinct values known / distinct values provided: 67%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 0 = 2 - 2
[1,0,1,0]
=> [1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 2 = 4 - 2
[1,1,0,0]
=> [1,1,0,0]
=> [2] => ([],2)
=> 0 = 2 - 2
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 4 = 6 - 2
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ? = 3 - 2
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ? = 3 - 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 2 = 4 - 2
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => ([],3)
=> 0 = 2 - 2
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6 = 8 - 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 5 - 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 3 - 2
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 4 - 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ? = 3 - 2
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 5 - 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ? = 2 - 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 4 - 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 4 = 6 - 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ? = 3 - 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ? = 3 - 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ? = 3 - 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 2 = 4 - 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 0 = 2 - 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6 = 8 - 2
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.
Matching statistic: St001235
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
St001235: Integer compositions ⟶ ℤResult quality: 35% ●values known / values provided: 35%●distinct values known / distinct values provided: 67%
Mp00097: Binary words —delta morphism⟶ Integer compositions
St001235: Integer compositions ⟶ ℤResult quality: 35% ●values known / values provided: 35%●distinct values known / distinct values provided: 67%
Values
[1,0]
=> 10 => [1,1] => 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => 4
[1,1,0,0]
=> 1100 => [2,2] => 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => ? = 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => ? = 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => ? = 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => ? = 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => ? = 8
Description
The global dimension of the corresponding Comp-Nakayama algebra.
We identify the composition [n1-1,n2-1,...,nr-1] with the Nakayama algebra with Kupisch series [n1,n1-1,...,2,n2,n2-1,...,2,...,nr,nr-1,...,3,2,1]. We call such Nakayama algebras with Kupisch series corresponding to a integer composition "Comp-Nakayama algebra".
Matching statistic: St000686
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 35% ●values known / values provided: 35%●distinct values known / distinct values provided: 67%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 35% ●values known / values provided: 35%●distinct values known / distinct values provided: 67%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 8
Description
The finitistic dominant dimension of a Dyck path.
To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
The following 111 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001530The depth of a Dyck path. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001403The number of vertical separators in a permutation. St001330The hat guessing number of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000070The number of antichains in a poset. St001964The interval resolution global dimension of a poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001811The Castelnuovo-Mumford regularity of a permutation. St000401The size of the symmetry class of a permutation. St000485The length of the longest cycle of a permutation. St000638The number of up-down runs of a permutation. St000670The reversal length of a permutation. St001058The breadth of the ordered tree. St001555The order of a signed permutation. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001645The pebbling number of a connected graph. 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. St001893The flag descent of a signed permutation. St000078The number of alternating sign matrices whose left key is the permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000210Minimum over maximum difference of elements in cycles. St000255The number of reduced Kogan faces with the permutation as type. St000454The largest eigenvalue of a graph if it is integral. St000456The monochromatic index of a connected graph. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000490The intertwining number of a set partition. St000528The height of a poset. St000647The number of big descents of a permutation. St000691The number of changes of a binary word. St000742The number of big ascents of a permutation after prepending zero. St000779The tier of a permutation. St000831The number of indices that are either descents or recoils. St000847The number of standard Young tableaux whose descent set is the binary word. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. 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)$. St001246The maximal difference between two consecutive entries of a permutation. St001343The dimension of the reduced incidence algebra of a poset. St001346The number of parking functions that give the same permutation. St001375The pancake length of a permutation. St001388The number of non-attacking neighbors of a permutation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001488The number of corners of a skew partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. 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. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001686The order of promotion on a Gelfand-Tsetlin pattern. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001926Sparre Andersen's position of the maximum of a signed permutation. St001948The number of augmented double ascents of a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000058The order of a permutation. St000089The absolute variation of a composition. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000358The number of occurrences of the pattern 31-2. St000406The number of occurrences of the pattern 3241 in a permutation. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000472The sum of the ascent bottoms of a permutation. St000498The lcs statistic of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000837The number of ascents of distance 2 of a permutation. St000872The number of very big descents of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001209The pmaj statistic of a parking function. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001298The number of repeated entries in the Lehmer code of a permutation. St001377The major index minus the number of inversions of a permutation. St001402The number of separators in a permutation. St001557The number of inversions of the second entry of a permutation. St001569The maximal modular displacement of a permutation. St001668The number of points of the poset minus the width of the poset. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001684The reduced word complexity of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001703The villainy of a graph. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001856The number of edges in the reduced word graph of a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001960The number of descents of a permutation minus one if its first entry is not one.
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!