searching the database
Your data matches 721 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: St001934
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001934: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001934: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,1]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> [1,1]
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> [1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> [1,1,1]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> [1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> [1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> [1]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,1]
=> [1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> [1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> [2]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> [1]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [3,1]
=> [1]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,2]
=> [2]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,1,1,1,1]
=> [1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> [1,1,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> [1,1,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> [1,1]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [3,1,1]
=> [1,1]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> [1,1,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> [2,1]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> [1,1]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> [1]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,1]
=> [1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [3,1,1]
=> [1,1]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [4,1]
=> [1]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [2,2,1]
=> [2,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,1]
=> [1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> [1,1,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> [2,1]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> [2,1]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> [2]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [3,2]
=> [2]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> [1,1]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> [2]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> [1]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [4,1]
=> [1]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,2]
=> [2]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [3,1,1]
=> [1,1]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => [3,2]
=> [2]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [3,1,4,2,5] => [4,1]
=> [1]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [3,4,1,2,5] => [2,2,1]
=> [2,1]
=> 1
[1,1,1,0,1,0,0,1,0,0]
=> [3,4,1,5,2] => [3,2]
=> [2]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4] => [3,2]
=> [2]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [4,1,2,3,5] => [4,1]
=> [1]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [4,1,5,2,3] => [3,2]
=> [2]
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [2,1,1,1,1]
=> [1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [2,1,1,1,1]
=> [1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [3,1,1,1]
=> [1,1,1]
=> 1
Description
The number of monotone factorisations of genus zero of a permutation of given cycle type.
A monotone factorisation of genus zero of a permutation $\pi\in\mathfrak S_n$ with $\ell$ cycles, including fixed points, is a tuple of $r = n - \ell$ transpositions
$$
(a_1, b_1),\dots,(a_r, b_r)
$$
with $b_1 \leq \dots \leq b_r$ and $a_i < b_i$ for all $i$, whose product, in this order, is $\pi$.
For example, the cycle $(2,3,1)$ has the two factorizations $(2,3)(1,3)$ and $(1,2)(2,3)$.
Matching statistic: St001695
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001695: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001695: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [[1,2,3],[4,5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [[1,2,3,4]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [[1,2,3,4],[5]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [[1,2,3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [[1,2,3,4],[5,6,7]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [[1,2,3,4],[5,6,7],[8]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1]
=> [[1,2,3],[4,5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1]
=> [[1,2,3,4],[5,6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,2,3,4],[5,6,7,8],[9]]
=> ? = 1 - 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]
=> [4,4,2]
=> [[1,2,3,4],[5,6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10]]
=> ? = 2 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11]]
=> ? = 2 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,2,3],[4,5,6],[7,8,9],[10]]
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,4],[5,6,7],[8,9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,3,4],[5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,3],[4,5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,2,3],[4,5,6],[7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,3,4],[5,6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,2,3,4],[5,6],[7,8],[9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [5,4,1]
=> [[1,2,3,4,5],[6,7,8,9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,3,4,5],[6,7,8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10],[11]]
=> ? = 2 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12]]
=> ? = 2 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,4,5],[6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,4],[5,6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,3],[4,5,6],[7,8,9],[10,11]]
=> ? = 1 - 1
Description
The natural comajor index of a standard Young tableau.
A natural descent of a standard tableau $T$ is an entry $i$ such that $i+1$ appears in a higher row than $i$ in English notation.
The natural comajor index of a tableau of size $n$ with natural descent set $D$ is then $\sum_{d\in D} n-d$.
Matching statistic: St001698
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001698: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001698: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [[1,2,3],[4,5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [[1,2,3,4]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [[1,2,3,4],[5]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [[1,2,3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [[1,2,3,4],[5,6,7]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [[1,2,3,4],[5,6,7],[8]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1]
=> [[1,2,3],[4,5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1]
=> [[1,2,3,4],[5,6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,2,3,4],[5,6,7,8],[9]]
=> ? = 1 - 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]
=> [4,4,2]
=> [[1,2,3,4],[5,6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10]]
=> ? = 2 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11]]
=> ? = 2 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,2,3],[4,5,6],[7,8,9],[10]]
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,4],[5,6,7],[8,9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,3,4],[5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,3],[4,5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,2,3],[4,5,6],[7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,3,4],[5,6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,2,3,4],[5,6],[7,8],[9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [5,4,1]
=> [[1,2,3,4,5],[6,7,8,9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,3,4,5],[6,7,8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10],[11]]
=> ? = 2 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12]]
=> ? = 2 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,4,5],[6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,4],[5,6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,3],[4,5,6],[7,8,9],[10,11]]
=> ? = 1 - 1
Description
The comajor index of a standard tableau minus the weighted size of its shape.
Matching statistic: St001699
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St001699: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St001699: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> [[1,3],[2]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> [[1,3,4],[2]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> [[1,2,5],[3,4]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [[1,3],[2,5],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [[1,3],[2]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [[1,3,4],[2]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [[1,4],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [[1,2,5],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,4,5],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [[1,3],[2,5],[4]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [[1,2,3,4]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [[1,3,4,5],[2]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,5,6],[3,4]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [[1,4,5,6],[2],[3]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [[1,2,3,7],[4,5,6]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [[1,3,4,8],[2,6,7],[5]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,7,8],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,5],[3,4,8],[6,7]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,4,5],[2,7,8],[3],[6]]
=> 0 = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [[1,3,8],[2,5],[4,7],[6]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [[1,2,5,9],[3,4,8],[6,7]]
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,3,8,9],[2,5],[4,7],[6]]
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [2,1]
=> [[1,3],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> [[1,3,4],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,1,1]
=> [[1,4],[2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,2]
=> [[1,2,5],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,3,2]
=> [[1,2,5,9],[3,4,8],[6,7]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,4,5,9],[2,7,8],[3],[6]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,3,8,9],[2,5],[4,7],[6]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1]
=> [[1,3,6],[2,5,9],[4,8],[7]]
=> ? = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1]
=> [[1,3,6,10],[2,5,9],[4,8],[7]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,3,4,8,9],[2,6,7],[5]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,7,8,9],[3,4],[5,6]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1]
=> [[1,4,7,8,9],[2,6],[3],[5]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,5,9,10],[3,4,8],[6,7]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,4,5,9,10],[2,7,8],[3],[6]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1]
=> [[1,3,8,9,10],[2,5],[4,7],[6]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1]
=> [[1,3,6,10,11],[2,5,9],[4,8],[7]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,3,4,5],[2,7,8,9],[6]]
=> ? = 1 - 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]
=> [4,4,2]
=> [[1,2,5,6],[3,4,9,10],[7,8]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,4,5,6],[2,8,9,10],[3],[7]]
=> ? = 2 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,3,6,7],[2,5,10,11],[4,9],[8]]
=> ? = 2 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,3,4],[2,6,7],[5,9,10],[8]]
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,9],[3,4],[5,6],[7,8]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,10],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,3,4,11],[2,6,7],[5,9,10],[8]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,9,10],[3,4],[5,6],[7,8]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,7],[3,4,10],[5,6],[8,9]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,5,6],[2,8,9],[3],[4],[7]]
=> ? = 2 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,4,9],[2,6],[3,8],[5],[7]]
=> ? = 2 - 1
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,7,11],[3,4,10],[5,6],[8,9]]
=> ? = 1 - 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,4,9,10],[2,6],[3,8],[5],[7]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [5,4]
=> [[1,2,3,4,9],[5,6,7,8]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [5,4,1]
=> [[1,3,4,5,10],[2,7,8,9],[6]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,5,6,11],[3,4,9,10],[7,8]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1]
=> [[1,4,5,6,11],[2,8,9,10],[3],[7]]
=> ? = 2 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1]
=> [[1,3,6,7,12],[2,5,10,11],[4,9],[8]]
=> ? = 2 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,10,11],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,3,4,11,12],[2,6,7],[5,9,10],[8]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,9,10,11],[3,4],[5,6],[7,8]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,7,11,12],[3,4,10],[5,6],[8,9]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,4,9,10,11],[2,6],[3,8],[5],[7]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,7],[4,5,6,11],[8,9,10]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,3,4,8],[2,6,7,12],[5,10,11],[9]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,7,8],[3,4,11,12],[5,6],[9,10]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,5,6,7],[2,9,10,11],[3],[4],[8]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,4,7,8],[2,6,11,12],[3,10],[5],[9]]
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,5],[3,4,8],[6,7,11],[9,10]]
=> ? = 1 - 1
Description
The major index of a standard tableau minus the weighted size of its shape.
Matching statistic: St001712
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001712: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001712: Standard tableaux ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [[1,2,3],[4,5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [[1,2,3,4]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [[1,2,3,4],[5]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [[1,2,3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [[1,2,3,4],[5,6,7]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [[1,2,3,4],[5,6,7],[8]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> []
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> [[1]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> [[1,2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1]
=> [[1],[2]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [2,1]
=> [[1,2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> [[1,2,3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> [[1,2,3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1]
=> [[1],[2],[3]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [2,1,1]
=> [[1,2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1]
=> [[1,2,3],[4,5,6],[7,8],[9]]
=> ? = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1]
=> [[1,2,3,4],[5,6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,2,3,4],[5,6,7,8],[9]]
=> ? = 1 - 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]
=> [4,4,2]
=> [[1,2,3,4],[5,6,7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10]]
=> ? = 2 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11]]
=> ? = 2 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> ? = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,2,3],[4,5,6],[7,8,9],[10]]
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,4],[5,6,7],[8,9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,3,4],[5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,3],[4,5,6],[7,8],[9,10]]
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,2,3],[4,5,6],[7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9]]
=> ? = 2 - 1
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,3,4],[5,6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,2,3,4],[5,6],[7,8],[9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [5,4,1]
=> [[1,2,3,4,5],[6,7,8,9],[10]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,3,4,5],[6,7,8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10],[11]]
=> ? = 2 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12]]
=> ? = 2 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,4,5],[6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,4],[5,6,7,8],[9,10,11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11],[12]]
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,3],[4,5,6],[7,8,9],[10,11]]
=> ? = 1 - 1
Description
The number of natural descents of a standard Young tableau.
A natural descent of a standard tableau $T$ is an entry $i$ such that $i+1$ appears in a higher row than $i$ in English notation.
Matching statistic: St000455
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000455: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 14%
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000455: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [2,1] => [1,2] => ([],2)
=> ? = 1 - 1
[1,0,1,0,1,0]
=> [3,2,1] => [1,2,3] => ([],3)
=> ? = 1 - 1
[1,0,1,1,0,0]
=> [2,3,1] => [3,1,2] => ([(0,2),(1,2)],3)
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [3,1,2] => [1,3,2] => ([(1,2)],3)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [1,2,3,4] => ([],4)
=> ? = 1 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [1,2,4,3] => ([(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 1 - 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [1,2,3,4,5] => ([],5)
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [5,1,4,2,3] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [1,5,4,2,3] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [1,2,3,5,4] => ([(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [5,1,2,4,3] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [1,5,2,4,3] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [1,4,5,3,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => [5,1,3,4,2] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [2,3,1,4,5] => [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => [1,2,3,4,5,6] => ([],6)
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,2,1] => [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,1] => [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => [6,5,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,2,1] => [5,6,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,2,1] => [1,2,6,3,4,5] => ([(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => [6,1,5,2,3,4] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => [1,6,5,2,3,4] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,2,1] => [6,5,4,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,2,1] => [5,6,4,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,2,1] => [1,5,6,2,3,4] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,1,0,0]
=> [5,3,4,6,2,1] => [6,4,5,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> [4,3,5,6,2,1] => [5,4,6,1,2,3] => ([(0,1),(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,1] => [1,2,3,6,4,5] => ([(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => [6,1,2,5,3,4] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => [1,6,2,5,3,4] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,6,2,3,1] => [6,5,1,4,2,3] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,5,6,2,3,1] => [5,6,1,4,2,3] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => [1,2,6,5,3,4] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,6,3,2,4,1] => [6,1,5,4,2,3] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,5,1] => [1,6,5,4,2,3] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,6,1] => [6,5,4,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [4,5,3,2,6,1] => [5,6,4,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,4,2,5,1] => [1,5,6,4,2,3] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [5,3,4,2,6,1] => [6,4,5,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [4,3,5,2,6,1] => [5,4,6,3,1,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [3,4,5,2,6,1] => [4,5,6,3,1,2] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => [1,2,5,6,3,4] => ([(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => [6,1,4,5,2,3] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [6,4,2,3,5,1] => [1,6,4,5,2,3] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [5,4,2,3,6,1] => [6,5,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [4,5,2,3,6,1] => [5,6,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [6,3,2,4,5,1] => [1,5,4,6,2,3] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [5,3,2,4,6,1] => [6,4,3,5,1,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,0,1,0,1,0,0,0]
=> [4,3,2,5,6,1] => [5,4,3,6,1,2] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,6,1] => [4,5,3,6,1,2] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [4,2,3,5,6,1] => [5,3,4,6,1,2] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [3,2,4,5,6,1] => [4,3,5,6,1,2] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,1,2] => [6,1,2,3,5,4] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,1,2] => [1,6,2,3,5,4] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,1,2] => [6,5,1,2,4,3] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,1,2] => [5,6,1,2,4,3] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,1,2] => [1,2,6,3,5,4] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,1,2] => [6,1,5,2,4,3] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,1,2] => [1,6,5,2,4,3] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,1,2] => [6,5,4,1,3,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,1,2] => [5,6,4,1,3,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,1,2] => [1,5,6,2,4,3] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [5,3,4,6,1,2] => [6,4,5,1,3,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [4,3,5,6,1,2] => [5,4,6,1,3,2] => ([(0,1),(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,1,2] => [4,5,6,1,3,2] => ([(0,1),(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,1,3] => [6,1,2,5,4,3] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,1,3] => [1,6,2,5,4,3] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 - 1
Description
The second largest eigenvalue of a graph if it is integral.
This statistic is undefined if the second largest eigenvalue of the graph is not integral.
Chapter 4 of [1] provides lots of context.
Matching statistic: St000298
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000298: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000298: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ([],4)
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ([(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ([],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> ([(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ([(0,5),(1,5),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> ([(3,5),(4,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ([(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(2,3),(2,4),(4,5)],6)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> ([(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(4,5)],6)
=> 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> ([(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[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,1,0,1,0,0,0,0]
=> ([(1,5),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ([(1,5),(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(5,3)],6)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> ([(2,3),(2,4),(2,5)],6)
=> 2 = 1 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([],7)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ([(5,6)],7)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6)],7)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(6,4)],7)
=> ? = 1 + 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> ([(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(5,6)],7)
=> ? = 1 + 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(4,6),(5,6)],7)
=> ? = 1 + 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(3,5),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 2 + 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4)],7)
=> ? = 2 + 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,6),(2,3),(2,4),(2,6),(4,5)],7)
=> ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1 + 1
[1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> ([(0,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(6,3)],7)
=> ? = 1 + 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1 + 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(4,6)],7)
=> ? = 1 + 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(3,6),(4,6)],7)
=> ? = 2 + 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,5),(1,6),(2,3),(2,4),(6,3),(6,4)],7)
=> ? = 2 + 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(3,5),(3,6),(4,5),(4,6)],7)
=> ? = 1 + 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2 + 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2 + 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,5),(1,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
=> ([(0,2),(0,3),(0,5),(0,6),(1,4),(1,5),(1,6),(3,4)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,0]
=> ([(0,2),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 2 + 1
[1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(2,6),(3,6),(4,5),(4,6)],7)
=> ? = 1 + 1
[1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,6),(2,5),(3,4),(3,6),(6,5)],7)
=> ? = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> ([(0,2),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(5,3),(6,3)],7)
=> ? = 1 + 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 + 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> ([(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 + 1
[1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6)],7)
=> ? = 2 + 1
[1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,6),(4,6),(5,6)],7)
=> ? = 2 + 1
[1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(2,6),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,6),(1,2),(1,3),(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> ? = 2 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> ? = 1 + 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ([(6,7)],8)
=> ? = 1 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ([(0,7),(1,7),(2,7),(3,7),(4,7),(5,6),(5,7)],8)
=> ? = 1 + 1
Description
The order dimension or Dushnik-Miller dimension of a poset.
This is the minimal number of linear orderings whose intersection is the given poset.
Matching statistic: St000667
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000667: Integer partitions ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000667: Integer partitions ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [2,1,1,1,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1,1]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [3,2,1,1,1]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1,1]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1,1]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2,1]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [2,1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [3,1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> [2,2,1,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [5,3,2,1,1,1]
=> ? = 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,1,0,0,0]
=> [4,4,2,1,1,1]
=> ? = 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,1,0,0,0]
=> [4,3,3,1,1,1]
=> ? = 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> [4,3,2,2,1,1]
=> ? = 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,0]
=> [5,4,1,1,1,1]
=> ? = 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [5,4,2,1,1,1]
=> ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,1,0,0]
=> [5,3,3,1,1,1]
=> ? = 1
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,1,0,0]
=> [5,2,2,2,1,1]
=> ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,1,0,0]
=> [5,3,2,2,1,1]
=> ? = 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,1,0,0,0]
=> [4,4,3,1,1,1]
=> ? = 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,1,0,0,0]
=> [4,4,2,2,1,1]
=> ? = 1
[1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,1,0,0,0,0]
=> [3,3,3,2,1,1]
=> ? = 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,1,0,0,0]
=> [4,3,3,2,1,1]
=> ? = 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [5,4,3,1,1,1]
=> ? = 1
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,1,0,0]
=> [5,4,2,2,1,1]
=> ? = 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,1,0,0]
=> [5,3,3,2,1,1]
=> ? = 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,1,0,0,0]
=> [4,4,3,2,1,1]
=> ? = 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,1,1]
=> ? = 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,1,1,1]
=> ? = 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0,1,0]
=> [6,2,2,1,1,1]
=> ? = 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0,1,0]
=> [6,3,2,1,1,1]
=> ? = 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,1,1,1]
=> ? = 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0,1,0]
=> [6,4,2,1,1,1]
=> ? = 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,3,1,1,1]
=> ? = 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,1,1]
=> ? = 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,1,1]
=> ? = 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,1,1]
=> ? = 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1,1]
=> ? = 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,1,1]
=> ? = 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,1,1]
=> ? = 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [5,5,1,1,1,1]
=> ? = 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,1,0,0]
=> [5,5,2,1,1,1]
=> ? = 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,1,0,0]
=> [5,5,3,1,1,1]
=> ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,1,0,0]
=> [5,5,2,2,1,1]
=> ? = 2
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,1,1]
=> ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [4,4,4,1,1,1]
=> ? = 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,1,0,0,0]
=> [4,4,4,2,1,1]
=> ? = 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [3,3,3,3,1,1]
=> ? = 1
[1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,0,1,0,0,0]
=> [4,3,3,3,1,1]
=> ? = 1
[1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,3,2,2,2,1]
=> ? = 1
[1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,1,0,0]
=> [5,4,4,1,1,1]
=> ? = 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,1,1]
=> ? = 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,1,0,0]
=> [5,3,3,3,1,1]
=> ? = 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,1,0,0,0]
=> [4,4,3,3,1,1]
=> ? = 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> [4,4,2,2,2,1]
=> ? = 2
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,1,0,0,0]
=> [4,3,3,2,2,1]
=> ? = 2
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,3,1,1]
=> ? = 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,1,0,0]
=> [5,3,3,2,2,1]
=> ? = 1
[1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,1,1,1]
=> ? = 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0,1,0]
=> [6,5,2,1,1,1]
=> ? = 1
Description
The greatest common divisor of the parts of the partition.
Matching statistic: St000717
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000717: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000717: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ([],4)
=> 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ([(1,4),(2,3),(2,4)],5)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ([],6)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> ([(4,5)],6)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ([(0,5),(1,5),(2,5),(3,4),(3,5)],6)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> ([(3,5),(4,5)],6)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ([(2,5),(3,4),(3,5)],6)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(2,3),(2,4),(4,5)],6)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> ([(3,4),(3,5)],6)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(4,5)],6)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> ([(2,5),(3,5),(4,5)],6)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
[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,1,0,1,0,0,0,0]
=> ([(1,5),(2,5),(3,4),(3,5)],6)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(3,4),(3,5)],6)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ([(1,5),(2,3),(2,4),(2,5)],6)
=> 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(5,3)],6)
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> ([(2,3),(2,4),(2,5)],6)
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(3,5),(4,5)],6)
=> 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([],7)
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ([(5,6)],7)
=> 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6)],7)
=> 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(6,4)],7)
=> ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> ([(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(5,6)],7)
=> ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(4,6),(5,6)],7)
=> ? = 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1
[1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(3,5),(3,6),(4,6)],7)
=> ? = 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 2
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4)],7)
=> ? = 2
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,6),(2,3),(2,4),(2,6),(4,5)],7)
=> ? = 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1
[1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> ([(0,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(6,3)],7)
=> ? = 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(4,6)],7)
=> ? = 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(3,6),(4,6)],7)
=> ? = 2
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,5),(1,6),(2,3),(2,4),(6,3),(6,4)],7)
=> ? = 2
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(3,5),(3,6),(4,5),(4,6)],7)
=> ? = 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,5),(1,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
=> ([(0,2),(0,3),(0,5),(0,6),(1,4),(1,5),(1,6),(3,4)],7)
=> ? = 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,0]
=> ([(0,2),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3)],7)
=> ? = 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 2
[1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(2,6),(3,6),(4,5),(4,6)],7)
=> ? = 1
[1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,6),(2,5),(3,4),(3,6),(6,5)],7)
=> ? = 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> ([(0,2),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(5,3),(6,3)],7)
=> ? = 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> ([(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1
[1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6)],7)
=> ? = 2
[1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,6),(4,6),(5,6)],7)
=> ? = 2
[1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(2,6),(3,6),(4,6)],7)
=> ? = 1
[1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,6),(1,2),(1,3),(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> ? = 2
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ([],8)
=> ? = 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> ? = 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ([(6,7)],8)
=> ? = 1
Description
The number of ordinal summands of a poset.
The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$.
This statistic is the length of the longest ordinal decomposition of a poset.
Matching statistic: St000281
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000281: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000281: Posets ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 14%
Values
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ([],4)
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ([(1,4),(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ([],6)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> ([(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ([(0,5),(1,5),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> ([(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ([(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(2,3),(2,4),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> ([(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(3,5)],6)
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,5),(3,4)],6)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> ([(2,5),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[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,1,0,1,0,0,0,0]
=> ([(1,5),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> ([(0,5),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ([(1,5),(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0 = 1 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(5,3)],6)
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> ([(2,3),(2,4),(2,5)],6)
=> 0 = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(1,2),(1,3),(1,4),(3,5),(4,5)],6)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([],7)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ([(5,6)],7)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6)],7)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(6,4)],7)
=> ? = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> ([(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(5,6)],7)
=> ? = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(4,6),(5,6)],7)
=> ? = 1 - 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(2,3),(2,4),(3,5),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 2 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4)],7)
=> ? = 2 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,6),(2,3),(2,4),(2,6),(4,5)],7)
=> ? = 1 - 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> ([(0,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(6,3)],7)
=> ? = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(3,6)],7)
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(4,6)],7)
=> ? = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(3,6),(4,6)],7)
=> ? = 2 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,5),(1,6),(2,3),(2,4),(6,3),(6,4)],7)
=> ? = 2 - 1
[1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(3,5),(3,6),(4,5),(4,6)],7)
=> ? = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> ([(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 2 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> ([(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,5),(1,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,1,0,0,0]
=> ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
=> ([(0,2),(0,3),(0,5),(0,6),(1,4),(1,5),(1,6),(3,4)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,0]
=> ([(0,2),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 2 - 1
[1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(2,6),(3,6),(4,5),(4,6)],7)
=> ? = 1 - 1
[1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(1,4),(1,6),(2,5),(3,4),(3,6),(6,5)],7)
=> ? = 1 - 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> ([(0,2),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(5,3),(6,3)],7)
=> ? = 1 - 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7)
=> ? = 1 - 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> ([(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> ([(1,5),(1,6),(2,3),(2,4),(2,5),(2,6)],7)
=> ? = 1 - 1
[1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6)],7)
=> ? = 2 - 1
[1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,6),(4,6),(5,6)],7)
=> ? = 2 - 1
[1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(2,6),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(2,5),(2,6),(3,5),(3,6),(4,6)],7)
=> ? = 1 - 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(0,6),(1,2),(1,3),(2,5),(2,6),(3,4),(3,6),(4,5)],7)
=> ? = 2 - 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ([],8)
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ([(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> ? = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ([(6,7)],8)
=> ? = 1 - 1
Description
The size of the preimage of the map 'to poset' from Binary trees to Posets.
The following 711 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000487The length of the shortest cycle of a permutation. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000990The first ascent of a permutation. St001468The smallest fixpoint of a permutation. St000210Minimum over maximum difference of elements in cycles. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000623The number of occurrences of the pattern 52341 in a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001728The number of invisible descents of a permutation. St000478Another weight of a partition according to Alladi. St001260The permanent of an alternating sign matrix. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000750The number of occurrences of the pattern 4213 in a permutation. St001513The number of nested exceedences of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St001715The number of non-records in a permutation. St001741The largest integer such that all patterns of this size are contained in the permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001866The nesting alignments of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St000022The number of fixed points of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000234The number of global ascents of a permutation. St000993The multiplicity of the largest part of an integer partition. St000929The constant term of the character polynomial of an integer partition. St001162The minimum jump of a permutation. St001344The neighbouring number of a permutation. St000358The number of occurrences of the pattern 31-2. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000732The number of double deficiencies of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000989The number of final rises of a permutation. St001381The fertility of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001095The number of non-isomorphic posets with precisely one further covering relation. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000407The number of occurrences of the pattern 2143 in a permutation. St000842The breadth of a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000054The first entry of the permutation. St000374The number of exclusive right-to-left minima of a permutation. St001665The number of pure excedances of a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000451The length of the longest pattern of the form k 1 2. St000788The number of nesting-similar perfect matchings of a perfect matching. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St000754The Grundy value for the game of removing nestings in a perfect matching. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000078The number of alternating sign matrices whose left key is the permutation. St000297The number of leading ones in a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000876The number of factors in the Catalan decomposition of a binary word. St000042The number of crossings of a perfect matching. St000296The length of the symmetric border of a binary word. St000733The row containing the largest entry of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000877The depth of the binary word interpreted as a path. St000878The number of ones minus the number of zeros of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St001047The maximal number of arcs crossing a given arc of a perfect matching. St000787The number of flips required to make a perfect matching noncrossing. St000546The number of global descents of a permutation. St000666The number of right tethers of a permutation. St000779The tier of a permutation. St001394The genus of a permutation. St001570The minimal number of edges to add to make a graph Hamiltonian. St000264The girth of a graph, which is not a tree. St000031The number of cycles in the cycle decomposition of a permutation. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St000669The number of permutations obtained by switching ascents or descents of size 2. St000996The number of exclusive left-to-right maxima of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000002The number of occurrences of the pattern 123 in a permutation. St000035The number of left outer peaks of a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000441The number of successions of a permutation. St000534The number of 2-rises of a permutation. St000665The number of rafts of a permutation. St000731The number of double exceedences of a permutation. St000738The first entry in the last row of a standard tableau. St000862The number of parts of the shifted shape of a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000007The number of saliances of the permutation. St000237The number of small exceedances. St000352The Elizalde-Pak rank of a permutation. St000675The number of centered multitunnels of a Dyck path. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St000486The number of cycles of length at least 3 of a permutation. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000962The 3-shifted major index of a permutation. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001330The hat guessing number of a graph. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000124The cardinality of the preimage of the Simion-Schmidt map. St000322The skewness of a graph. St001845The number of join irreducibles minus the rank of a lattice. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000627The exponent of a binary word. St000255The number of reduced Kogan faces with the permutation as type. St000065The number of entries equal to -1 in an alternating sign matrix. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St001947The number of ties in a parking function. St001536The number of cyclic misalignments of a permutation. St000069The number of maximal elements of a poset. St001130The number of two successive successions in a permutation. St000068The number of minimal elements in a poset. St000181The number of connected components of the Hasse diagram for the poset. St000633The size of the automorphism group of a poset. St001399The distinguishing number of a poset. St001964The interval resolution global dimension of a poset. St001568The smallest positive integer that does not appear twice in the partition. St000664The number of right ropes of a permutation. St001434The number of negative sum pairs of a signed permutation. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001850The number of Hecke atoms of a permutation. St001890The maximum magnitude of the Möbius function of a poset. St000485The length of the longest cycle of a permutation. St000701The protection number of a binary tree. St000145The Dyson rank of a partition. St000629The defect of a binary word. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000843The decomposition number of a perfect matching. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001393The induced matching number of a graph. St001496The number of graphs with the same Laplacian spectrum as the given graph. St000445The number of rises of length 1 of a Dyck path. St000516The number of stretching pairs of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000803The number of occurrences of the vincular pattern |132 in a permutation. St001261The Castelnuovo-Mumford regularity of a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St000056The decomposition (or block) number of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001256Number of simple reflexive modules that are 2-stable reflexive. St001461The number of topologically connected components of the chord diagram of a permutation. St001590The crossing number of a perfect matching. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St000061The number of nodes on the left branch of a binary tree. St000084The number of subtrees. St000096The number of spanning trees of a graph. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000287The number of connected components of a graph. St000310The minimal degree of a vertex of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000570The Edelman-Greene number of a permutation. St000654The first descent of a permutation. St000740The last entry of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000873The aix statistic of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000958The number of Bruhat factorizations of a permutation. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000991The number of right-to-left minima of a permutation. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001048The number of leaves in the subtree containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001081The number of minimal length factorizations of a permutation into star transpositions. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001481The minimal height of a peak of a Dyck path. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001828The Euler characteristic of a graph. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000051The size of the left subtree of a binary tree. St000062The length of the longest increasing subsequence of the permutation. St000095The number of triangles of a graph. St000117The number of centered tunnels of a Dyck path. St000133The "bounce" of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000295The length of the border of a binary word. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000308The height of the tree associated to a permutation. St000315The number of isolated vertices of a graph. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000357The number of occurrences of the pattern 12-3. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000461The rix statistic of a permutation. St000488The number of cycles of a permutation of length at most 2. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000650The number of 3-rises of a permutation. St000674The number of hills of a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000822The Hadwiger number of the graph. St000879The number of long braid edges in the graph of braid moves of a permutation. St000895The number of ones on the main diagonal of an alternating sign matrix. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001049The smallest label in the subtree not containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001411The number of patterns 321 or 3412 in a permutation. St001429The number of negative entries in a signed permutation. St001471The magnitude of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001520The number of strict 3-descents. St001530The depth of a Dyck path. St001557The number of inversions of the second entry of a permutation. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001705The number of occurrences of the pattern 2413 in a permutation. St001831The multiplicity of the non-nesting perfect matching in the chord expansion of a perfect matching. St001835The number of occurrences of a 231 pattern in the restricted growth word of a perfect matching. St001856The number of edges in the reduced word graph of a permutation. St001871The number of triconnected components of a graph. St001948The number of augmented double ascents of a permutation. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000037The sign of a permutation. St000079The number of alternating sign matrices for a given Dyck path. St000080The rank of the poset. St000092The number of outer peaks of a permutation. St000093The cardinality of a maximal independent set of vertices of a graph. St000099The number of valleys of a permutation, including the boundary. St000115The single entry in the last row. St000120The number of left tunnels of a Dyck path. St000154The sum of the descent bottoms of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000272The treewidth of a graph. St000273The domination number of a graph. St000286The number of connected components of the complement of a graph. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000349The number of different adjacency matrices of a graph. St000353The number of inner valleys of a permutation. St000382The first part of an integer composition. St000387The matching number of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000392The length of the longest run of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000456The monochromatic index of a connected graph. St000472The sum of the ascent bottoms of a permutation. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000646The number of big ascents of a permutation. St000647The number of big descents of a permutation. St000652The maximal difference between successive positions of a permutation. St000657The smallest part of an integer composition. St000671The maximin edge-connectivity for choosing a subgraph. St000678The number of up steps after the last double rise of a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000696The number of cycles in the breakpoint graph of a permutation. St000700The protection number of an ordered tree. St000711The number of big exceedences of a permutation. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000756The sum of the positions of the left to right maxima of a permutation. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000781The number of proper colouring schemes of a Ferrers diagram. St000785The number of distinct colouring schemes of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000845The maximal number of elements covered by an element in a poset. St000884The number of isolated descents of a permutation. St000916The packing number of a graph. St000917The open packing number of a graph. St000948The chromatic discriminant of a graph. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001057The Grundy value of the game of creating an independent set in a graph. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001114The number of odd descents of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001271The competition number of a graph. St001272The number of graphs with the same degree sequence. St001277The degeneracy of a graph. St001282The number of graphs with the same chromatic polynomial. St001286The annihilation number of a graph. St001298The number of repeated entries in the Lehmer code of a permutation. St001322The size of a minimal independent dominating set in a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001352The number of internal nodes in the modular decomposition of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001363The Euler characteristic of a graph according to Knill. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001386The number of prime labellings of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001463The number of distinct columns in the nullspace of a graph. St001469The holeyness of a permutation. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001512The minimum rank of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001531Number of partial orders contained in the poset determined by the Dyck path. St001546The number of monomials in the Tutte polynomial of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001638The book thickness of a graph. St001642The Prague dimension of a graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001672The restrained domination number of a graph. St001729The number of visible descents of a permutation. St001734The lettericity of a graph. St001735The number of permutations with the same set of runs. St001737The number of descents of type 2 in a permutation. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001743The discrepancy of a graph. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001765The number of connected components of the friends and strangers graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001792The arboricity of a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001829The common independence number of a graph. St001851The number of Hecke atoms of a signed permutation. St001917The order of toric promotion on the set of labellings of a graph. St001928The number of non-overlapping descents in a permutation. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001959The product of the heights of the peaks of a Dyck path. St000039The number of crossings of a permutation. St000041The number of nestings of a perfect matching. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000143The largest repeated part of a partition. St000153The number of adjacent cycles of a permutation. St000164The number of short pairs. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000219The number of occurrences of the pattern 231 in a permutation. St000223The number of nestings in the permutation. St000232The number of crossings of a set partition. St000258The burning number of a graph. St000268The number of strongly connected orientations of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000299The number of nonisomorphic vertex-induced subtrees. St000323The minimal crossing number of a graph. St000325The width of the tree associated to a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000344The number of strongly connected outdegree sequences of a graph. St000355The number of occurrences of the pattern 21-3. St000366The number of double descents of a permutation. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000379The number of Hamiltonian cycles in a graph. St000396The register function (or Horton-Strahler number) of a binary tree. St000397The Strahler number of a rooted tree. St000401The size of the symmetry class of a permutation. St000403The Szeged index minus the Wiener index of a graph. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000427The number of occurrences of the pattern 123 or of the pattern 231 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000448The number of pairs of vertices of a graph with distance 2. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000462The major index minus the number of excedences of a permutation. St000470The number of runs in a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000552The number of cut vertices of a graph. St000624The normalized sum of the minimal distances to a greater element. St000637The length of the longest cycle in a graph. St000638The number of up-down runs of a permutation. St000648The number of 2-excedences of a permutation. St000649The number of 3-excedences of a permutation. St000663The number of right floats of a permutation. St000679The pruning number of an ordered tree. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000783The side length of the largest staircase partition fitting into a partition. St000834The number of right outer peaks of a permutation. St000837The number of ascents of distance 2 of a permutation. St000872The number of very big descents of a permutation. St000883The number of longest increasing subsequences of a permutation. St000886The number of permutations with the same antidiagonal sums. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000894The trace of an alternating sign matrix. St000918The 2-limited packing number of a graph. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000963The 2-shifted major index of a permutation. St000974The length of the trunk of an ordered tree. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001042The size of the automorphism group of the leaf labelled binary unordered tree associated with the perfect matching. St001060The distinguishing index of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001093The detour number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001131The number of trivial trees on the path to label one in the decreasing labelled binary unordered tree associated with the perfect matching. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number of a graph. St001315The dissociation number of a graph. St001316The domatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the 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. St001323The independence gap of a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001374The Padmakar-Ivan index of a graph. St001430The number of positive entries in a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001479The number of bridges of a graph. St001480The number of simple summands of the module J^2/J^3. St001494The Alon-Tarsi number of a graph. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001519The pinnacle sum of a permutation. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001535The number of cyclic alignments of a permutation. St001556The number of inversions of the third entry of a permutation. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001580The acyclic chromatic number of a graph. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001674The number of vertices of the largest induced star graph in the graph. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001689The number of celebrities in a graph. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001703The villainy of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001708The number of pairs of vertices of different degree in a graph. St001716The 1-improper chromatic number of a graph. St001730The number of times the path corresponding to a binary word crosses the base line. St001736The total number of cycles in a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001742The difference of the maximal and the minimal degree in a graph. St001764The number of non-convex subsets of vertices in a graph. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001793The difference between the clique number and the chromatic number of a graph. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001797The number of overfull subgraphs of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001799The number of proper separations of a graph. St001826The maximal number of leaves on a vertex of a graph. St001836The number of occurrences of a 213 pattern in the restricted growth word of a perfect matching. St001862The number of crossings of a signed permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001957The number of Hasse diagrams with a given underlying undirected graph. St001960The number of descents of a permutation minus one if its first entry is not one. St001962The proper pathwidth of a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St001108The 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001119The length of a shortest maximal path in a graph. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001110The 3-dynamic chromatic number of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001555The order of a signed permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000058The order of a permutation. St001846The number of elements which do not have a complement in the lattice. St001616The number of neutral elements in a lattice. St000640The rank of the largest boolean interval in a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000741The Colin de Verdière graph invariant. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000052The number of valleys of a Dyck path not on the x-axis. St000753The Grundy value for the game of Kayles on a binary word. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001889The size of the connectivity set of a signed permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000141The maximum drop size of a permutation. St000662The staircase size of the code of a permutation. St000359The number of occurrences of the pattern 23-1. St000983The length of the longest alternating subword.
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!