Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001767
(load all 2 compositions to match this statistic)
Mapping
St001767: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 0
[2]
 => 1
[1,1]
 => 1
[3]
 => 1
[2,1]
 => 0
[1,1,1]
 => 1
[4]
 => 2
[3,1]
 => 1
[2,2]
 => 1
[2,1,1]
 => 1
[1,1,1,1]
 => 2
[5]
 => 2
[4,1]
 => 1
[3,2]
 => 1
[3,1,1]
 => 1
[2,2,1]
 => 1
[2,1,1,1]
 => 1
[1,1,1,1,1]
 => 2
[6]
 => 3
[5,1]
 => 1
[4,2]
 => 1
[4,1,1]
 => 1
[3,3]
 => 1
[3,2,1]
 => 1
[3,1,1,1]
 => 1
[2,2,2]
 => 1
[2,2,1,1]
 => 1
[2,1,1,1,1]
 => 1
[1,1,1,1,1,1]
 => 3
[7]
 => 3
[6,1]
 => 1
[5,2]
 => 1
[5,1,1]
 => 2
[4,3]
 => 1
[4,2,1]
 => 1
[4,1,1,1]
 => 1
[3,3,1]
 => 1
[3,2,2]
 => 1
[3,2,1,1]
 => 1
[3,1,1,1,1]
 => 2
[2,2,2,1]
 => 1
[2,2,1,1,1]
 => 1
[2,1,1,1,1,1]
 => 1
[1,1,1,1,1,1,1]
 => 3
[8]
 => 4
[7,1]
 => 1
[6,2]
 => 2
[6,1,1]
 => 2
[5,3]
 => 2
[5,2,1]
 => 1
Description
The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. Assign to each cell of the Ferrers diagram an arrow pointing north, east, south or west. Then compute for each cell the number of arrows pointing towards it, and take the minimum of those. This statistic is the maximal minimum that can be obtained by assigning arrows in any way.