- FindStat

Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000205

Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000205: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => [1]
 => 0
[2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => [2]
 => 0
[1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => [2,1]
 => 0
[3,1]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => [3]
 => 0
[2,2]
 => [1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => [1]
 => 0
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [3,2]
 => 1
[1,1,1,1]
 => [1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [3,2,1]
 => 2
[4,1]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => [4]
 => 0
[3,2]
 => [1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [2]
 => 0
[3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => [4,3]
 => 3
[2,2,1]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => [3,1]
 => 0
[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]
 => [5]
 => 0
[4,2]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [3]
 => 0
[3,3]
 => [1,1,1,0,1,0,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1]
 => 0
[3,2,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => [4,2]
 => 1
[2,2,2]
 => [1,1,1,1,0,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => [2,1]
 => 0
[2,2,1,1]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,1,0,1,0,0,1,0,1,0]
 => [4,3,1]
 => 5
[6,1]
 => [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]
 => [6]
 => 0
[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]
 => [4]
 => 0
[4,3]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [2]
 => 0
[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]
 => [5,3]
 => 3
[3,3,1]
 => [1,1,1,0,1,0,0,1,0,0]
 => [1,1,1,0,1,0,0,0,1,0]
 => [4,1]
 => 0
[3,2,2]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [3,2]
 => 1
[2,2,2,1]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,1,0,1,0,1,0,0,1,0]
 => [4,2,1]
 => 4
[7,1]
 => [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]
 => [7]
 => 0
[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]
 => [5]
 => 0
[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]
 => 0
[4,4]
 => [1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [1]
 => 0
[4,3,1]
 => [1,0,1,1,1,0,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0,1,0]
 => [5,2]
 => 1
[4,2,2]
 => [1,0,1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,1,0,1,0,0]
 => [4,3]
 => 3
[3,3,2]
 => [1,1,1,0,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [3,1]
 => 0
[2,2,2,2]
 => [1,1,1,1,0,1,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [3,2,1]
 => 2
[8,1]
 => [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]
 => [8]
 => 0
[7,2]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
 => [6]
 => 0
[6,3]
 => [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
 => [4]
 => 0
[5,4]
 => [1,0,1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,1,0,0,1,0,0,0,0]
 => [2]
 => 0
[4,4,1]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => [5,1]
 => 0
[4,3,2]
 => [1,0,1,1,1,0,1,1,0,0,0,0]
 => [1,1,1,1,0,0,1,0,0,1,0,0]
 => [4,2]
 => 1
[3,3,3]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [2,1]
 => 0
[8,2]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0]
 => [7]
 => 0
[7,3]
 => [1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0]
 => [5]
 => 0
[6,4]
 => [1,0,1,0,1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
 => [3]
 => 0
[5,5]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [1,1,1,1,1,0,1,0,0,0,0,0]
 => [1]
 => 0
[5,4,1]
 => [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
 => [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
 => [6,2]
 => 1
[5,3,2]
 => [1,0,1,0,1,1,1,0,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,1,0,0,1,0,0]
 => [5,3]
 => 3
[4,4,2]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => [4,1]
 => 0
[4,3,3]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,1,1,1,0,0,1,0,1,0,0,0]
 => [3,2]
 => 1
[3,3,3,1]
 => [1,1,1,1,1,0,0,0,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0,1,0]
 => [5,2,1]
 => 7
[3,3,2,2]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [4,3,1]
 => 5
[9,2]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,0]
 => [8]
 => 0

Description

Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. Given $\lambda$ count how many ''integer partitions'' $w$ (weight) there are, such that $P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.