Your data matches 135 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00252: Permutations restrictionPermutations
Mp00126: Permutations cactus evacuationPermutations
St000625: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2,3] => [1,2] => [1,2] => 2
[3,2,1] => [2,1] => [2,1] => 2
[1,2,3,4] => [1,2,3] => [1,2,3] => 3
[2,1,4,3] => [2,1,3] => [2,3,1] => 4
[2,4,1,3] => [2,1,3] => [2,3,1] => 4
[3,1,4,2] => [3,1,2] => [1,3,2] => 4
[3,4,1,2] => [3,1,2] => [1,3,2] => 4
[4,3,2,1] => [3,2,1] => [3,2,1] => 3
[1,2,3,4,5] => [1,2,3,4] => [1,2,3,4] => 4
[5,4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[1,2,3,4,5,6] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[2,1,4,3,6,5] => [2,1,4,3,5] => [2,4,1,5,3] => 7
[2,1,4,6,3,5] => [2,1,4,3,5] => [2,4,1,5,3] => 7
[2,1,5,3,6,4] => [2,1,5,3,4] => [2,3,1,5,4] => 7
[2,1,5,6,3,4] => [2,1,5,3,4] => [2,3,1,5,4] => 7
[2,4,1,3,6,5] => [2,4,1,3,5] => [2,4,5,1,3] => 7
[2,4,1,6,3,5] => [2,4,1,3,5] => [2,4,5,1,3] => 7
[2,4,6,1,3,5] => [2,4,1,3,5] => [2,4,5,1,3] => 7
[2,5,1,3,6,4] => [2,5,1,3,4] => [2,3,5,1,4] => 7
[2,5,1,6,3,4] => [2,5,1,3,4] => [2,3,5,1,4] => 7
[2,5,6,1,3,4] => [2,5,1,3,4] => [2,3,5,1,4] => 7
[3,1,4,2,6,5] => [3,1,4,2,5] => [3,4,1,5,2] => 7
[3,1,4,6,2,5] => [3,1,4,2,5] => [3,4,1,5,2] => 7
[3,1,5,2,6,4] => [3,1,5,2,4] => [1,3,2,5,4] => 7
[3,1,5,6,2,4] => [3,1,5,2,4] => [1,3,2,5,4] => 7
[3,2,1,6,5,4] => [3,2,1,5,4] => [3,2,5,4,1] => 7
[3,2,6,1,5,4] => [3,2,1,5,4] => [3,2,5,4,1] => 7
[3,2,6,5,1,4] => [3,2,5,1,4] => [3,5,2,4,1] => 7
[3,4,1,2,6,5] => [3,4,1,2,5] => [3,4,5,1,2] => 7
[3,4,1,6,2,5] => [3,4,1,2,5] => [3,4,5,1,2] => 7
[3,4,6,1,2,5] => [3,4,1,2,5] => [3,4,5,1,2] => 7
[3,5,1,2,6,4] => [3,5,1,2,4] => [1,3,5,2,4] => 7
[3,5,1,6,2,4] => [3,5,1,2,4] => [1,3,5,2,4] => 7
[3,5,6,1,2,4] => [3,5,1,2,4] => [1,3,5,2,4] => 7
[3,6,2,1,5,4] => [3,2,1,5,4] => [3,2,5,4,1] => 7
[3,6,2,5,1,4] => [3,2,5,1,4] => [3,5,2,4,1] => 7
[4,1,5,2,6,3] => [4,1,5,2,3] => [1,4,2,5,3] => 7
[4,1,5,6,2,3] => [4,1,5,2,3] => [1,4,2,5,3] => 7
[4,2,1,6,5,3] => [4,2,1,5,3] => [4,2,5,3,1] => 7
[4,2,6,1,5,3] => [4,2,1,5,3] => [4,2,5,3,1] => 7
[4,2,6,5,1,3] => [4,2,5,1,3] => [4,5,2,3,1] => 7
[4,3,1,6,5,2] => [4,3,1,5,2] => [4,1,5,3,2] => 7
[4,3,6,1,5,2] => [4,3,1,5,2] => [4,1,5,3,2] => 7
[4,3,6,5,1,2] => [4,3,5,1,2] => [4,5,1,3,2] => 7
[4,5,1,2,6,3] => [4,5,1,2,3] => [1,4,5,2,3] => 7
[4,5,1,6,2,3] => [4,5,1,2,3] => [1,4,5,2,3] => 7
[4,5,6,1,2,3] => [4,5,1,2,3] => [1,4,5,2,3] => 7
[4,6,2,1,5,3] => [4,2,1,5,3] => [4,2,5,3,1] => 7
[4,6,2,5,1,3] => [4,2,5,1,3] => [4,5,2,3,1] => 7
[4,6,3,1,5,2] => [4,3,1,5,2] => [4,1,5,3,2] => 7
Description
The sum of the minimal distances to a greater element. Set $\pi_0 = \pi_{n+1} = n+1$, then this statistic is $$ \sum_{i=1}^n \min_d(\pi_{i-d}>\pi_i\text{ or }\pi_{i+d}>\pi_i) $$ This statistic appears in [1]. The generating function for the sequence of maximal values attained on $\mathfrak S_r$, $r\geq 0$ apparently coincides with [2], which satisfies the functional equation $$ (x-1)^2 (x+1)^3 f(x^2) - (x-1)^2 (x+1) f(x) + x = 0. $$
Matching statistic: St000457
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00119: Dyck paths to 321-avoiding permutation (Krattenthaler)Permutations
St000457: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2,3] => [3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2
[3,2,1] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2
[1,2,3,4] => [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1,2,3,5] => 3
[2,1,4,3] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[2,4,1,3] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[3,1,4,2] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[3,4,1,2] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[4,3,2,1] => [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => 3
[1,2,3,4,5] => [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,1,2,3,4,6] => 4
[5,4,3,2,1] => [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,2,3,4,5] => 4
[1,2,3,4,5,6] => [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5,7] => 5
[2,1,4,3,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,4,6,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,5,3,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,5,6,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,1,3,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,1,6,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,6,1,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,1,3,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,1,6,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,6,1,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,4,2,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,4,6,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,5,2,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,5,6,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,2,1,6,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,2,6,1,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,2,6,5,1,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,4,1,2,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,4,1,6,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,4,6,1,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,1,2,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,1,6,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,6,1,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,6,2,1,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,6,2,5,1,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,1,5,2,6,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,1,5,6,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,2,1,6,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,2,6,1,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,2,6,5,1,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,1,6,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,6,1,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,6,5,1,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,5,1,2,6,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,5,1,6,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,5,6,1,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,6,2,1,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,6,2,5,1,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,6,3,1,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
Description
The number of occurrences of one of the patterns 132, 213 or 321 in a permutation. According to [1], this statistic was studied by Doron Gepner in the context of conformal field theory.
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00179: Integer partitions to skew partitionSkew partitions
Mp00185: Skew partitions cell posetPosets
St001879: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2,3] => [3]
=> [[3],[]]
=> ([(0,2),(2,1)],3)
=> 2
[3,2,1] => [1,1,1]
=> [[1,1,1],[]]
=> ([(0,2),(2,1)],3)
=> 2
[1,2,3,4] => [4]
=> [[4],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[2,1,4,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4
[2,4,1,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4
[3,1,4,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4
[3,4,1,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 4
[4,3,2,1] => [1,1,1,1]
=> [[1,1,1,1],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,2,3,4,5] => [5]
=> [[5],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
[5,4,3,2,1] => [1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
[1,2,3,4,5,6] => [6]
=> [[6],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 5
[2,1,4,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,1,4,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,1,5,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,1,5,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,4,1,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,4,1,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,4,6,1,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,5,1,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,5,1,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[2,5,6,1,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,1,4,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,1,4,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,1,5,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,1,5,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,2,1,6,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,2,6,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,2,6,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,4,1,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,4,1,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,4,6,1,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,5,1,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,5,1,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,5,6,1,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,6,2,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[3,6,2,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,1,5,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,1,5,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,2,1,6,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,2,6,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,2,6,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,3,1,6,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,3,6,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,3,6,5,1,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,5,1,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,5,1,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,5,6,1,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,6,2,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,6,2,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
[4,6,3,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7
Description
The 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.
Matching statistic: St001838
Mp00252: Permutations restrictionPermutations
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00095: Integer partitions to binary wordBinary words
St001838: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2,3] => [1,2] => [2]
=> 100 => 4 = 2 + 2
[3,2,1] => [2,1] => [1,1]
=> 110 => 4 = 2 + 2
[1,2,3,4] => [1,2,3] => [3]
=> 1000 => 5 = 3 + 2
[2,1,4,3] => [2,1,3] => [2,1]
=> 1010 => 6 = 4 + 2
[2,4,1,3] => [2,1,3] => [2,1]
=> 1010 => 6 = 4 + 2
[3,1,4,2] => [3,1,2] => [2,1]
=> 1010 => 6 = 4 + 2
[3,4,1,2] => [3,1,2] => [2,1]
=> 1010 => 6 = 4 + 2
[4,3,2,1] => [3,2,1] => [1,1,1]
=> 1110 => 5 = 3 + 2
[1,2,3,4,5] => [1,2,3,4] => [4]
=> 10000 => 6 = 4 + 2
[5,4,3,2,1] => [4,3,2,1] => [1,1,1,1]
=> 11110 => 6 = 4 + 2
[1,2,3,4,5,6] => [1,2,3,4,5] => [5]
=> 100000 => 7 = 5 + 2
[2,1,4,3,6,5] => [2,1,4,3,5] => [3,2]
=> 10100 => 9 = 7 + 2
[2,1,4,6,3,5] => [2,1,4,3,5] => [3,2]
=> 10100 => 9 = 7 + 2
[2,1,5,3,6,4] => [2,1,5,3,4] => [3,2]
=> 10100 => 9 = 7 + 2
[2,1,5,6,3,4] => [2,1,5,3,4] => [3,2]
=> 10100 => 9 = 7 + 2
[2,4,1,3,6,5] => [2,4,1,3,5] => [3,2]
=> 10100 => 9 = 7 + 2
[2,4,1,6,3,5] => [2,4,1,3,5] => [3,2]
=> 10100 => 9 = 7 + 2
[2,4,6,1,3,5] => [2,4,1,3,5] => [3,2]
=> 10100 => 9 = 7 + 2
[2,5,1,3,6,4] => [2,5,1,3,4] => [3,2]
=> 10100 => 9 = 7 + 2
[2,5,1,6,3,4] => [2,5,1,3,4] => [3,2]
=> 10100 => 9 = 7 + 2
[2,5,6,1,3,4] => [2,5,1,3,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,1,4,2,6,5] => [3,1,4,2,5] => [3,2]
=> 10100 => 9 = 7 + 2
[3,1,4,6,2,5] => [3,1,4,2,5] => [3,2]
=> 10100 => 9 = 7 + 2
[3,1,5,2,6,4] => [3,1,5,2,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,1,5,6,2,4] => [3,1,5,2,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,2,1,6,5,4] => [3,2,1,5,4] => [2,2,1]
=> 11010 => 9 = 7 + 2
[3,2,6,1,5,4] => [3,2,1,5,4] => [2,2,1]
=> 11010 => 9 = 7 + 2
[3,2,6,5,1,4] => [3,2,5,1,4] => [2,2,1]
=> 11010 => 9 = 7 + 2
[3,4,1,2,6,5] => [3,4,1,2,5] => [3,2]
=> 10100 => 9 = 7 + 2
[3,4,1,6,2,5] => [3,4,1,2,5] => [3,2]
=> 10100 => 9 = 7 + 2
[3,4,6,1,2,5] => [3,4,1,2,5] => [3,2]
=> 10100 => 9 = 7 + 2
[3,5,1,2,6,4] => [3,5,1,2,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,5,1,6,2,4] => [3,5,1,2,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,5,6,1,2,4] => [3,5,1,2,4] => [3,2]
=> 10100 => 9 = 7 + 2
[3,6,2,1,5,4] => [3,2,1,5,4] => [2,2,1]
=> 11010 => 9 = 7 + 2
[3,6,2,5,1,4] => [3,2,5,1,4] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,1,5,2,6,3] => [4,1,5,2,3] => [3,2]
=> 10100 => 9 = 7 + 2
[4,1,5,6,2,3] => [4,1,5,2,3] => [3,2]
=> 10100 => 9 = 7 + 2
[4,2,1,6,5,3] => [4,2,1,5,3] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,2,6,1,5,3] => [4,2,1,5,3] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,2,6,5,1,3] => [4,2,5,1,3] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,3,1,6,5,2] => [4,3,1,5,2] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,3,6,1,5,2] => [4,3,1,5,2] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,3,6,5,1,2] => [4,3,5,1,2] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,5,1,2,6,3] => [4,5,1,2,3] => [3,2]
=> 10100 => 9 = 7 + 2
[4,5,1,6,2,3] => [4,5,1,2,3] => [3,2]
=> 10100 => 9 = 7 + 2
[4,5,6,1,2,3] => [4,5,1,2,3] => [3,2]
=> 10100 => 9 = 7 + 2
[4,6,2,1,5,3] => [4,2,1,5,3] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,6,2,5,1,3] => [4,2,5,1,3] => [2,2,1]
=> 11010 => 9 = 7 + 2
[4,6,3,1,5,2] => [4,3,1,5,2] => [2,2,1]
=> 11010 => 9 = 7 + 2
Description
The number of nonempty primitive factors of a binary word. A word $u$ is a factor of a word $w$ if $w = p u s$ for words $p$ and $s$. A word is primitive, if it is not of the form $u^k$ for a word $u$ and an integer $k\geq 2$. Apparently, the maximal number of nonempty primitive factors a binary word of length $n$ can have is given by [[oeis:A131673]].
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00179: Integer partitions to skew partitionSkew partitions
Mp00185: Skew partitions cell posetPosets
St000104: Posets ⟶ ℤResult quality: 83% values known / values provided: 97%distinct values known / distinct values provided: 83%
Values
[1,2,3] => [3]
=> [[3],[]]
=> ([(0,2),(2,1)],3)
=> 4 = 2 + 2
[3,2,1] => [1,1,1]
=> [[1,1,1],[]]
=> ([(0,2),(2,1)],3)
=> 4 = 2 + 2
[1,2,3,4] => [4]
=> [[4],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 5 = 3 + 2
[2,1,4,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[2,4,1,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[3,1,4,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[3,4,1,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[4,3,2,1] => [1,1,1,1]
=> [[1,1,1,1],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 5 = 3 + 2
[1,2,3,4,5] => [5]
=> [[5],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6 = 4 + 2
[5,4,3,2,1] => [1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6 = 4 + 2
[1,2,3,4,5,6] => [6]
=> [[6],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 7 = 5 + 2
[2,1,4,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,4,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,5,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,5,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,1,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,1,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,6,1,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,1,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,1,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,6,1,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,4,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,4,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,5,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,5,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,1,6,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,6,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,6,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,1,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,1,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,6,1,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,1,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,1,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,6,1,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,6,2,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,6,2,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,1,5,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,1,5,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,1,6,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,6,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,6,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,1,6,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,6,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,6,5,1,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,1,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,1,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,6,1,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,2,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,2,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,3,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[1,2,3,4,5,6,7] => [7]
=> [[7],[]]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ? = 6 + 2
[7,6,5,4,3,2,1] => [1,1,1,1,1,1,1]
=> [[1,1,1,1,1,1,1],[]]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ? = 6 + 2
Description
The number of facets in the order polytope of this poset.
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00179: Integer partitions to skew partitionSkew partitions
Mp00185: Skew partitions cell posetPosets
St000151: Posets ⟶ ℤResult quality: 83% values known / values provided: 97%distinct values known / distinct values provided: 83%
Values
[1,2,3] => [3]
=> [[3],[]]
=> ([(0,2),(2,1)],3)
=> 4 = 2 + 2
[3,2,1] => [1,1,1]
=> [[1,1,1],[]]
=> ([(0,2),(2,1)],3)
=> 4 = 2 + 2
[1,2,3,4] => [4]
=> [[4],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 5 = 3 + 2
[2,1,4,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[2,4,1,3] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[3,1,4,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[3,4,1,2] => [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 4 + 2
[4,3,2,1] => [1,1,1,1]
=> [[1,1,1,1],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 5 = 3 + 2
[1,2,3,4,5] => [5]
=> [[5],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6 = 4 + 2
[5,4,3,2,1] => [1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6 = 4 + 2
[1,2,3,4,5,6] => [6]
=> [[6],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 7 = 5 + 2
[2,1,4,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,4,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,5,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,1,5,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,1,3,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,1,6,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,4,6,1,3,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,1,3,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,1,6,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[2,5,6,1,3,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,4,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,4,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,5,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,1,5,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,1,6,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,6,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,2,6,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,1,2,6,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,1,6,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,4,6,1,2,5] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,1,2,6,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,1,6,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,5,6,1,2,4] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,6,2,1,5,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[3,6,2,5,1,4] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,1,5,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,1,5,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,1,6,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,6,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,2,6,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,1,6,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,6,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,3,6,5,1,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,1,2,6,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,1,6,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,5,6,1,2,3] => [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,2,1,5,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,2,5,1,3] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[4,6,3,1,5,2] => [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 7 + 2
[1,2,3,4,5,6,7] => [7]
=> [[7],[]]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ? = 6 + 2
[7,6,5,4,3,2,1] => [1,1,1,1,1,1,1]
=> [[1,1,1,1,1,1,1],[]]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ? = 6 + 2
Description
The number of facets in the chain polytope of the poset.
Matching statistic: St000425
Mp00060: Permutations Robinson-Schensted tableau shapeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00119: Dyck paths to 321-avoiding permutation (Krattenthaler)Permutations
St000425: Permutations ⟶ ℤResult quality: 67% values known / values provided: 94%distinct values known / distinct values provided: 67%
Values
[1,2,3] => [3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2
[3,2,1] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2
[1,2,3,4] => [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1,2,3,5] => 3
[2,1,4,3] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[2,4,1,3] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[3,1,4,2] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[3,4,1,2] => [2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[4,3,2,1] => [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => 3
[1,2,3,4,5] => [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,1,2,3,4,6] => 4
[5,4,3,2,1] => [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,2,3,4,5] => 4
[1,2,3,4,5,6] => [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5,7] => ? = 5
[2,1,4,3,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,4,6,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,5,3,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,1,5,6,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,1,3,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,1,6,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,4,6,1,3,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,1,3,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,1,6,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[2,5,6,1,3,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,4,2,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,4,6,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,5,2,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,1,5,6,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,2,1,6,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,2,6,1,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,2,6,5,1,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,4,1,2,6,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,4,1,6,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,4,6,1,2,5] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,1,2,6,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,1,6,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,5,6,1,2,4] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[3,6,2,1,5,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[3,6,2,5,1,4] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,1,5,2,6,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,1,5,6,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,2,1,6,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,2,6,1,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,2,6,5,1,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,1,6,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,6,1,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,3,6,5,1,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,5,1,2,6,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,5,1,6,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,5,6,1,2,3] => [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => 7
[4,6,2,1,5,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,6,2,5,1,3] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,6,3,1,5,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[4,6,3,5,1,2] => [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 7
[6,5,4,3,2,1] => [1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,7,2,3,4,5,6] => ? = 5
[1,2,3,4,5,6,7] => [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [7,1,2,3,4,5,6,8] => ? = 6
[7,6,5,4,3,2,1] => [1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,8,2,3,4,5,6,7] => ? = 6
Description
The number of occurrences of the pattern 132 or of the pattern 213 in a permutation.
Mp00071: Permutations descent compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00183: Skew partitions inner shapeInteger partitions
St001123: Integer partitions ⟶ ℤResult quality: 17% values known / values provided: 78%distinct values known / distinct values provided: 17%
Values
[1,2,3] => [3] => [[3],[]]
=> []
=> ? = 2 - 6
[3,2,1] => [1,1,1] => [[1,1,1],[]]
=> []
=> ? = 2 - 6
[1,2,3,4] => [4] => [[4],[]]
=> []
=> ? = 3 - 6
[2,1,4,3] => [1,2,1] => [[2,2,1],[1]]
=> [1]
=> ? = 4 - 6
[2,4,1,3] => [2,2] => [[3,2],[1]]
=> [1]
=> ? = 4 - 6
[3,1,4,2] => [1,2,1] => [[2,2,1],[1]]
=> [1]
=> ? = 4 - 6
[3,4,1,2] => [2,2] => [[3,2],[1]]
=> [1]
=> ? = 4 - 6
[4,3,2,1] => [1,1,1,1] => [[1,1,1,1],[]]
=> []
=> ? = 3 - 6
[1,2,3,4,5] => [5] => [[5],[]]
=> []
=> ? = 4 - 6
[5,4,3,2,1] => [1,1,1,1,1] => [[1,1,1,1,1],[]]
=> []
=> ? = 4 - 6
[1,2,3,4,5,6] => [6] => [[6],[]]
=> []
=> ? = 5 - 6
[2,1,4,3,6,5] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[2,1,4,6,3,5] => [1,3,2] => [[4,3,1],[2]]
=> [2]
=> 1 = 7 - 6
[2,1,5,3,6,4] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[2,1,5,6,3,4] => [1,3,2] => [[4,3,1],[2]]
=> [2]
=> 1 = 7 - 6
[2,4,1,3,6,5] => [2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> 1 = 7 - 6
[2,4,1,6,3,5] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[2,4,6,1,3,5] => [3,3] => [[5,3],[2]]
=> [2]
=> 1 = 7 - 6
[2,5,1,3,6,4] => [2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> 1 = 7 - 6
[2,5,1,6,3,4] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[2,5,6,1,3,4] => [3,3] => [[5,3],[2]]
=> [2]
=> 1 = 7 - 6
[3,1,4,2,6,5] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[3,1,4,6,2,5] => [1,3,2] => [[4,3,1],[2]]
=> [2]
=> 1 = 7 - 6
[3,1,5,2,6,4] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[3,1,5,6,2,4] => [1,3,2] => [[4,3,1],[2]]
=> [2]
=> 1 = 7 - 6
[3,2,1,6,5,4] => [1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[3,2,6,1,5,4] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[3,2,6,5,1,4] => [1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[3,4,1,2,6,5] => [2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> 1 = 7 - 6
[3,4,1,6,2,5] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[3,4,6,1,2,5] => [3,3] => [[5,3],[2]]
=> [2]
=> 1 = 7 - 6
[3,5,1,2,6,4] => [2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> 1 = 7 - 6
[3,5,1,6,2,4] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[3,5,6,1,2,4] => [3,3] => [[5,3],[2]]
=> [2]
=> 1 = 7 - 6
[3,6,2,1,5,4] => [2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> 1 = 7 - 6
[3,6,2,5,1,4] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,1,5,2,6,3] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,1,5,6,2,3] => [1,3,2] => [[4,3,1],[2]]
=> [2]
=> 1 = 7 - 6
[4,2,1,6,5,3] => [1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[4,2,6,1,5,3] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,2,6,5,1,3] => [1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[4,3,1,6,5,2] => [1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[4,3,6,1,5,2] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,3,6,5,1,2] => [1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[4,5,1,2,6,3] => [2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> 1 = 7 - 6
[4,5,1,6,2,3] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,5,6,1,2,3] => [3,3] => [[5,3],[2]]
=> [2]
=> 1 = 7 - 6
[4,6,2,1,5,3] => [2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> 1 = 7 - 6
[4,6,2,5,1,3] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[4,6,3,1,5,2] => [2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> 1 = 7 - 6
[4,6,3,5,1,2] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[5,2,1,6,4,3] => [1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[5,2,6,1,4,3] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[5,2,6,4,1,3] => [1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[5,3,1,6,4,2] => [1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[5,3,6,1,4,2] => [1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[5,3,6,4,1,2] => [1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> 1 = 7 - 6
[5,6,2,1,4,3] => [2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> 1 = 7 - 6
[5,6,2,4,1,3] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[5,6,3,1,4,2] => [2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> 1 = 7 - 6
[5,6,3,4,1,2] => [2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> 1 = 7 - 6
[6,5,4,3,2,1] => [1,1,1,1,1,1] => [[1,1,1,1,1,1],[]]
=> []
=> ? = 5 - 6
[1,2,3,4,5,6,7] => [7] => [[7],[]]
=> []
=> ? = 6 - 6
[7,6,5,4,3,2,1] => [1,1,1,1,1,1,1] => [[1,1,1,1,1,1,1],[]]
=> []
=> ? = 6 - 6
Description
The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{21^{n-2}}$, for $\lambda\vdash n$.
Mp00149: Permutations Lehmer code rotationPermutations
Mp00248: Permutations DEX compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000264: Graphs ⟶ ℤResult quality: 17% values known / values provided: 62%distinct values known / distinct values provided: 17%
Values
[1,2,3] => [2,3,1] => [3] => ([],3)
=> ? = 2 - 4
[3,2,1] => [1,2,3] => [3] => ([],3)
=> ? = 2 - 4
[1,2,3,4] => [2,3,4,1] => [4] => ([],4)
=> ? = 3 - 4
[2,1,4,3] => [3,2,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 4 - 4
[2,4,1,3] => [3,1,4,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 4 - 4
[3,1,4,2] => [4,2,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 4 - 4
[3,4,1,2] => [4,1,3,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ? = 4 - 4
[4,3,2,1] => [1,2,3,4] => [4] => ([],4)
=> ? = 3 - 4
[1,2,3,4,5] => [2,3,4,5,1] => [5] => ([],5)
=> ? = 4 - 4
[5,4,3,2,1] => [1,2,3,4,5] => [5] => ([],5)
=> ? = 4 - 4
[1,2,3,4,5,6] => [2,3,4,5,6,1] => [6] => ([],6)
=> ? = 5 - 4
[2,1,4,3,6,5] => [3,2,5,4,1,6] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,1,4,6,3,5] => [3,2,5,1,6,4] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,1,5,3,6,4] => [3,2,6,4,1,5] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,1,5,6,3,4] => [3,2,6,1,5,4] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,4,1,3,6,5] => [3,5,2,4,1,6] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[2,4,1,6,3,5] => [3,5,2,1,6,4] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,4,6,1,3,5] => [3,5,1,4,6,2] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[2,5,1,3,6,4] => [3,6,2,4,1,5] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[2,5,1,6,3,4] => [3,6,2,1,5,4] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[2,5,6,1,3,4] => [3,6,1,4,5,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[3,1,4,2,6,5] => [4,2,5,3,1,6] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,1,4,6,2,5] => [4,2,5,1,6,3] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,1,5,2,6,4] => [4,2,6,3,1,5] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,1,5,6,2,4] => [4,2,6,1,5,3] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,2,1,6,5,4] => [4,3,2,1,5,6] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,2,6,1,5,4] => [4,3,1,5,2,6] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,2,6,5,1,4] => [4,3,1,2,6,5] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,4,1,2,6,5] => [4,5,2,3,1,6] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[3,4,1,6,2,5] => [4,5,2,1,6,3] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,4,6,1,2,5] => [4,5,1,3,6,2] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[3,5,1,2,6,4] => [4,6,2,3,1,5] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[3,5,1,6,2,4] => [4,6,2,1,5,3] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,5,6,1,2,4] => [4,6,1,3,5,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[3,6,2,1,5,4] => [4,1,5,3,2,6] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[3,6,2,5,1,4] => [4,1,5,2,6,3] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,1,5,2,6,3] => [5,2,6,3,1,4] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,1,5,6,2,3] => [5,2,6,1,4,3] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,2,1,6,5,3] => [5,3,2,1,4,6] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,2,6,1,5,3] => [5,3,1,4,2,6] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,2,6,5,1,3] => [5,3,1,2,6,4] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,3,1,6,5,2] => [5,4,2,1,3,6] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,3,6,1,5,2] => [5,4,1,3,2,6] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,3,6,5,1,2] => [5,4,1,2,6,3] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,5,1,2,6,3] => [5,6,2,3,1,4] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[4,5,1,6,2,3] => [5,6,2,1,4,3] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,5,6,1,2,3] => [5,6,1,3,4,2] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 7 - 4
[4,6,2,1,5,3] => [5,1,4,3,2,6] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,6,2,5,1,3] => [5,1,4,2,6,3] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,6,3,1,5,2] => [5,1,6,3,2,4] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[4,6,3,5,1,2] => [5,1,6,2,4,3] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,2,1,6,4,3] => [6,3,2,1,4,5] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,2,6,1,4,3] => [6,3,1,4,2,5] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,2,6,4,1,3] => [6,3,1,2,5,4] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,3,1,6,4,2] => [6,4,2,1,3,5] => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,3,6,1,4,2] => [6,4,1,3,2,5] => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,3,6,4,1,2] => [6,4,1,2,5,3] => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,6,2,1,4,3] => [6,1,4,3,2,5] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,6,2,4,1,3] => [6,1,4,2,5,3] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,6,3,1,4,2] => [6,1,5,3,2,4] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[5,6,3,4,1,2] => [6,1,5,2,4,3] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 7 - 4
[6,5,4,3,2,1] => [1,2,3,4,5,6] => [6] => ([],6)
=> ? = 5 - 4
[1,2,3,4,5,6,7] => [2,3,4,5,6,7,1] => [7] => ([],7)
=> ? = 6 - 4
[7,6,5,4,3,2,1] => [1,2,3,4,5,6,7] => [7] => ([],7)
=> ? = 6 - 4
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
Mp00149: Permutations Lehmer code rotationPermutations
Mp00248: Permutations DEX compositionInteger compositions
Mp00133: Integer compositions delta morphismInteger compositions
St001629: Integer compositions ⟶ ℤResult quality: 17% values known / values provided: 62%distinct values known / distinct values provided: 17%
Values
[1,2,3] => [2,3,1] => [3] => [1] => ? = 2 - 6
[3,2,1] => [1,2,3] => [3] => [1] => ? = 2 - 6
[1,2,3,4] => [2,3,4,1] => [4] => [1] => ? = 3 - 6
[2,1,4,3] => [3,2,1,4] => [2,2] => [2] => ? = 4 - 6
[2,4,1,3] => [3,1,4,2] => [2,2] => [2] => ? = 4 - 6
[3,1,4,2] => [4,2,1,3] => [2,2] => [2] => ? = 4 - 6
[3,4,1,2] => [4,1,3,2] => [3,1] => [1,1] => ? = 4 - 6
[4,3,2,1] => [1,2,3,4] => [4] => [1] => ? = 3 - 6
[1,2,3,4,5] => [2,3,4,5,1] => [5] => [1] => ? = 4 - 6
[5,4,3,2,1] => [1,2,3,4,5] => [5] => [1] => ? = 4 - 6
[1,2,3,4,5,6] => [2,3,4,5,6,1] => [6] => [1] => ? = 5 - 6
[2,1,4,3,6,5] => [3,2,5,4,1,6] => [2,2,2] => [3] => 1 = 7 - 6
[2,1,4,6,3,5] => [3,2,5,1,6,4] => [2,2,2] => [3] => 1 = 7 - 6
[2,1,5,3,6,4] => [3,2,6,4,1,5] => [2,2,2] => [3] => 1 = 7 - 6
[2,1,5,6,3,4] => [3,2,6,1,5,4] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[2,4,1,3,6,5] => [3,5,2,4,1,6] => [4,2] => [1,1] => ? = 7 - 6
[2,4,1,6,3,5] => [3,5,2,1,6,4] => [3,1,2] => [1,1,1] => 1 = 7 - 6
[2,4,6,1,3,5] => [3,5,1,4,6,2] => [4,2] => [1,1] => ? = 7 - 6
[2,5,1,3,6,4] => [3,6,2,4,1,5] => [4,2] => [1,1] => ? = 7 - 6
[2,5,1,6,3,4] => [3,6,2,1,5,4] => [3,2,1] => [1,1,1] => 1 = 7 - 6
[2,5,6,1,3,4] => [3,6,1,4,5,2] => [5,1] => [1,1] => ? = 7 - 6
[3,1,4,2,6,5] => [4,2,5,3,1,6] => [2,2,2] => [3] => 1 = 7 - 6
[3,1,4,6,2,5] => [4,2,5,1,6,3] => [2,2,2] => [3] => 1 = 7 - 6
[3,1,5,2,6,4] => [4,2,6,3,1,5] => [2,2,2] => [3] => 1 = 7 - 6
[3,1,5,6,2,4] => [4,2,6,1,5,3] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[3,2,1,6,5,4] => [4,3,2,1,5,6] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[3,2,6,1,5,4] => [4,3,1,5,2,6] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[3,2,6,5,1,4] => [4,3,1,2,6,5] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[3,4,1,2,6,5] => [4,5,2,3,1,6] => [4,2] => [1,1] => ? = 7 - 6
[3,4,1,6,2,5] => [4,5,2,1,6,3] => [3,1,2] => [1,1,1] => 1 = 7 - 6
[3,4,6,1,2,5] => [4,5,1,3,6,2] => [4,2] => [1,1] => ? = 7 - 6
[3,5,1,2,6,4] => [4,6,2,3,1,5] => [4,2] => [1,1] => ? = 7 - 6
[3,5,1,6,2,4] => [4,6,2,1,5,3] => [3,2,1] => [1,1,1] => 1 = 7 - 6
[3,5,6,1,2,4] => [4,6,1,3,5,2] => [5,1] => [1,1] => ? = 7 - 6
[3,6,2,1,5,4] => [4,1,5,3,2,6] => [2,2,2] => [3] => 1 = 7 - 6
[3,6,2,5,1,4] => [4,1,5,2,6,3] => [2,2,2] => [3] => 1 = 7 - 6
[4,1,5,2,6,3] => [5,2,6,3,1,4] => [2,2,2] => [3] => 1 = 7 - 6
[4,1,5,6,2,3] => [5,2,6,1,4,3] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[4,2,1,6,5,3] => [5,3,2,1,4,6] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[4,2,6,1,5,3] => [5,3,1,4,2,6] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[4,2,6,5,1,3] => [5,3,1,2,6,4] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[4,3,1,6,5,2] => [5,4,2,1,3,6] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[4,3,6,1,5,2] => [5,4,1,3,2,6] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[4,3,6,5,1,2] => [5,4,1,2,6,3] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[4,5,1,2,6,3] => [5,6,2,3,1,4] => [4,2] => [1,1] => ? = 7 - 6
[4,5,1,6,2,3] => [5,6,2,1,4,3] => [3,2,1] => [1,1,1] => 1 = 7 - 6
[4,5,6,1,2,3] => [5,6,1,3,4,2] => [5,1] => [1,1] => ? = 7 - 6
[4,6,2,1,5,3] => [5,1,4,3,2,6] => [2,2,2] => [3] => 1 = 7 - 6
[4,6,2,5,1,3] => [5,1,4,2,6,3] => [2,2,2] => [3] => 1 = 7 - 6
[4,6,3,1,5,2] => [5,1,6,3,2,4] => [2,2,2] => [3] => 1 = 7 - 6
[4,6,3,5,1,2] => [5,1,6,2,4,3] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[5,2,1,6,4,3] => [6,3,2,1,4,5] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[5,2,6,1,4,3] => [6,3,1,4,2,5] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[5,2,6,4,1,3] => [6,3,1,2,5,4] => [1,4,1] => [1,1,1] => 1 = 7 - 6
[5,3,1,6,4,2] => [6,4,2,1,3,5] => [1,2,3] => [1,1,1] => 1 = 7 - 6
[5,3,6,1,4,2] => [6,4,1,3,2,5] => [1,3,2] => [1,1,1] => 1 = 7 - 6
[5,3,6,4,1,2] => [6,4,1,2,5,3] => [1,4,1] => [1,1,1] => 1 = 7 - 6
[5,6,2,1,4,3] => [6,1,4,3,2,5] => [2,2,2] => [3] => 1 = 7 - 6
[5,6,2,4,1,3] => [6,1,4,2,5,3] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[5,6,3,1,4,2] => [6,1,5,3,2,4] => [2,2,2] => [3] => 1 = 7 - 6
[5,6,3,4,1,2] => [6,1,5,2,4,3] => [2,3,1] => [1,1,1] => 1 = 7 - 6
[6,5,4,3,2,1] => [1,2,3,4,5,6] => [6] => [1] => ? = 5 - 6
[1,2,3,4,5,6,7] => [2,3,4,5,6,7,1] => [7] => [1] => ? = 6 - 6
[7,6,5,4,3,2,1] => [1,2,3,4,5,6,7] => [7] => [1] => ? = 6 - 6
Description
The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles.
The following 125 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001060The distinguishing index of a graph. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000422The energy of a graph, if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000189The number of elements in the poset. St000656The number of cuts of a poset. St001717The largest size of an interval in a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001176The size of a partition minus its first part. St000912The number of maximal antichains in a poset. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000452The number of distinct eigenvalues of a graph. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000272The treewidth of a graph. St000362The size of a minimal vertex cover of a graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St001512The minimum rank of a graph. St000171The degree of the graph. St000271The chromatic index of a graph. St000636The hull number of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000918The 2-limited packing number of a graph. St001093The detour number of a graph. St001116The game chromatic number of a graph. St001286The annihilation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001580The acyclic chromatic number of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001883The mutual visibility number of a graph. St000447The number of pairs of vertices of a graph with distance 3. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000680The Grundy value for Hackendot on posets. St001645The pebbling number of a connected graph. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000299The number of nonisomorphic vertex-induced subtrees. St001875The number of simple modules with projective dimension at most 1. St000081The number of edges of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000327The number of cover relations in a poset. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001644The dimension of a graph. St001846The number of elements which do not have a complement in the lattice. St001917The order of toric promotion on the set of labellings of a graph. St001962The proper pathwidth of a graph. St001963The tree-depth of a graph. St000030The sum of the descent differences of a permutations. St000528The height of a poset. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000822The Hadwiger number of the graph. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St001330The hat guessing number of a graph. St001331The size of the minimal feedback vertex set. St001343The dimension of the reduced incidence algebra of a poset. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001651The Frankl number of a lattice. St001668The number of points of the poset minus the width of the poset. St001820The size of the image of the pop stack sorting operator. St000837The number of ascents of distance 2 of a permutation. St001350Half of the Albertson index of a graph. St001557The number of inversions of the second entry of a permutation. St001616The number of neutral elements in a lattice. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001720The minimal length of a chain of small intervals in a lattice. St001960The number of descents of a permutation minus one if its first entry is not one. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000080The rank of the poset. St001623The number of doubly irreducible elements of a lattice. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000741The Colin de Verdière graph invariant. St001391The disjunction number of a graph. St001649The length of a longest trail in a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000087The number of induced subgraphs. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000553The number of blocks of a graph. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain 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)$. St001570The minimal number of edges to add to make a graph Hamiltonian. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001828The Euler characteristic of a graph. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St001664The number of non-isomorphic subposets of a poset. St001782The order of rowmotion on the set of order ideals of a poset. St000455The second largest eigenvalue of a graph if it is integral. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001637The number of (upper) dissectors of a poset. St001834The number of non-isomorphic minors of a graph. St001618The cardinality of the Frattini sublattice of a lattice. St001812The biclique partition number of a graph. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St001313The number of Dyck paths above the lattice path given by a binary word. St000348The non-inversion sum of a binary word. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St000699The toughness times the least common multiple of 1,. St001168The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001560The product of the cardinalities of the lower order ideal and upper order ideal generated by a permutation in weak order.