searching the database
Your data matches 4 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: St000770
St000770: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> 2
[1,1]
=> 1
[3]
=> 3
[2,1]
=> 4
[1,1,1]
=> 1
[4]
=> 4
[3,1]
=> 5
[2,2]
=> 2
[2,1,1]
=> 5
[1,1,1,1]
=> 1
[5]
=> 5
[4,1]
=> 6
[3,2]
=> 6
[3,1,1]
=> 6
[2,2,1]
=> 4
[2,1,1,1]
=> 6
[1,1,1,1,1]
=> 1
[6]
=> 6
[5,1]
=> 7
[4,2]
=> 7
[4,1,1]
=> 7
[3,3]
=> 3
[3,2,1]
=> 9
[3,1,1,1]
=> 7
[2,2,2]
=> 2
[2,2,1,1]
=> 5
[2,1,1,1,1]
=> 7
[1,1,1,1,1,1]
=> 1
[7]
=> 7
[6,1]
=> 8
[5,2]
=> 8
[5,1,1]
=> 8
[4,3]
=> 8
[4,2,1]
=> 10
[4,1,1,1]
=> 8
[3,3,1]
=> 5
[3,2,2]
=> 7
[3,2,1,1]
=> 11
[3,1,1,1,1]
=> 8
[2,2,2,1]
=> 4
[2,2,1,1,1]
=> 6
[2,1,1,1,1,1]
=> 8
[1,1,1,1,1,1,1]
=> 1
[8]
=> 8
[7,1]
=> 9
[6,2]
=> 9
[6,1,1]
=> 9
[5,3]
=> 9
[5,2,1]
=> 11
[5,1,1,1]
=> 9
Description
The major index of an integer partition when read from bottom to top.
This is the sum of the positions of the corners of the shape of an integer partition when reading from bottom to top.
For example, the partition λ=(8,6,6,4,3,3) has corners at positions 3,6,9, and 13, giving a major index of 31.
Matching statistic: St000290
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St000290: Binary words ⟶ ℤResult quality: 75% ●values known / values provided: 75%●distinct values known / distinct values provided: 91%
Mp00095: Integer partitions —to binary word⟶ Binary words
St000290: Binary words ⟶ ℤResult quality: 75% ●values known / values provided: 75%●distinct values known / distinct values provided: 91%
Values
[2]
=> [1,1]
=> 110 => 2
[1,1]
=> [2]
=> 100 => 1
[3]
=> [1,1,1]
=> 1110 => 3
[2,1]
=> [2,1]
=> 1010 => 4
[1,1,1]
=> [3]
=> 1000 => 1
[4]
=> [1,1,1,1]
=> 11110 => 4
[3,1]
=> [2,1,1]
=> 10110 => 5
[2,2]
=> [2,2]
=> 1100 => 2
[2,1,1]
=> [3,1]
=> 10010 => 5
[1,1,1,1]
=> [4]
=> 10000 => 1
[5]
=> [1,1,1,1,1]
=> 111110 => 5
[4,1]
=> [2,1,1,1]
=> 101110 => 6
[3,2]
=> [2,2,1]
=> 11010 => 6
[3,1,1]
=> [3,1,1]
=> 100110 => 6
[2,2,1]
=> [3,2]
=> 10100 => 4
[2,1,1,1]
=> [4,1]
=> 100010 => 6
[1,1,1,1,1]
=> [5]
=> 100000 => 1
[6]
=> [1,1,1,1,1,1]
=> 1111110 => 6
[5,1]
=> [2,1,1,1,1]
=> 1011110 => 7
[4,2]
=> [2,2,1,1]
=> 110110 => 7
[4,1,1]
=> [3,1,1,1]
=> 1001110 => 7
[3,3]
=> [2,2,2]
=> 11100 => 3
[3,2,1]
=> [3,2,1]
=> 101010 => 9
[3,1,1,1]
=> [4,1,1]
=> 1000110 => 7
[2,2,2]
=> [3,3]
=> 11000 => 2
[2,2,1,1]
=> [4,2]
=> 100100 => 5
[2,1,1,1,1]
=> [5,1]
=> 1000010 => 7
[1,1,1,1,1,1]
=> [6]
=> 1000000 => 1
[7]
=> [1,1,1,1,1,1,1]
=> 11111110 => 7
[6,1]
=> [2,1,1,1,1,1]
=> 10111110 => 8
[5,2]
=> [2,2,1,1,1]
=> 1101110 => 8
[5,1,1]
=> [3,1,1,1,1]
=> 10011110 => 8
[4,3]
=> [2,2,2,1]
=> 111010 => 8
[4,2,1]
=> [3,2,1,1]
=> 1010110 => 10
[4,1,1,1]
=> [4,1,1,1]
=> 10001110 => 8
[3,3,1]
=> [3,2,2]
=> 101100 => 5
[3,2,2]
=> [3,3,1]
=> 110010 => 7
[3,2,1,1]
=> [4,2,1]
=> 1001010 => 11
[3,1,1,1,1]
=> [5,1,1]
=> 10000110 => 8
[2,2,2,1]
=> [4,3]
=> 101000 => 4
[2,2,1,1,1]
=> [5,2]
=> 1000100 => 6
[2,1,1,1,1,1]
=> [6,1]
=> 10000010 => 8
[1,1,1,1,1,1,1]
=> [7]
=> 10000000 => 1
[8]
=> [1,1,1,1,1,1,1,1]
=> 111111110 => 8
[7,1]
=> [2,1,1,1,1,1,1]
=> 101111110 => 9
[6,2]
=> [2,2,1,1,1,1]
=> 11011110 => 9
[6,1,1]
=> [3,1,1,1,1,1]
=> 100111110 => 9
[5,3]
=> [2,2,2,1,1]
=> 1110110 => 9
[5,2,1]
=> [3,2,1,1,1]
=> 10101110 => 11
[5,1,1,1]
=> [4,1,1,1,1]
=> 100011110 => 9
[11]
=> [1,1,1,1,1,1,1,1,1,1,1]
=> 111111111110 => ? = 11
[10,1]
=> [2,1,1,1,1,1,1,1,1,1]
=> 101111111110 => ? = 12
[9,1,1]
=> [3,1,1,1,1,1,1,1,1]
=> 100111111110 => ? = 12
[8,1,1,1]
=> [4,1,1,1,1,1,1,1]
=> 100011111110 => ? = 12
[7,3,1]
=> [3,2,2,1,1,1,1]
=> 1011011110 => ? = 14
[7,2,2]
=> [3,3,1,1,1,1,1]
=> 1100111110 => ? = 11
[7,1,1,1,1]
=> [5,1,1,1,1,1,1]
=> 100001111110 => ? = 12
[6,3,1,1]
=> [4,2,2,1,1,1]
=> 1001101110 => ? = 15
[6,2,2,1]
=> [4,3,1,1,1,1]
=> 1010011110 => ? = 13
[6,1,1,1,1,1]
=> [6,1,1,1,1,1]
=> 100000111110 => ? = 12
[5,1,1,1,1,1,1]
=> [7,1,1,1,1]
=> 100000011110 => ? = 12
[4,3,1,1,1,1]
=> [6,2,2,1]
=> 1000011010 => ? = 17
[4,2,2,1,1,1]
=> [6,3,1,1]
=> 1000100110 => ? = 15
[4,1,1,1,1,1,1,1]
=> [8,1,1,1]
=> 100000001110 => ? = 12
[3,3,1,1,1,1,1]
=> [7,2,2]
=> 1000001100 => ? = 9
[3,2,2,1,1,1,1]
=> [7,3,1]
=> 1000010010 => ? = 16
[3,1,1,1,1,1,1,1,1]
=> [9,1,1]
=> 100000000110 => ? = 12
[2,2,2,1,1,1,1,1]
=> [8,3]
=> 1000001000 => ? = 8
[2,1,1,1,1,1,1,1,1,1]
=> [10,1]
=> 100000000010 => ? = 12
[1,1,1,1,1,1,1,1,1,1,1]
=> [11]
=> 100000000000 => ? = 1
[12]
=> [1,1,1,1,1,1,1,1,1,1,1,1]
=> 1111111111110 => ? = 12
[11,1]
=> [2,1,1,1,1,1,1,1,1,1,1]
=> 1011111111110 => ? = 13
[10,2]
=> [2,2,1,1,1,1,1,1,1,1]
=> 110111111110 => ? = 13
[10,1,1]
=> [3,1,1,1,1,1,1,1,1,1]
=> 1001111111110 => ? = 13
[9,3]
=> [2,2,2,1,1,1,1,1,1]
=> 11101111110 => ? = 13
[9,2,1]
=> [3,2,1,1,1,1,1,1,1]
=> 101011111110 => ? = 15
[9,1,1,1]
=> [4,1,1,1,1,1,1,1,1]
=> 1000111111110 => ? = 13
[8,4]
=> [2,2,2,2,1,1,1,1]
=> 1111011110 => ? = 13
[8,3,1]
=> [3,2,2,1,1,1,1,1]
=> 10110111110 => ? = 15
[8,2,2]
=> [3,3,1,1,1,1,1,1]
=> 11001111110 => ? = 12
[8,2,1,1]
=> [4,2,1,1,1,1,1,1]
=> 100101111110 => ? = 16
[8,1,1,1,1]
=> [5,1,1,1,1,1,1,1]
=> 1000011111110 => ? = 13
[7,4,1]
=> [3,2,2,2,1,1,1]
=> 1011101110 => ? = 15
[7,3,2]
=> [3,3,2,1,1,1,1]
=> 1101011110 => ? = 15
[7,3,1,1]
=> [4,2,2,1,1,1,1]
=> 10011011110 => ? = 16
[7,2,2,1]
=> [4,3,1,1,1,1,1]
=> 10100111110 => ? = 14
[7,2,1,1,1]
=> [5,2,1,1,1,1,1]
=> 100010111110 => ? = 17
[7,1,1,1,1,1]
=> [6,1,1,1,1,1,1]
=> 1000001111110 => ? = 13
[6,4,1,1]
=> [4,2,2,2,1,1]
=> 1001110110 => ? = 16
[6,3,2,1]
=> [4,3,2,1,1,1]
=> 1010101110 => ? = 18
[6,3,1,1,1]
=> [5,2,2,1,1,1]
=> 10001101110 => ? = 17
[6,2,2,2]
=> [4,4,1,1,1,1]
=> 1100011110 => ? = 11
[6,2,2,1,1]
=> [5,3,1,1,1,1]
=> 10010011110 => ? = 15
[6,2,1,1,1,1]
=> [6,2,1,1,1,1]
=> 100001011110 => ? = 18
[6,1,1,1,1,1,1]
=> [7,1,1,1,1,1]
=> 1000000111110 => ? = 13
[5,3,1,1,1,1]
=> [6,2,2,1,1]
=> 10000110110 => ? = 18
[5,2,2,1,1,1]
=> [6,3,1,1,1]
=> 10001001110 => ? = 16
[5,2,1,1,1,1,1]
=> [7,2,1,1,1]
=> 100000101110 => ? = 19
[5,1,1,1,1,1,1,1]
=> [8,1,1,1,1]
=> 1000000011110 => ? = 13
[4,4,1,1,1,1]
=> [6,2,2,2]
=> 1000011100 => ? = 9
Description
The major index of a binary word.
This is the sum of the positions of descents, i.e., a one followed by a zero.
For words of length n with a zeros, the generating function for the major index is the q-binomial coefficient \binom{n}{a}_q.
Matching statistic: St000293
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00096: Binary words —Foata bijection⟶ Binary words
St000293: Binary words ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 91%
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00096: Binary words —Foata bijection⟶ Binary words
St000293: Binary words ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 91%
Values
[2]
=> [1,1]
=> 110 => 110 => 2
[1,1]
=> [2]
=> 100 => 010 => 1
[3]
=> [1,1,1]
=> 1110 => 1110 => 3
[2,1]
=> [2,1]
=> 1010 => 1100 => 4
[1,1,1]
=> [3]
=> 1000 => 0010 => 1
[4]
=> [1,1,1,1]
=> 11110 => 11110 => 4
[3,1]
=> [2,1,1]
=> 10110 => 11010 => 5
[2,2]
=> [2,2]
=> 1100 => 0110 => 2
[2,1,1]
=> [3,1]
=> 10010 => 10100 => 5
[1,1,1,1]
=> [4]
=> 10000 => 00010 => 1
[5]
=> [1,1,1,1,1]
=> 111110 => 111110 => 5
[4,1]
=> [2,1,1,1]
=> 101110 => 110110 => 6
[3,2]
=> [2,2,1]
=> 11010 => 11100 => 6
[3,1,1]
=> [3,1,1]
=> 100110 => 101010 => 6
[2,2,1]
=> [3,2]
=> 10100 => 01100 => 4
[2,1,1,1]
=> [4,1]
=> 100010 => 100100 => 6
[1,1,1,1,1]
=> [5]
=> 100000 => 000010 => 1
[6]
=> [1,1,1,1,1,1]
=> 1111110 => 1111110 => 6
[5,1]
=> [2,1,1,1,1]
=> 1011110 => 1101110 => 7
[4,2]
=> [2,2,1,1]
=> 110110 => 111010 => 7
[4,1,1]
=> [3,1,1,1]
=> 1001110 => 1010110 => 7
[3,3]
=> [2,2,2]
=> 11100 => 01110 => 3
[3,2,1]
=> [3,2,1]
=> 101010 => 111000 => 9
[3,1,1,1]
=> [4,1,1]
=> 1000110 => 1001010 => 7
[2,2,2]
=> [3,3]
=> 11000 => 00110 => 2
[2,2,1,1]
=> [4,2]
=> 100100 => 010100 => 5
[2,1,1,1,1]
=> [5,1]
=> 1000010 => 1000100 => 7
[1,1,1,1,1,1]
=> [6]
=> 1000000 => 0000010 => 1
[7]
=> [1,1,1,1,1,1,1]
=> 11111110 => 11111110 => 7
[6,1]
=> [2,1,1,1,1,1]
=> 10111110 => 11011110 => 8
[5,2]
=> [2,2,1,1,1]
=> 1101110 => 1110110 => 8
[5,1,1]
=> [3,1,1,1,1]
=> 10011110 => 10101110 => 8
[4,3]
=> [2,2,2,1]
=> 111010 => 111100 => 8
[4,2,1]
=> [3,2,1,1]
=> 1010110 => 1110010 => 10
[4,1,1,1]
=> [4,1,1,1]
=> 10001110 => 10010110 => 8
[3,3,1]
=> [3,2,2]
=> 101100 => 011010 => 5
[3,2,2]
=> [3,3,1]
=> 110010 => 101100 => 7
[3,2,1,1]
=> [4,2,1]
=> 1001010 => 1101000 => 11
[3,1,1,1,1]
=> [5,1,1]
=> 10000110 => 10001010 => 8
[2,2,2,1]
=> [4,3]
=> 101000 => 001100 => 4
[2,2,1,1,1]
=> [5,2]
=> 1000100 => 0100100 => 6
[2,1,1,1,1,1]
=> [6,1]
=> 10000010 => 10000100 => 8
[1,1,1,1,1,1,1]
=> [7]
=> 10000000 => 00000010 => 1
[8]
=> [1,1,1,1,1,1,1,1]
=> 111111110 => 111111110 => 8
[7,1]
=> [2,1,1,1,1,1,1]
=> 101111110 => 110111110 => 9
[6,2]
=> [2,2,1,1,1,1]
=> 11011110 => 11101110 => 9
[6,1,1]
=> [3,1,1,1,1,1]
=> 100111110 => 101011110 => 9
[5,3]
=> [2,2,2,1,1]
=> 1110110 => 1111010 => 9
[5,2,1]
=> [3,2,1,1,1]
=> 10101110 => 11100110 => 11
[5,1,1,1]
=> [4,1,1,1,1]
=> 100011110 => 100101110 => 9
[11]
=> [1,1,1,1,1,1,1,1,1,1,1]
=> 111111111110 => ? => ? = 11
[10,1]
=> [2,1,1,1,1,1,1,1,1,1]
=> 101111111110 => ? => ? = 12
[9,2]
=> [2,2,1,1,1,1,1,1,1]
=> 11011111110 => 11101111110 => ? = 12
[9,1,1]
=> [3,1,1,1,1,1,1,1,1]
=> 100111111110 => ? => ? = 12
[8,3]
=> [2,2,2,1,1,1,1,1]
=> 1110111110 => 1111011110 => ? = 12
[8,2,1]
=> [3,2,1,1,1,1,1,1]
=> 10101111110 => 11100111110 => ? = 14
[8,1,1,1]
=> [4,1,1,1,1,1,1,1]
=> 100011111110 => ? => ? = 12
[7,3,1]
=> [3,2,2,1,1,1,1]
=> 1011011110 => ? => ? = 14
[7,2,2]
=> [3,3,1,1,1,1,1]
=> 1100111110 => ? => ? = 11
[7,2,1,1]
=> [4,2,1,1,1,1,1]
=> 10010111110 => 11010011110 => ? = 15
[7,1,1,1,1]
=> [5,1,1,1,1,1,1]
=> 100001111110 => ? => ? = 12
[6,3,1,1]
=> [4,2,2,1,1,1]
=> 1001101110 => ? => ? = 15
[6,2,2,1]
=> [4,3,1,1,1,1]
=> 1010011110 => ? => ? = 13
[6,2,1,1,1]
=> [5,2,1,1,1,1]
=> 10001011110 => 11001001110 => ? = 16
[6,1,1,1,1,1]
=> [6,1,1,1,1,1]
=> 100000111110 => 100001011110 => ? = 12
[5,2,1,1,1,1]
=> [6,2,1,1,1]
=> 10000101110 => 11000100110 => ? = 17
[5,1,1,1,1,1,1]
=> [7,1,1,1,1]
=> 100000011110 => ? => ? = 12
[4,3,1,1,1,1]
=> [6,2,2,1]
=> 1000011010 => ? => ? = 17
[4,2,2,1,1,1]
=> [6,3,1,1]
=> 1000100110 => ? => ? = 15
[4,2,1,1,1,1,1]
=> [7,2,1,1]
=> 10000010110 => 11000010010 => ? = 18
[4,1,1,1,1,1,1,1]
=> [8,1,1,1]
=> 100000001110 => ? => ? = 12
[3,3,1,1,1,1,1]
=> [7,2,2]
=> 1000001100 => ? => ? = 9
[3,2,2,1,1,1,1]
=> [7,3,1]
=> 1000010010 => ? => ? = 16
[3,2,1,1,1,1,1,1]
=> [8,2,1]
=> 10000001010 => 11000001000 => ? = 19
[3,1,1,1,1,1,1,1,1]
=> [9,1,1]
=> 100000000110 => ? => ? = 12
[2,2,1,1,1,1,1,1,1]
=> [9,2]
=> 10000000100 => 01000000100 => ? = 10
[2,1,1,1,1,1,1,1,1,1]
=> [10,1]
=> 100000000010 => ? => ? = 12
[1,1,1,1,1,1,1,1,1,1,1]
=> [11]
=> 100000000000 => ? => ? = 1
[12]
=> [1,1,1,1,1,1,1,1,1,1,1,1]
=> 1111111111110 => ? => ? = 12
[11,1]
=> [2,1,1,1,1,1,1,1,1,1,1]
=> 1011111111110 => ? => ? = 13
[10,2]
=> [2,2,1,1,1,1,1,1,1,1]
=> 110111111110 => 111011111110 => ? = 13
[10,1,1]
=> [3,1,1,1,1,1,1,1,1,1]
=> 1001111111110 => ? => ? = 13
[9,3]
=> [2,2,2,1,1,1,1,1,1]
=> 11101111110 => ? => ? = 13
[9,2,1]
=> [3,2,1,1,1,1,1,1,1]
=> 101011111110 => ? => ? = 15
[9,1,1,1]
=> [4,1,1,1,1,1,1,1,1]
=> 1000111111110 => ? => ? = 13
[8,4]
=> [2,2,2,2,1,1,1,1]
=> 1111011110 => 1111101110 => ? = 13
[8,3,1]
=> [3,2,2,1,1,1,1,1]
=> 10110111110 => ? => ? = 15
[8,2,2]
=> [3,3,1,1,1,1,1,1]
=> 11001111110 => 10110111110 => ? = 12
[8,2,1,1]
=> [4,2,1,1,1,1,1,1]
=> 100101111110 => ? => ? = 16
[8,1,1,1,1]
=> [5,1,1,1,1,1,1,1]
=> 1000011111110 => ? => ? = 13
[7,4,1]
=> [3,2,2,2,1,1,1]
=> 1011101110 => ? => ? = 15
[7,3,2]
=> [3,3,2,1,1,1,1]
=> 1101011110 => ? => ? = 15
[7,3,1,1]
=> [4,2,2,1,1,1,1]
=> 10011011110 => ? => ? = 16
[7,2,2,1]
=> [4,3,1,1,1,1,1]
=> 10100111110 => ? => ? = 14
[7,2,1,1,1]
=> [5,2,1,1,1,1,1]
=> 100010111110 => ? => ? = 17
[7,1,1,1,1,1]
=> [6,1,1,1,1,1,1]
=> 1000001111110 => ? => ? = 13
[6,4,1,1]
=> [4,2,2,2,1,1]
=> 1001110110 => 1101011010 => ? = 16
[6,3,2,1]
=> [4,3,2,1,1,1]
=> 1010101110 => ? => ? = 18
[6,3,1,1,1]
=> [5,2,2,1,1,1]
=> 10001101110 => ? => ? = 17
[6,2,2,2]
=> [4,4,1,1,1,1]
=> 1100011110 => 1001101110 => ? = 11
Description
The number of inversions of a binary word.
Matching statistic: St001232
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 27%
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 27%
Values
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ? = 4
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ? = 5
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ? = 5
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> ? = 6
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 6
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 6
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 4
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ? = 6
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [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
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 7
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ? = 7
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ? = 7
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 9
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ? = 7
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ? = 5
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 7
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ? = 7
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 8
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 8
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ? = 8
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 8
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ? = 10
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 8
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ? = 5
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ? = 7
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ? = 11
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> ? = 8
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 4
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> ? = 6
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 8
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0]
=> ? = 8
[7,1]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 9
[6,2]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 9
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 9
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> ? = 9
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> ? = 11
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> ? = 9
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ? = 11
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 8
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ? = 12
[4,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> ? = 9
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 6
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 6
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ? = 10
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 13
[3,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,1,0,0,0,0]
=> ? = 9
[2,2,2,2]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[2,2,2,1,1]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 5
[2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 7
[2,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 9
[1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? = 1
[3,3,3]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3
[5,5]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5
[2,2,2,2,2]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2
[4,4,4]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 4
[3,3,3,3]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 3
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
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!