searching the database
Your data matches 2 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: St000681
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000681: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000681: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],3)
=> [1,1,1]
=> [1,1]
=> 1
([],4)
=> [1,1,1,1]
=> [1,1,1]
=> 2
([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> 1
([],5)
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 3
([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> 2
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 1
([],6)
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> 4
([(4,5)],6)
=> [2,1,1,1,1]
=> [1,1,1,1]
=> 3
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> 2
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [2,1,1]
=> 3
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> 2
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> 2
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [2,2,2]
=> [2,2]
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> [4,2]
=> [2]
=> 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> 1
([(0,1),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,2]
=> [2]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> 2
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6)
=> [3,3]
=> [3]
=> 2
([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> 1
([],7)
=> [1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> 5
([(5,6)],7)
=> [2,1,1,1,1,1]
=> [1,1,1,1,1]
=> 4
([(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> 3
([(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> 2
([(2,6),(3,6),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> 1
([(3,6),(4,5)],7)
=> [2,2,1,1,1]
=> [2,1,1,1]
=> 2
([(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> 2
([(2,3),(4,6),(5,6)],7)
=> [3,2,1,1]
=> [2,1,1]
=> 3
([(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> 3
([(2,6),(3,6),(4,5),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> 1
([(1,2),(3,6),(4,6),(5,6)],7)
=> [4,2,1]
=> [2,1]
=> 0
([(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> 2
([(0,1),(2,6),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [2]
=> 1
([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> 1
([(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> 2
([(1,6),(2,6),(3,5),(4,5)],7)
=> [3,3,1]
=> [3,1]
=> 3
Description
The Grundy value of Chomp on Ferrers diagrams.
Players take turns and choose a cell of the diagram, cutting off all cells below and to the right of this cell in English notation. The player who is left with the single cell partition looses. The traditional version is played on chocolate bars, see [1].
This statistic is the Grundy value of the partition, that is, the smallest non-negative integer which does not occur as value of a partition obtained by a single move.
Matching statistic: St001232
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 39% ●values known / values provided: 39%●distinct values known / distinct values provided: 43%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 39% ●values known / values provided: 39%●distinct values known / distinct values provided: 43%
Values
([],3)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> ? = 1 + 1
([],4)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,3)],4)
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,3),(1,2)],4)
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
([],5)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ? = 3 + 1
([(3,4)],5)
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 0 + 1
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
([],6)
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4 + 1
([(4,5)],6)
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 3 + 1
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 3 + 1
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,5),(1,4),(2,3)],6)
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,3),(2,4),(3,4)],6)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
([],7)
=> [1,1,1,1,1,1,1]
=> [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]
=> ? = 5 + 1
([(5,6)],7)
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 4 + 1
([(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 3 + 1
([(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(3,6),(4,5)],7)
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,3),(4,6),(5,6)],7)
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> ? = 3 + 1
([(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 3 + 1
([(2,6),(3,6),(4,5),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,2),(3,6),(4,6),(5,6)],7)
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> ? = 0 + 1
([(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(0,1),(2,6),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(1,6),(2,6),(3,5),(4,5)],7)
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 3 + 1
([(2,6),(3,4),(3,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(0,6),(1,6),(2,6),(3,5),(4,5)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
([(2,6),(3,5),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,6),(2,5),(3,4)],7)
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 0 + 1
([(2,6),(3,5),(4,5),(4,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,2),(3,6),(4,5),(5,6)],7)
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> ? = 0 + 1
([(0,3),(1,2),(4,6),(5,6)],7)
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 2 + 1
([(2,3),(4,5),(4,6),(5,6)],7)
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> ? = 3 + 1
([(0,1),(2,6),(3,6),(4,5),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(2,5),(3,4),(3,6),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 1 + 1
([(1,2),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> ? = 0 + 1
([(0,1),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,5),(2,4),(3,4),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,3),(2,3),(4,5),(4,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,6),(3,5),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,5),(2,6),(3,5),(3,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,5),(3,4),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,3),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,5),(2,3),(2,4),(3,4),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,3),(2,6),(3,5),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,6),(1,2),(1,3),(2,3),(4,5),(4,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,5),(0,6),(1,2),(1,3),(2,3),(4,5),(4,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(0,2),(1,2),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,7),(6,7)],8)
=> [5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3 = 2 + 1
([(0,1),(2,3),(2,7),(3,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,6),(2,7),(3,5),(3,7),(4,5),(4,6),(4,7),(5,7),(6,7)],8)
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,7),(6,7)],8)
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(2,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2 = 1 + 1
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!