searching the database
Your data matches 66 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: St000010
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => [1] => [1]
=> 1
[2,1] => 1 => [1] => [1]
=> 1
[1,2,3] => 00 => [2] => [2]
=> 1
[1,3,2] => 01 => [1,1] => [1,1]
=> 2
[2,1,3] => 10 => [1,1] => [1,1]
=> 2
[2,3,1] => 01 => [1,1] => [1,1]
=> 2
[3,1,2] => 10 => [1,1] => [1,1]
=> 2
[3,2,1] => 11 => [2] => [2]
=> 1
[1,2,3,4] => 000 => [3] => [3]
=> 1
[1,2,4,3] => 001 => [2,1] => [2,1]
=> 2
[1,3,2,4] => 010 => [1,1,1] => [1,1,1]
=> 3
[1,3,4,2] => 001 => [2,1] => [2,1]
=> 2
[1,4,2,3] => 010 => [1,1,1] => [1,1,1]
=> 3
[1,4,3,2] => 011 => [1,2] => [2,1]
=> 2
[2,1,3,4] => 100 => [1,2] => [2,1]
=> 2
[2,1,4,3] => 101 => [1,1,1] => [1,1,1]
=> 3
[2,3,1,4] => 010 => [1,1,1] => [1,1,1]
=> 3
[2,3,4,1] => 001 => [2,1] => [2,1]
=> 2
[2,4,1,3] => 010 => [1,1,1] => [1,1,1]
=> 3
[2,4,3,1] => 011 => [1,2] => [2,1]
=> 2
[3,1,2,4] => 100 => [1,2] => [2,1]
=> 2
[3,1,4,2] => 101 => [1,1,1] => [1,1,1]
=> 3
[3,2,1,4] => 110 => [2,1] => [2,1]
=> 2
[3,2,4,1] => 101 => [1,1,1] => [1,1,1]
=> 3
[3,4,1,2] => 010 => [1,1,1] => [1,1,1]
=> 3
[3,4,2,1] => 011 => [1,2] => [2,1]
=> 2
[4,1,2,3] => 100 => [1,2] => [2,1]
=> 2
[4,1,3,2] => 101 => [1,1,1] => [1,1,1]
=> 3
[4,2,1,3] => 110 => [2,1] => [2,1]
=> 2
[4,2,3,1] => 101 => [1,1,1] => [1,1,1]
=> 3
[4,3,1,2] => 110 => [2,1] => [2,1]
=> 2
[4,3,2,1] => 111 => [3] => [3]
=> 1
[1,2,3,4,5] => 0000 => [4] => [4]
=> 1
[1,2,3,5,4] => 0001 => [3,1] => [3,1]
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => [2,1,1]
=> 3
[1,2,4,5,3] => 0001 => [3,1] => [3,1]
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => [2,1,1]
=> 3
[1,2,5,4,3] => 0011 => [2,2] => [2,2]
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => [2,1,1]
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => [1,1,1,1]
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => [2,1,1]
=> 3
[1,3,4,5,2] => 0001 => [3,1] => [3,1]
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => [2,1,1]
=> 3
[1,3,5,4,2] => 0011 => [2,2] => [2,2]
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => [2,1,1]
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => [1,1,1,1]
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => [2,1,1]
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => [1,1,1,1]
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => [2,1,1]
=> 3
[1,4,5,3,2] => 0011 => [2,2] => [2,2]
=> 2
Description
The length of the partition.
Matching statistic: St000097
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => [1] => ([],1)
=> 1
[2,1] => 1 => [1] => ([],1)
=> 1
[1,2,3] => 00 => [2] => ([],2)
=> 1
[1,3,2] => 01 => [1,1] => ([(0,1)],2)
=> 2
[2,1,3] => 10 => [1,1] => ([(0,1)],2)
=> 2
[2,3,1] => 01 => [1,1] => ([(0,1)],2)
=> 2
[3,1,2] => 10 => [1,1] => ([(0,1)],2)
=> 2
[3,2,1] => 11 => [2] => ([],2)
=> 1
[1,2,3,4] => 000 => [3] => ([],3)
=> 1
[1,2,4,3] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,3,2,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,3,4,2] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,4,2,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,4,3,2] => 011 => [1,2] => ([(1,2)],3)
=> 2
[2,1,3,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[2,1,4,3] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,1,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[2,4,1,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,3,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[3,1,2,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[3,1,4,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,2,1,4] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[3,2,4,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,1,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[4,1,2,3] => 100 => [1,2] => ([(1,2)],3)
=> 2
[4,1,3,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,2,1,3] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,2,3,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,1,2] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,3,2,1] => 111 => [3] => ([],3)
=> 1
[1,2,3,4,5] => 0000 => [4] => ([],4)
=> 1
[1,2,3,5,4] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,4,5,3] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,5,4,3] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,4,5,2] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,5,4,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,5,3,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
Description
The order of the largest clique of the graph.
A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000098: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000098: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => [1] => ([],1)
=> 1
[2,1] => 1 => [1] => ([],1)
=> 1
[1,2,3] => 00 => [2] => ([],2)
=> 1
[1,3,2] => 01 => [1,1] => ([(0,1)],2)
=> 2
[2,1,3] => 10 => [1,1] => ([(0,1)],2)
=> 2
[2,3,1] => 01 => [1,1] => ([(0,1)],2)
=> 2
[3,1,2] => 10 => [1,1] => ([(0,1)],2)
=> 2
[3,2,1] => 11 => [2] => ([],2)
=> 1
[1,2,3,4] => 000 => [3] => ([],3)
=> 1
[1,2,4,3] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,3,2,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,3,4,2] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,4,2,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,4,3,2] => 011 => [1,2] => ([(1,2)],3)
=> 2
[2,1,3,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[2,1,4,3] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,1,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[2,4,1,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,3,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[3,1,2,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[3,1,4,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,2,1,4] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[3,2,4,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,1,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[4,1,2,3] => 100 => [1,2] => ([(1,2)],3)
=> 2
[4,1,3,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,2,1,3] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,2,3,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,1,2] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,3,2,1] => 111 => [3] => ([],3)
=> 1
[1,2,3,4,5] => 0000 => [4] => ([],4)
=> 1
[1,2,3,5,4] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,4,5,3] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,5,4,3] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,4,5,2] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,5,4,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,5,3,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
Description
The chromatic number of a graph.
The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
Matching statistic: St000691
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00109: Permutations —descent word⟶ Binary words
St000691: Binary words ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
St000691: Binary words ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
Values
[1,2] => 0 => 0 = 1 - 1
[2,1] => 1 => 0 = 1 - 1
[1,2,3] => 00 => 0 = 1 - 1
[1,3,2] => 01 => 1 = 2 - 1
[2,1,3] => 10 => 1 = 2 - 1
[2,3,1] => 01 => 1 = 2 - 1
[3,1,2] => 10 => 1 = 2 - 1
[3,2,1] => 11 => 0 = 1 - 1
[1,2,3,4] => 000 => 0 = 1 - 1
[1,2,4,3] => 001 => 1 = 2 - 1
[1,3,2,4] => 010 => 2 = 3 - 1
[1,3,4,2] => 001 => 1 = 2 - 1
[1,4,2,3] => 010 => 2 = 3 - 1
[1,4,3,2] => 011 => 1 = 2 - 1
[2,1,3,4] => 100 => 1 = 2 - 1
[2,1,4,3] => 101 => 2 = 3 - 1
[2,3,1,4] => 010 => 2 = 3 - 1
[2,3,4,1] => 001 => 1 = 2 - 1
[2,4,1,3] => 010 => 2 = 3 - 1
[2,4,3,1] => 011 => 1 = 2 - 1
[3,1,2,4] => 100 => 1 = 2 - 1
[3,1,4,2] => 101 => 2 = 3 - 1
[3,2,1,4] => 110 => 1 = 2 - 1
[3,2,4,1] => 101 => 2 = 3 - 1
[3,4,1,2] => 010 => 2 = 3 - 1
[3,4,2,1] => 011 => 1 = 2 - 1
[4,1,2,3] => 100 => 1 = 2 - 1
[4,1,3,2] => 101 => 2 = 3 - 1
[4,2,1,3] => 110 => 1 = 2 - 1
[4,2,3,1] => 101 => 2 = 3 - 1
[4,3,1,2] => 110 => 1 = 2 - 1
[4,3,2,1] => 111 => 0 = 1 - 1
[1,2,3,4,5] => 0000 => 0 = 1 - 1
[1,2,3,5,4] => 0001 => 1 = 2 - 1
[1,2,4,3,5] => 0010 => 2 = 3 - 1
[1,2,4,5,3] => 0001 => 1 = 2 - 1
[1,2,5,3,4] => 0010 => 2 = 3 - 1
[1,2,5,4,3] => 0011 => 1 = 2 - 1
[1,3,2,4,5] => 0100 => 2 = 3 - 1
[1,3,2,5,4] => 0101 => 3 = 4 - 1
[1,3,4,2,5] => 0010 => 2 = 3 - 1
[1,3,4,5,2] => 0001 => 1 = 2 - 1
[1,3,5,2,4] => 0010 => 2 = 3 - 1
[1,3,5,4,2] => 0011 => 1 = 2 - 1
[1,4,2,3,5] => 0100 => 2 = 3 - 1
[1,4,2,5,3] => 0101 => 3 = 4 - 1
[1,4,3,2,5] => 0110 => 2 = 3 - 1
[1,4,3,5,2] => 0101 => 3 = 4 - 1
[1,4,5,2,3] => 0010 => 2 = 3 - 1
[1,4,5,3,2] => 0011 => 1 = 2 - 1
[3,1,4,2,6,5,8,7,10,9,11] => 1010101010 => ? = 10 - 1
[1,3,2,5,4,7,6,9,8,11,10] => 0101010101 => ? = 10 - 1
[6,5,7,4,8,3,9,2,10,1,11] => 1010101010 => ? = 10 - 1
[1,7,6,8,5,9,4,10,3,11,2] => 0101010101 => ? = 10 - 1
Description
The number of changes of a binary word.
This is the number of indices $i$ such that $w_i \neq w_{i+1}$.
Matching statistic: St001486
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
St001486: Integer compositions ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
St001486: Integer compositions ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
Values
[1,2] => [2] => 2 = 1 + 1
[2,1] => [1,1] => 2 = 1 + 1
[1,2,3] => [3] => 2 = 1 + 1
[1,3,2] => [2,1] => 3 = 2 + 1
[2,1,3] => [1,2] => 3 = 2 + 1
[2,3,1] => [2,1] => 3 = 2 + 1
[3,1,2] => [1,2] => 3 = 2 + 1
[3,2,1] => [1,1,1] => 2 = 1 + 1
[1,2,3,4] => [4] => 2 = 1 + 1
[1,2,4,3] => [3,1] => 3 = 2 + 1
[1,3,2,4] => [2,2] => 4 = 3 + 1
[1,3,4,2] => [3,1] => 3 = 2 + 1
[1,4,2,3] => [2,2] => 4 = 3 + 1
[1,4,3,2] => [2,1,1] => 3 = 2 + 1
[2,1,3,4] => [1,3] => 3 = 2 + 1
[2,1,4,3] => [1,2,1] => 4 = 3 + 1
[2,3,1,4] => [2,2] => 4 = 3 + 1
[2,3,4,1] => [3,1] => 3 = 2 + 1
[2,4,1,3] => [2,2] => 4 = 3 + 1
[2,4,3,1] => [2,1,1] => 3 = 2 + 1
[3,1,2,4] => [1,3] => 3 = 2 + 1
[3,1,4,2] => [1,2,1] => 4 = 3 + 1
[3,2,1,4] => [1,1,2] => 3 = 2 + 1
[3,2,4,1] => [1,2,1] => 4 = 3 + 1
[3,4,1,2] => [2,2] => 4 = 3 + 1
[3,4,2,1] => [2,1,1] => 3 = 2 + 1
[4,1,2,3] => [1,3] => 3 = 2 + 1
[4,1,3,2] => [1,2,1] => 4 = 3 + 1
[4,2,1,3] => [1,1,2] => 3 = 2 + 1
[4,2,3,1] => [1,2,1] => 4 = 3 + 1
[4,3,1,2] => [1,1,2] => 3 = 2 + 1
[4,3,2,1] => [1,1,1,1] => 2 = 1 + 1
[1,2,3,4,5] => [5] => 2 = 1 + 1
[1,2,3,5,4] => [4,1] => 3 = 2 + 1
[1,2,4,3,5] => [3,2] => 4 = 3 + 1
[1,2,4,5,3] => [4,1] => 3 = 2 + 1
[1,2,5,3,4] => [3,2] => 4 = 3 + 1
[1,2,5,4,3] => [3,1,1] => 3 = 2 + 1
[1,3,2,4,5] => [2,3] => 4 = 3 + 1
[1,3,2,5,4] => [2,2,1] => 5 = 4 + 1
[1,3,4,2,5] => [3,2] => 4 = 3 + 1
[1,3,4,5,2] => [4,1] => 3 = 2 + 1
[1,3,5,2,4] => [3,2] => 4 = 3 + 1
[1,3,5,4,2] => [3,1,1] => 3 = 2 + 1
[1,4,2,3,5] => [2,3] => 4 = 3 + 1
[1,4,2,5,3] => [2,2,1] => 5 = 4 + 1
[1,4,3,2,5] => [2,1,2] => 4 = 3 + 1
[1,4,3,5,2] => [2,2,1] => 5 = 4 + 1
[1,4,5,2,3] => [3,2] => 4 = 3 + 1
[1,4,5,3,2] => [3,1,1] => 3 = 2 + 1
[7,6,5,3,2,4,8,1] => ? => ? = 3 + 1
[8,5,4,6,3,2,1,7] => ? => ? = 4 + 1
[5,6,4,3,2,7,1,8] => ? => ? = 5 + 1
[7,5,4,3,1,2,6,8] => ? => ? = 2 + 1
[4,3,5,6,1,2,7,8] => ? => ? = 4 + 1
[5,6,2,1,3,4,7,8] => ? => ? = 3 + 1
[4,3,5,1,2,6,7,8] => ? => ? = 4 + 1
[4,5,2,1,3,6,7,8] => ? => ? = 3 + 1
[2,8,7,6,3,5,4,1] => ? => ? = 4 + 1
[4,2,3,5,6,7,8,1,9] => ? => ? = 4 + 1
[6,7,8,5,4,3,2,1,9] => ? => ? = 3 + 1
[6,5,7,8,4,3,2,1,9] => ? => ? = 4 + 1
[6,5,4,7,8,3,2,1,9] => ? => ? = 4 + 1
[6,5,4,3,7,8,2,1,9] => ? => ? = 4 + 1
[6,5,4,3,2,7,8,1,9] => ? => ? = 4 + 1
[6,5,7,8,9,3,2,1,4] => ? => ? = 4 + 1
[6,5,4,7,8,9,2,1,3] => ? => ? = 4 + 1
[6,5,4,3,7,8,9,1,2] => ? => ? = 4 + 1
[4,5,6,7,8,3,9,1,2] => ? => ? = 5 + 1
[3,1,4,2,6,5,8,7,10,9,11] => [1,2,2,2,2,2] => ? = 10 + 1
[8,6,5,4,3,2,7,9,1] => ? => ? = 3 + 1
[7,6,5,4,3,8,9,1,2] => ? => ? = 4 + 1
[9,6,5,4,3,2,7,1,8] => ? => ? = 4 + 1
[1,3,2,5,4,7,6,9,8,11,10] => [2,2,2,2,2,1] => ? = 10 + 1
[6,5,7,4,8,3,9,2,10,1,11] => [1,2,2,2,2,2] => ? = 10 + 1
[1,7,6,8,5,9,4,10,3,11,2] => [2,2,2,2,2,1] => ? = 10 + 1
[5,4,2,3,6,7,8,9,1] => ? => ? = 3 + 1
[6,5,4,2,3,7,8,9,1] => ? => ? = 3 + 1
[7,6,5,4,2,3,8,9,1] => ? => ? = 3 + 1
[8,7,9,6,5,4,2,3,1] => ? => ? = 5 + 1
[8,7,9,6,5,4,2,1,3] => ? => ? = 4 + 1
[8,9,7,6,5,4,2,1,3] => ? => ? = 3 + 1
[8,9,7,6,5,4,2,3,1] => ? => ? = 4 + 1
[8,7,5,6,4,3,2,1,9] => ? => ? = 4 + 1
[8,6,5,7,4,3,2,1,9] => ? => ? = 4 + 1
[9,8,7,6,4,3,2,5,1] => ? => ? = 3 + 1
[8,5,6,7,4,3,2,1,9] => ? => ? = 4 + 1
[6,7,5,8,4,3,2,1,9] => ? => ? = 5 + 1
[8,9,7,6,4,3,2,1,5] => ? => ? = 3 + 1
[9,8,7,6,4,3,5,1,2] => ? => ? = 4 + 1
[9,8,7,6,4,5,2,3,1] => ? => ? = 5 + 1
[8,7,6,5,4,2,3,1,9] => ? => ? = 4 + 1
[9,8,7,6,5,2,3,4,1] => ? => ? = 3 + 1
Description
The number of corners of the ribbon associated with an integer composition.
We associate a ribbon shape to a composition $c=(c_1,\dots,c_n)$ with $c_i$ cells in the $i$-th row from bottom to top, such that the cells in two rows overlap in precisely one cell.
This statistic records the total number of corners of the ribbon shape.
Matching statistic: St000288
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000288: Binary words ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000288: Binary words ⟶ ℤResult quality: 90% ●values known / values provided: 100%●distinct values known / distinct values provided: 90%
Values
[1,2] => 0 => [1] => 1 => 1
[2,1] => 1 => [1] => 1 => 1
[1,2,3] => 00 => [2] => 10 => 1
[1,3,2] => 01 => [1,1] => 11 => 2
[2,1,3] => 10 => [1,1] => 11 => 2
[2,3,1] => 01 => [1,1] => 11 => 2
[3,1,2] => 10 => [1,1] => 11 => 2
[3,2,1] => 11 => [2] => 10 => 1
[1,2,3,4] => 000 => [3] => 100 => 1
[1,2,4,3] => 001 => [2,1] => 101 => 2
[1,3,2,4] => 010 => [1,1,1] => 111 => 3
[1,3,4,2] => 001 => [2,1] => 101 => 2
[1,4,2,3] => 010 => [1,1,1] => 111 => 3
[1,4,3,2] => 011 => [1,2] => 110 => 2
[2,1,3,4] => 100 => [1,2] => 110 => 2
[2,1,4,3] => 101 => [1,1,1] => 111 => 3
[2,3,1,4] => 010 => [1,1,1] => 111 => 3
[2,3,4,1] => 001 => [2,1] => 101 => 2
[2,4,1,3] => 010 => [1,1,1] => 111 => 3
[2,4,3,1] => 011 => [1,2] => 110 => 2
[3,1,2,4] => 100 => [1,2] => 110 => 2
[3,1,4,2] => 101 => [1,1,1] => 111 => 3
[3,2,1,4] => 110 => [2,1] => 101 => 2
[3,2,4,1] => 101 => [1,1,1] => 111 => 3
[3,4,1,2] => 010 => [1,1,1] => 111 => 3
[3,4,2,1] => 011 => [1,2] => 110 => 2
[4,1,2,3] => 100 => [1,2] => 110 => 2
[4,1,3,2] => 101 => [1,1,1] => 111 => 3
[4,2,1,3] => 110 => [2,1] => 101 => 2
[4,2,3,1] => 101 => [1,1,1] => 111 => 3
[4,3,1,2] => 110 => [2,1] => 101 => 2
[4,3,2,1] => 111 => [3] => 100 => 1
[1,2,3,4,5] => 0000 => [4] => 1000 => 1
[1,2,3,5,4] => 0001 => [3,1] => 1001 => 2
[1,2,4,3,5] => 0010 => [2,1,1] => 1011 => 3
[1,2,4,5,3] => 0001 => [3,1] => 1001 => 2
[1,2,5,3,4] => 0010 => [2,1,1] => 1011 => 3
[1,2,5,4,3] => 0011 => [2,2] => 1010 => 2
[1,3,2,4,5] => 0100 => [1,1,2] => 1110 => 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => 1111 => 4
[1,3,4,2,5] => 0010 => [2,1,1] => 1011 => 3
[1,3,4,5,2] => 0001 => [3,1] => 1001 => 2
[1,3,5,2,4] => 0010 => [2,1,1] => 1011 => 3
[1,3,5,4,2] => 0011 => [2,2] => 1010 => 2
[1,4,2,3,5] => 0100 => [1,1,2] => 1110 => 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => 1111 => 4
[1,4,3,2,5] => 0110 => [1,2,1] => 1101 => 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => 1111 => 4
[1,4,5,2,3] => 0010 => [2,1,1] => 1011 => 3
[1,4,5,3,2] => 0011 => [2,2] => 1010 => 2
[3,4,1,2,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[9,7,5,10,3,8,2,6,1,4] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,9,7,8,5,6,3,4,1,2] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,4,1,3,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[2,4,6,1,8,3,9,5,10,7] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[9,10,1,6,8,4,7,2,5,3] => 010010101 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[1,8,10,6,9,4,7,2,5,3] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,1,10,5,3,7,4,9,6,8] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[10,3,1,5,2,7,4,9,6,8] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[6,5,4,10,3,9,2,8,1,7] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[3,2,1,5,4,7,6,9,8,10] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,9,4,8,3,7,2,6,1,5] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[1,2,4,3,6,5,8,7,10,9] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[9,7,10,8,5,6,3,4,1,2] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[10,2,1,4,3,6,5,8,7,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,9,2,8,5,7,4,6,1,3] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,7,2,6,5,9,4,8,1,3] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[8,7,3,6,2,5,4,10,1,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,4,3,8,2,7,6,10,1,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[6,2,1,7,3,8,4,9,5,10] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,8,6,9,4,7,2,5,1,3] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[6,8,10,1,7,2,9,3,5,4] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[3,2,5,4,1,8,6,10,7,9] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[3,2,7,6,4,5,1,10,8,9] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[3,2,9,6,4,8,5,7,1,10] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[3,2,1,6,4,8,5,10,7,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,4,2,3,1,8,6,10,7,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[7,4,2,6,3,5,1,10,8,9] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[9,4,2,6,3,8,5,7,1,10] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,1,8,7,5,10,4,9,3,6] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[8,5,3,7,2,10,4,9,1,6] => 110101010 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,3,6,4,5,1,8,7,10,9] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,3,4,1,6,5,8,7,10,9] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,5,4,6,7,1,8,3,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[1,4,2,3,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[1,3,4,2,6,5,8,7,10,9] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[3,1,4,2,6,5,8,7,10,9,11] => 1010101010 => [1,1,1,1,1,1,1,1,1,1] => 1111111111 => ? = 10
[5,6,7,1,8,2,9,3,10,4] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[2,3,10,5,6,1,8,4,9,7] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[1,3,2,5,4,7,6,9,8,11,10] => 0101010101 => [1,1,1,1,1,1,1,1,1,1] => 1111111111 => ? = 10
[3,4,7,1,8,2,9,5,10,6] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[3,5,8,2,6,1,9,4,10,7] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,9,3,7,1,10,4,8,2] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,10,4,8,2,9,3,7,1] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,9,3,8,2,10,4,7,1] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,7,3,8,4,9,1,10,2] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,7,3,8,4,10,2,9,1] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[5,6,8,4,7,3,10,2,9,1] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
[10,1,9,3,2,8,5,6,4,7] => 101101010 => [1,1,2,1,1,1,1,1] => 111011111 => ? = 8
[1,6,7,5,8,4,9,3,10,2] => 001010101 => [2,1,1,1,1,1,1,1] => 101111111 => ? = 8
Description
The number of ones in a binary word.
This is also known as the Hamming weight of the word.
Matching statistic: St000011
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => [1] => [1,0]
=> 1
[2,1] => 1 => [1] => [1,0]
=> 1
[1,2,3] => 00 => [2] => [1,1,0,0]
=> 1
[1,3,2] => 01 => [1,1] => [1,0,1,0]
=> 2
[2,1,3] => 10 => [1,1] => [1,0,1,0]
=> 2
[2,3,1] => 01 => [1,1] => [1,0,1,0]
=> 2
[3,1,2] => 10 => [1,1] => [1,0,1,0]
=> 2
[3,2,1] => 11 => [2] => [1,1,0,0]
=> 1
[1,2,3,4] => 000 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,4,3] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,3,2,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,3,4,2] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,4,2,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,4,3,2] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,3,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,4,3] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,1,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,4,1] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[2,4,1,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,4,3,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,2,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,4,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,2,1,4] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[3,2,4,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,1,2] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,2,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,2,3] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,3,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,2,1,3] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,2,3,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,3,1,2] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,3,2,1] => 111 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,3,4,5] => 0000 => [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,5,4] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,4,5,3] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,5,4,3] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,4,5,2] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,5,4,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,4,5,3,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[6,1,2,3,4,8,5,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,2,3,4,7,5,9,6] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[6,1,2,3,4,9,8,5,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[5,1,2,3,8,4,6,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[5,1,2,3,6,9,8,4,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[4,1,2,8,3,5,6,9,7] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,9,3,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,2,8,3,4,5,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,9,6,7,8,3,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[3,1,8,2,4,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,9,2,4,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[8,1,4,2,3,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[9,1,4,2,3,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[6,1,4,2,3,7,8,9,5] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[8,1,7,2,3,4,5,9,6] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,4,9,2,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,4,5,2,3,8,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[8,1,4,5,6,2,3,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[7,1,4,5,6,2,8,9,3] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[3,1,4,5,6,8,2,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,4,5,6,7,2,9,3] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[3,1,4,9,6,7,8,2,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[3,1,9,5,6,7,8,2,4] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[2,7,1,3,4,5,9,6,8] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,9,1,3,4,5,8,6,7] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,9,1,3,6,7,8,4,5] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,4,1,5,6,7,9,3,8] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,4,1,5,6,9,8,3,7] => 01000110 => [1,1,3,2,1] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> ? = 5
[2,9,1,5,6,7,8,3,4] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[9,3,1,2,4,5,8,6,7] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[9,3,1,2,6,7,8,4,5] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[7,6,1,2,3,4,9,5,8] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[9,6,1,2,3,4,8,5,7] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[9,7,1,2,3,4,8,5,6] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[5,6,1,2,3,7,9,4,8] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[9,6,1,2,3,7,8,4,5] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[5,4,1,2,6,7,9,3,8] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[8,7,1,6,2,3,4,9,5] => 11010001 => [2,1,1,3,1] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,3,1,5,8,7,2,9,6] => 11001101 => [2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 5
[4,3,1,5,6,7,9,2,8] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[4,3,1,5,6,9,8,2,7] => 11000110 => [2,3,2,1] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> ? = 4
[9,3,1,5,6,7,8,2,4] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[9,4,1,5,6,7,8,2,3] => 11000010 => [2,4,1,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 4
[2,3,8,1,4,5,6,9,7] => 00100001 => [2,1,4,1] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 4
[2,3,9,1,4,5,8,6,7] => 00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 5
[2,3,9,1,4,7,8,5,6] => 00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 5
[2,3,8,1,6,7,4,9,5] => 00100101 => [2,1,2,1,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 6
[2,3,5,1,6,7,9,4,8] => 00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 5
[2,3,9,1,6,7,8,4,5] => 00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 5
[2,3,5,1,6,7,8,9,4] => 00100001 => [2,1,4,1] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 4
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St001581
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001581: Graphs ⟶ ℤResult quality: 70% ●values known / values provided: 98%●distinct values known / distinct values provided: 70%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001581: Graphs ⟶ ℤResult quality: 70% ●values known / values provided: 98%●distinct values known / distinct values provided: 70%
Values
[1,2] => 0 => [1] => ([],1)
=> 1
[2,1] => 1 => [1] => ([],1)
=> 1
[1,2,3] => 00 => [2] => ([],2)
=> 1
[1,3,2] => 01 => [1,1] => ([(0,1)],2)
=> 2
[2,1,3] => 10 => [1,1] => ([(0,1)],2)
=> 2
[2,3,1] => 01 => [1,1] => ([(0,1)],2)
=> 2
[3,1,2] => 10 => [1,1] => ([(0,1)],2)
=> 2
[3,2,1] => 11 => [2] => ([],2)
=> 1
[1,2,3,4] => 000 => [3] => ([],3)
=> 1
[1,2,4,3] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,3,2,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,3,4,2] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,4,2,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,4,3,2] => 011 => [1,2] => ([(1,2)],3)
=> 2
[2,1,3,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[2,1,4,3] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,1,4] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,3,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[2,4,1,3] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[2,4,3,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[3,1,2,4] => 100 => [1,2] => ([(1,2)],3)
=> 2
[3,1,4,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,2,1,4] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[3,2,4,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,1,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[3,4,2,1] => 011 => [1,2] => ([(1,2)],3)
=> 2
[4,1,2,3] => 100 => [1,2] => ([(1,2)],3)
=> 2
[4,1,3,2] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,2,1,3] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,2,3,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[4,3,1,2] => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 2
[4,3,2,1] => 111 => [3] => ([],3)
=> 1
[1,2,3,4,5] => 0000 => [4] => ([],4)
=> 1
[1,2,3,5,4] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,4,5,3] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,5,4,3] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,4,5,2] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,3,5,4,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,4,5,3,2] => 0011 => [2,2] => ([(1,3),(2,3)],4)
=> 2
[2,1,4,3,6,5,8,7,10,9] => 101010101 => [1,1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 9
[3,4,1,2,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 8
[10,8,9,6,7,4,5,2,3,1] => 101010101 => [1,1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 9
[3,5,1,7,2,9,4,10,6,8] => 010101010 => [1,1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 9
[9,7,5,10,3,8,2,6,1,4] => 110101010 => [2,1,1,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 8
[6,1,2,3,4,8,5,9,7] => 10000101 => [1,4,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[8,1,2,3,4,7,5,9,6] => 10000101 => [1,4,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[5,1,2,3,8,4,6,9,7] => 10001001 => [1,3,1,2,1] => ([(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[4,1,2,8,3,5,6,9,7] => 10010001 => [1,2,1,3,1] => ([(0,7),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[4,1,2,9,3,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[7,1,2,8,3,4,5,9,6] => 10010001 => [1,2,1,3,1] => ([(0,7),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[4,1,2,9,6,7,8,3,5] => 10010010 => [1,2,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[3,1,9,2,4,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[3,1,5,2,7,4,9,6,8] => 10101010 => [1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 8
[9,1,4,2,3,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[3,1,4,9,2,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[7,1,4,5,2,3,8,9,6] => 10010001 => [1,2,1,3,1] => ([(0,7),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[8,1,4,5,6,2,3,9,7] => 10001001 => [1,3,1,2,1] => ([(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[7,1,4,5,6,2,8,9,3] => 10001001 => [1,3,1,2,1] => ([(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[3,1,4,5,6,8,2,9,7] => 10000101 => [1,4,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[8,1,4,5,6,7,2,9,3] => 10000101 => [1,4,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[3,1,4,9,6,7,8,2,5] => 10010010 => [1,2,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[3,1,9,5,6,7,8,2,4] => 10100010 => [1,1,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[2,4,1,6,3,8,5,9,7] => 01010101 => [1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 8
[2,7,1,6,3,4,8,9,5] => 01010001 => [1,1,1,1,3,1] => ([(0,7),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[2,6,1,5,3,7,8,9,4] => 01010001 => [1,1,1,1,3,1] => ([(0,7),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[8,6,1,2,3,7,4,9,5] => 11000101 => [2,3,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[9,7,1,2,6,3,8,4,5] => 11001010 => [2,2,1,1,1,1] => ([(0,4),(0,5),(0,6),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[8,7,1,6,2,3,4,9,5] => 11010001 => [2,1,1,3,1] => ([(0,7),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[4,3,1,5,6,8,2,9,7] => 11000101 => [2,3,1,1,1] => ([(0,5),(0,6),(0,7),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[4,3,1,5,8,7,2,9,6] => 11001101 => [2,2,2,1,1] => ([(0,6),(0,7),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,9,1,4,5,8,6,7] => 00100010 => [2,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,9,1,4,7,8,5,6] => 00100010 => [2,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,8,1,6,7,4,9,5] => 00100101 => [2,1,2,1,1,1] => ([(0,5),(0,6),(0,7),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[2,3,5,1,6,7,9,4,8] => 00100010 => [2,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,9,1,6,7,8,4,5] => 00100010 => [2,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,9,4,1,6,3,8,5,7] => 01101010 => [1,2,1,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 7
[2,9,5,1,6,7,8,3,4] => 01100010 => [1,2,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[6,5,4,1,2,8,3,9,7] => 11100101 => [3,2,1,1,1] => ([(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[7,8,5,1,6,2,3,9,4] => 01101001 => [1,2,1,1,2,1] => ([(0,7),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[5,3,4,1,6,8,2,9,7] => 10100101 => [1,1,1,2,1,1,1] => ([(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 7
[8,3,4,1,6,7,2,9,5] => 10100101 => [1,1,1,2,1,1,1] => ([(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 7
[8,5,4,1,6,7,2,9,3] => 11100101 => [3,2,1,1,1] => ([(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[5,3,4,1,9,7,8,2,6] => 10101010 => [1,1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 8
[9,3,5,1,6,7,8,2,4] => 10100010 => [1,1,1,3,1,1] => ([(0,6),(0,7),(1,6),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[2,3,4,9,1,5,8,6,7] => 00010010 => [3,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,4,9,1,7,8,5,6] => 00010010 => [3,1,2,1,1] => ([(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,3,9,6,1,7,8,4,5] => 00110010 => [2,2,2,1,1] => ([(0,6),(0,7),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
[2,7,4,5,1,3,8,9,6] => 01010001 => [1,1,1,1,3,1] => ([(0,7),(1,7),(2,3),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 6
[2,9,6,5,1,7,8,3,4] => 01110010 => [1,3,2,1,1] => ([(0,6),(0,7),(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 5
Description
The achromatic number of a graph.
This is the maximal number of colours of a proper colouring, such that for any pair of colours there are two adjacent vertices with these colours.
Matching statistic: St001068
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 70% ●values known / values provided: 96%●distinct values known / distinct values provided: 70%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 70% ●values known / values provided: 96%●distinct values known / distinct values provided: 70%
Values
[1,2] => 0 => [1] => [1,0]
=> 1
[2,1] => 1 => [1] => [1,0]
=> 1
[1,2,3] => 00 => [2] => [1,1,0,0]
=> 1
[1,3,2] => 01 => [1,1] => [1,0,1,0]
=> 2
[2,1,3] => 10 => [1,1] => [1,0,1,0]
=> 2
[2,3,1] => 01 => [1,1] => [1,0,1,0]
=> 2
[3,1,2] => 10 => [1,1] => [1,0,1,0]
=> 2
[3,2,1] => 11 => [2] => [1,1,0,0]
=> 1
[1,2,3,4] => 000 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,4,3] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,3,2,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,3,4,2] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,4,2,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,4,3,2] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,3,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,4,3] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,1,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,4,1] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[2,4,1,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,4,3,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,2,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,4,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,2,1,4] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[3,2,4,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,1,2] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,2,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,2,3] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,3,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,2,1,3] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,2,3,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,3,1,2] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,3,2,1] => 111 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,3,4,5] => 0000 => [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,5,4] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,4,5,3] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,5,4,3] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,4,5,2] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,5,4,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,4,5,3,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,1,4,3,6,5,8,7,10,9] => 101010101 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[3,4,1,2,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[10,8,9,6,7,4,5,2,3,1] => 101010101 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[3,5,1,7,2,9,4,10,6,8] => 010101010 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[9,7,5,10,3,8,2,6,1,4] => 110101010 => [2,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[8,1,2,3,4,5,6,9,7] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[7,1,2,3,4,5,9,6,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[9,1,2,3,4,5,8,6,7] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[7,1,2,3,4,5,8,9,6] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[6,1,2,3,4,8,5,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,2,3,4,7,5,9,6] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[6,1,2,3,4,7,9,5,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[6,1,2,3,4,9,8,5,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[9,1,2,3,4,7,8,5,6] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[6,1,2,3,4,7,8,9,5] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[5,1,2,3,8,4,6,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[5,1,2,3,6,9,8,4,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[5,1,2,3,6,7,8,9,4] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[4,1,2,8,3,5,6,9,7] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,9,3,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,2,8,3,4,5,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,5,6,7,9,3,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[4,1,2,9,6,7,8,3,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[9,1,2,5,6,7,8,3,4] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[4,1,2,5,6,7,8,9,3] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[3,1,8,2,4,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,9,2,4,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[3,1,5,2,7,4,9,6,8] => 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[8,1,4,2,3,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[9,1,4,2,3,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[6,1,4,2,3,7,8,9,5] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[8,1,7,2,3,4,5,9,6] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,4,9,2,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,4,5,2,3,8,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[8,1,4,5,6,2,3,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[7,1,4,5,6,2,8,9,3] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[3,1,4,5,6,8,2,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,4,5,6,7,2,9,3] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[3,1,4,5,6,7,9,2,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[3,1,4,9,6,7,8,2,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[3,1,9,5,6,7,8,2,4] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[9,1,4,5,6,7,8,2,3] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[3,1,4,5,6,7,8,9,2] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[2,8,1,3,4,5,6,9,7] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,7,1,3,4,5,9,6,8] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,9,1,3,4,5,8,6,7] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,7,1,3,4,5,8,9,6] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,9,1,3,6,7,8,4,5] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,5,1,3,6,7,8,9,4] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,4,1,6,3,8,5,9,7] => 01010101 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St001203
Mp00109: Permutations —descent word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 70% ●values known / values provided: 96%●distinct values known / distinct values provided: 70%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 70% ●values known / values provided: 96%●distinct values known / distinct values provided: 70%
Values
[1,2] => 0 => [1] => [1,0]
=> 1
[2,1] => 1 => [1] => [1,0]
=> 1
[1,2,3] => 00 => [2] => [1,1,0,0]
=> 1
[1,3,2] => 01 => [1,1] => [1,0,1,0]
=> 2
[2,1,3] => 10 => [1,1] => [1,0,1,0]
=> 2
[2,3,1] => 01 => [1,1] => [1,0,1,0]
=> 2
[3,1,2] => 10 => [1,1] => [1,0,1,0]
=> 2
[3,2,1] => 11 => [2] => [1,1,0,0]
=> 1
[1,2,3,4] => 000 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,4,3] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,3,2,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,3,4,2] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[1,4,2,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,4,3,2] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,3,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[2,1,4,3] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,1,4] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,3,4,1] => 001 => [2,1] => [1,1,0,0,1,0]
=> 2
[2,4,1,3] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[2,4,3,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,2,4] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[3,1,4,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,2,1,4] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[3,2,4,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,1,2] => 010 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[3,4,2,1] => 011 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,2,3] => 100 => [1,2] => [1,0,1,1,0,0]
=> 2
[4,1,3,2] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,2,1,3] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,2,3,1] => 101 => [1,1,1] => [1,0,1,0,1,0]
=> 3
[4,3,1,2] => 110 => [2,1] => [1,1,0,0,1,0]
=> 2
[4,3,2,1] => 111 => [3] => [1,1,1,0,0,0]
=> 1
[1,2,3,4,5] => 0000 => [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,5,4] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,4,3,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,4,5,3] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,2,5,3,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,2,5,4,3] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,2,4,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,5,4] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,3,4,2,5] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,4,5,2] => 0001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,5,2,4] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,3,5,4,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,2,3,5] => 0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
[1,4,2,5,3] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,3,2,5] => 0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,5,2] => 0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,4,5,2,3] => 0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,4,5,3,2] => 0011 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,1,4,3,6,5,8,7,10,9] => 101010101 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[3,4,1,2,6,5,8,7,10,9] => 010010101 => [1,1,2,1,1,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[10,8,9,6,7,4,5,2,3,1] => 101010101 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[3,5,1,7,2,9,4,10,6,8] => 010101010 => [1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 9
[9,7,5,10,3,8,2,6,1,4] => 110101010 => [2,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[8,1,2,3,4,5,6,9,7] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[7,1,2,3,4,5,9,6,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[9,1,2,3,4,5,8,6,7] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[7,1,2,3,4,5,8,9,6] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[6,1,2,3,4,8,5,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,2,3,4,7,5,9,6] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[6,1,2,3,4,7,9,5,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[6,1,2,3,4,9,8,5,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[9,1,2,3,4,7,8,5,6] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[6,1,2,3,4,7,8,9,5] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[5,1,2,3,8,4,6,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[5,1,2,3,6,9,8,4,7] => 10000110 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 4
[5,1,2,3,6,7,8,9,4] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[4,1,2,8,3,5,6,9,7] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,9,3,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,2,8,3,4,5,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[4,1,2,5,6,7,9,3,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[4,1,2,9,6,7,8,3,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[9,1,2,5,6,7,8,3,4] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[4,1,2,5,6,7,8,9,3] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[3,1,8,2,4,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,9,2,4,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[3,1,5,2,7,4,9,6,8] => 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[8,1,4,2,3,5,6,9,7] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[9,1,4,2,3,5,8,6,7] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[6,1,4,2,3,7,8,9,5] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[8,1,7,2,3,4,5,9,6] => 10100001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 5
[3,1,4,9,2,5,8,6,7] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[7,1,4,5,2,3,8,9,6] => 10010001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 5
[8,1,4,5,6,2,3,9,7] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[7,1,4,5,6,2,8,9,3] => 10001001 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 5
[3,1,4,5,6,8,2,9,7] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[8,1,4,5,6,7,2,9,3] => 10000101 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 5
[3,1,4,5,6,7,9,2,8] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[3,1,4,9,6,7,8,2,5] => 10010010 => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[3,1,9,5,6,7,8,2,4] => 10100010 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 6
[9,1,4,5,6,7,8,2,3] => 10000010 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 4
[3,1,4,5,6,7,8,9,2] => 10000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3
[2,8,1,3,4,5,6,9,7] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,7,1,3,4,5,9,6,8] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,9,1,3,4,5,8,6,7] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,7,1,3,4,5,8,9,6] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,9,1,3,6,7,8,4,5] => 01000010 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 5
[2,5,1,3,6,7,8,9,4] => 01000001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
[2,4,1,6,3,8,5,9,7] => 01010101 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
Description
We associate to 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 Dyck path as follows:
In the list $L$ delete the first entry $c_0$ and substract from all other entries $n-1$ and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra.
Example:
[5,6,6,6,6] goes into [2,2,2,2,1].
Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra.
The statistic return the global dimension of the CNakayama algebra divided by 2.
The following 56 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001494The Alon-Tarsi number of a graph. St000053The number of valleys of the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000172The Grundy number of a graph. St001029The size of the core of a graph. St001580The acyclic chromatic number of a graph. St001670The connected partition number of a graph. St000272The treewidth of a graph. St000362The size of a minimal vertex cover of a graph. St000536The pathwidth of a graph. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001963The tree-depth of a graph. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St000306The bounce count of a Dyck path. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000071The number of maximal chains in a poset. St000015The number of peaks of a Dyck path. St000822The Hadwiger number of the graph. 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. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama 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$. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000388The number of orbits of vertices of a graph under automorphisms. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001330The hat guessing number of a graph. St001812The biclique partition number of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000340The number of non-final maximal constant sub-paths of length greater than one. St001083The number of boxed occurrences of 132 in a permutation. St001488The number of corners of a skew partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000824The sum of the number of descents and the number of recoils of a permutation. St000831The number of indices that are either descents or recoils. St001537The number of cyclic crossings of a permutation. St000307The number of rowmotion orbits of a poset. St000632The jump number of the poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St001734The lettericity of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000640The rank of the largest boolean interval in a poset. St001642The Prague dimension of a graph.
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!