Your data matches 58 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000108
(load all 2 compositions to match this statistic)
Mapping
St000108: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 2
[2]
 => 3
[1,1]
 => 3
[3]
 => 4
[2,1]
 => 5
[1,1,1]
 => 4
[4]
 => 5
[3,1]
 => 7
[2,2]
 => 6
[2,1,1]
 => 7
[1,1,1,1]
 => 5
[5]
 => 6
[4,1]
 => 9
[3,2]
 => 9
[2,2,1]
 => 9
[2,1,1,1]
 => 9
[1,1,1,1,1]
 => 6
[6]
 => 7
[1,1,1,1,1,1]
 => 7
[7]
 => 8
[1,1,1,1,1,1,1]
 => 8
Description
The number of partitions contained in the given partition.
Matching statistic: St000070
(load all 2 compositions to match this statistic)
Mapping
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
St000070: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [[1],[]]
 => ([],1)
 => 2
[2]
 => [[2],[]]
 => ([(0,1)],2)
 => 3
[1,1]
 => [[1,1],[]]
 => ([(0,1)],2)
 => 3
[3]
 => [[3],[]]
 => ([(0,2),(2,1)],3)
 => 4
[2,1]
 => [[2,1],[]]
 => ([(0,1),(0,2)],3)
 => 5
[1,1,1]
 => [[1,1,1],[]]
 => ([(0,2),(2,1)],3)
 => 4
[4]
 => [[4],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => 5
[3,1]
 => [[3,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => 7
[2,2]
 => [[2,2],[]]
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 6
[2,1,1]
 => [[2,1,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => 7
[1,1,1,1]
 => [[1,1,1,1],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => 5
[5]
 => [[5],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 6
[4,1]
 => [[4,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => 9
[3,2]
 => [[3,2],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => 9
[2,2,1]
 => [[2,2,1],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => 9
[2,1,1,1]
 => [[2,1,1,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => 9
[1,1,1,1,1]
 => [[1,1,1,1,1],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 6
[6]
 => [[6],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 7
[1,1,1,1,1,1]
 => [[1,1,1,1,1,1],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 7
[7]
 => [[7],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 8
[1,1,1,1,1,1,1]
 => [[1,1,1,1,1,1,1],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 8
Description
The number of antichains in a poset. An antichain in a poset $P$ is a subset of elements of $P$ which are pairwise incomparable. An order ideal is a subset $I$ of $P$ such that $a\in I$ and $b \leq_P a$ implies $b \in I$. Since there is a one-to-one correspondence between antichains and order ideals, this statistic is also the number of order ideals in a poset.
Matching statistic: St001313
(load all 5 compositions to match this statistic)
Mapping
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
St001313: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 10 => 01 => 2
[2]
 => 100 => 011 => 3
[1,1]
 => 110 => 001 => 3
[3]
 => 1000 => 0111 => 4
[2,1]
 => 1010 => 0101 => 5
[1,1,1]
 => 1110 => 0001 => 4
[4]
 => 10000 => 01111 => 5
[3,1]
 => 10010 => 01101 => 7
[2,2]
 => 1100 => 0011 => 6
[2,1,1]
 => 10110 => 01001 => 7
[1,1,1,1]
 => 11110 => 00001 => 5
[5]
 => 100000 => 011111 => 6
[4,1]
 => 100010 => 011101 => 9
[3,2]
 => 10100 => 01011 => 9
[2,2,1]
 => 11010 => 00101 => 9
[2,1,1,1]
 => 101110 => 010001 => 9
[1,1,1,1,1]
 => 111110 => 000001 => 6
[6]
 => 1000000 => 0111111 => 7
[1,1,1,1,1,1]
 => 1111110 => 0000001 => 7
[7]
 => 10000000 => 01111111 => 8
[1,1,1,1,1,1,1]
 => 11111110 => 00000001 => 8
Description
The number of Dyck paths above the lattice path given by a binary word. One may treat a binary word as a lattice path starting at the origin and treating $1$'s as steps $(1,0)$ and $0$'s as steps $(0,1)$. Given a binary word $w$, this statistic counts the number of lattice paths from the origin to the same endpoint as $w$ that stay weakly above $w$. See [[St001312]] for this statistic on compositions treated as bounce paths.
Matching statistic: St001616
Mapping
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001616: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [[1],[]]
 => ([],1)
 => ([(0,1)],2)
 => 2
[2]
 => [[2],[]]
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 3
[1,1]
 => [[1,1],[]]
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 3
[3]
 => [[3],[]]
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 4
[2,1]
 => [[2,1],[]]
 => ([(0,1),(0,2)],3)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 5
[1,1,1]
 => [[1,1,1],[]]
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 4
[4]
 => [[4],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5
[3,1]
 => [[3,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => 7
[2,2]
 => [[2,2],[]]
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 6
[2,1,1]
 => [[2,1,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => 7
[1,1,1,1]
 => [[1,1,1,1],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5
[5]
 => [[5],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 6
[4,1]
 => [[4,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => 9
[3,2]
 => [[3,2],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => 9
[2,2,1]
 => [[2,2,1],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => 9
[2,1,1,1]
 => [[2,1,1,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => 9
[1,1,1,1,1]
 => [[1,1,1,1,1],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 6
[6]
 => [[6],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 7
[1,1,1,1,1,1]
 => [[1,1,1,1,1,1],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 7
[7]
 => [[7],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 8
[1,1,1,1,1,1,1]
 => [[1,1,1,1,1,1,1],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 8
Description
The number of neutral elements in a lattice. An element $e$ of the lattice $L$ is neutral if the sublattice generated by $e$, $x$ and $y$ is distributive for all $x, y \in L$.
Matching statistic: St001846
Mapping
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001846: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [[1],[]]
 => ([],1)
 => ([(0,1)],2)
 => 0 = 2 - 2
[2]
 => [[2],[]]
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 1 = 3 - 2
[1,1]
 => [[1,1],[]]
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 1 = 3 - 2
[3]
 => [[3],[]]
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 2 = 4 - 2
[2,1]
 => [[2,1],[]]
 => ([(0,1),(0,2)],3)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 3 = 5 - 2
[1,1,1]
 => [[1,1,1],[]]
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 2 = 4 - 2
[4]
 => [[4],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 3 = 5 - 2
[3,1]
 => [[3,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => 5 = 7 - 2
[2,2]
 => [[2,2],[]]
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4 = 6 - 2
[2,1,1]
 => [[2,1,1],[]]
 => ([(0,2),(0,3),(3,1)],4)
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => 5 = 7 - 2
[1,1,1,1]
 => [[1,1,1,1],[]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 3 = 5 - 2
[5]
 => [[5],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 4 = 6 - 2
[4,1]
 => [[4,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => 7 = 9 - 2
[3,2]
 => [[3,2],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => 7 = 9 - 2
[2,2,1]
 => [[2,2,1],[]]
 => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => 7 = 9 - 2
[2,1,1,1]
 => [[2,1,1,1],[]]
 => ([(0,2),(0,4),(3,1),(4,3)],5)
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => 7 = 9 - 2
[1,1,1,1,1]
 => [[1,1,1,1,1],[]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 4 = 6 - 2
[6]
 => [[6],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 5 = 7 - 2
[1,1,1,1,1,1]
 => [[1,1,1,1,1,1],[]]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 5 = 7 - 2
[7]
 => [[7],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 6 = 8 - 2
[1,1,1,1,1,1,1]
 => [[1,1,1,1,1,1,1],[]]
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8)
 => 6 = 8 - 2
Description
The number of elements which do not have a complement in the lattice. A complement of an element $x$ in a lattice is an element $y$ such that the meet of $x$ and $y$ is the bottom element and their join is the top element.
Matching statistic: St000420
(load all 5 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000420: Dyck paths ⟶ ℤResult quality: 95% ●values known / values provided: 95%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => 2
[2]
 => [1,1,0,0,1,0]
 => 3
[1,1]
 => [1,0,1,1,0,0]
 => 3
[3]
 => [1,1,1,0,0,0,1,0]
 => 4
[2,1]
 => [1,0,1,0,1,0]
 => 5
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 4
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 5
[3,1]
 => [1,1,0,1,0,0,1,0]
 => 7
[2,2]
 => [1,1,0,0,1,1,0,0]
 => 6
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 7
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => 5
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 6
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => 9
[3,2]
 => [1,1,0,0,1,0,1,0]
 => 9
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => 9
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => 9
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 6
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => 7
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => 7
[7]
 => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 8
[1,1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => 8
Description
The number of Dyck paths that are weakly above a Dyck path.
Matching statistic: St000419
(load all 5 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000419: Dyck paths ⟶ ℤResult quality: 95% ●values known / values provided: 95%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => 1 = 2 - 1
[2]
 => [1,1,0,0,1,0]
 => 2 = 3 - 1
[1,1]
 => [1,0,1,1,0,0]
 => 2 = 3 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => 3 = 4 - 1
[2,1]
 => [1,0,1,0,1,0]
 => 4 = 5 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 3 = 4 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4 = 5 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => 6 = 7 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => 5 = 6 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 6 = 7 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4 = 5 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5 = 6 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => 8 = 9 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => 8 = 9 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => 8 = 9 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => 8 = 9 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 5 = 6 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => 6 = 7 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => 6 = 7 - 1
[7]
 => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 8 - 1
[1,1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => 7 = 8 - 1
Description
The number of Dyck paths that are weakly above the Dyck path, except for the path itself.
Matching statistic: St001664
Mapping
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001664: Posets ⟶ ℤResult quality: 95% ●values known / values provided: 95%●distinct values known / distinct values provided: 100%
Values
[1]
 => [[1]]
 => [1] => ([],1)
 => 2
[2]
 => [[1,2]]
 => [1,2] => ([(0,1)],2)
 => 3
[1,1]
 => [[1],[2]]
 => [2,1] => ([],2)
 => 3
[3]
 => [[1,2,3]]
 => [1,2,3] => ([(0,2),(2,1)],3)
 => 4
[2,1]
 => [[1,2],[3]]
 => [3,1,2] => ([(1,2)],3)
 => 5
[1,1,1]
 => [[1],[2],[3]]
 => [3,2,1] => ([],3)
 => 4
[4]
 => [[1,2,3,4]]
 => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
 => 5
[3,1]
 => [[1,2,3],[4]]
 => [4,1,2,3] => ([(1,2),(2,3)],4)
 => 7
[2,2]
 => [[1,2],[3,4]]
 => [3,4,1,2] => ([(0,3),(1,2)],4)
 => 6
[2,1,1]
 => [[1,2],[3],[4]]
 => [4,3,1,2] => ([(2,3)],4)
 => 7
[1,1,1,1]
 => [[1],[2],[3],[4]]
 => [4,3,2,1] => ([],4)
 => 5
[5]
 => [[1,2,3,4,5]]
 => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 6
[4,1]
 => [[1,2,3,4],[5]]
 => [5,1,2,3,4] => ([(1,4),(3,2),(4,3)],5)
 => 9
[3,2]
 => [[1,2,3],[4,5]]
 => [4,5,1,2,3] => ([(0,3),(1,4),(4,2)],5)
 => 9
[2,2,1]
 => [[1,2],[3,4],[5]]
 => [5,3,4,1,2] => ([(1,4),(2,3)],5)
 => 9
[2,1,1,1]
 => [[1,2],[3],[4],[5]]
 => [5,4,3,1,2] => ([(3,4)],5)
 => 9
[1,1,1,1,1]
 => [[1],[2],[3],[4],[5]]
 => [5,4,3,2,1] => ([],5)
 => 6
[6]
 => [[1,2,3,4,5,6]]
 => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 7
[1,1,1,1,1,1]
 => [[1],[2],[3],[4],[5],[6]]
 => [6,5,4,3,2,1] => ([],6)
 => 7
[7]
 => [[1,2,3,4,5,6,7]]
 => [1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => ? = 8
[1,1,1,1,1,1,1]
 => [[1],[2],[3],[4],[5],[6],[7]]
 => [7,6,5,4,3,2,1] => ([],7)
 => 8
Description
The number of non-isomorphic subposets of a poset.
Matching statistic: St000087
Mapping
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000087: Graphs ⟶ ℤResult quality: 88% ●values known / values provided: 90%●distinct values known / distinct values provided: 88%
Values
[1]
 => [[1]]
 => [1] => ([],1)
 => 1 = 2 - 1
[2]
 => [[1,2]]
 => [1,2] => ([],2)
 => 2 = 3 - 1
[1,1]
 => [[1],[2]]
 => [2,1] => ([(0,1)],2)
 => 2 = 3 - 1
[3]
 => [[1,2,3]]
 => [1,2,3] => ([],3)
 => 3 = 4 - 1
[2,1]
 => [[1,2],[3]]
 => [3,1,2] => ([(0,2),(1,2)],3)
 => 4 = 5 - 1
[1,1,1]
 => [[1],[2],[3]]
 => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3 = 4 - 1
[4]
 => [[1,2,3,4]]
 => [1,2,3,4] => ([],4)
 => 4 = 5 - 1
[3,1]
 => [[1,2,3],[4]]
 => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
 => 6 = 7 - 1
[2,2]
 => [[1,2],[3,4]]
 => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 5 = 6 - 1
[2,1,1]
 => [[1,2],[3],[4]]
 => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 6 = 7 - 1
[1,1,1,1]
 => [[1],[2],[3],[4]]
 => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4 = 5 - 1
[5]
 => [[1,2,3,4,5]]
 => [1,2,3,4,5] => ([],5)
 => 5 = 6 - 1
[4,1]
 => [[1,2,3,4],[5]]
 => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => 8 = 9 - 1
[3,2]
 => [[1,2,3],[4,5]]
 => [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 8 = 9 - 1
[2,2,1]
 => [[1,2],[3,4],[5]]
 => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 8 = 9 - 1
[2,1,1,1]
 => [[1,2],[3],[4],[5]]
 => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 8 = 9 - 1
[1,1,1,1,1]
 => [[1],[2],[3],[4],[5]]
 => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5 = 6 - 1
[6]
 => [[1,2,3,4,5,6]]
 => [1,2,3,4,5,6] => ([],6)
 => 6 = 7 - 1
[1,1,1,1,1,1]
 => [[1],[2],[3],[4],[5],[6]]
 => [6,5,4,3,2,1] => ([(0,1),(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)
 => 6 = 7 - 1
[7]
 => [[1,2,3,4,5,6,7]]
 => [1,2,3,4,5,6,7] => ([],7)
 => ? = 8 - 1
[1,1,1,1,1,1,1]
 => [[1],[2],[3],[4],[5],[6],[7]]
 => [7,6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 8 - 1
Description
The number of induced subgraphs. A subgraph $H \subseteq G$ is induced if $E(H)$ consists of all edges in $E(G)$ that connect the vertices of $H$.
Matching statistic: St001684
(load all 6 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001684: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 71%●distinct values known / distinct values provided: 88%
Values
[1]
 => [1,0,1,0]
 => [2,1] => 1 = 2 - 1
[2]
 => [1,1,0,0,1,0]
 => [3,1,2] => 2 = 3 - 1
[1,1]
 => [1,0,1,1,0,0]
 => [2,3,1] => 2 = 3 - 1
[3]
 => [1,1,1,0,0,0,1,0]
 => [4,1,2,3] => 3 = 4 - 1
[2,1]
 => [1,0,1,0,1,0]
 => [3,2,1] => 4 = 5 - 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [2,3,4,1] => 3 = 4 - 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [5,1,2,3,4] => 4 = 5 - 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [4,2,1,3] => 6 = 7 - 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [3,4,1,2] => 5 = 6 - 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [3,2,4,1] => 6 = 7 - 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => 4 = 5 - 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [6,1,2,3,4,5] => ? = 6 - 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [5,2,1,3,4] => 8 = 9 - 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [4,3,1,2] => 8 = 9 - 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [3,4,2,1] => 8 = 9 - 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => 8 = 9 - 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [2,3,4,5,6,1] => ? = 6 - 1
[6]
 => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => [7,1,2,3,4,5,6] => ? = 7 - 1
[1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
 => [2,3,4,5,6,7,1] => ? = 7 - 1
[7]
 => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => [8,1,2,3,4,5,6,7] => ? = 8 - 1
[1,1,1,1,1,1,1]
 => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => [2,3,4,5,6,7,8,1] => ? = 8 - 1
Description
The reduced word complexity of a permutation. For a permutation $\pi$, this is the smallest length of a word in simple transpositions that contains all reduced expressions of $\pi$. For example, the permutation $[3,2,1] = (12)(23)(12) = (23)(12)(23)$ and the reduced word complexity is $4$ since the smallest words containing those two reduced words as subwords are $(12),(23),(12),(23)$ and also $(23),(12),(23),(12)$. This statistic appears in [1, Question 6.1].
The following 48 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000071The number of maximal chains in a poset. St001645The pebbling number of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000909The number of maximal chains of maximal size in a poset. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001821The sorting index of a signed permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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$. St000080The rank of the poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001510The number of self-evacuating linear extensions of a finite poset. St001902The number of potential covers of a poset. St000528The height of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000906The length of the shortest maximal chain in a poset. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001782The order of rowmotion on the set of order ideals of a poset. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001926Sparre Andersen's position of the maximum of a signed permutation. St000739The first entry in the last row of a semistandard tableau. St001401The number of distinct entries in a semistandard tableau. St001569The maximal modular displacement of a permutation. St001686The order of promotion on a Gelfand-Tsetlin pattern. St000101The cocharge of a semistandard tableau. St000454The largest eigenvalue of a graph if it is integral. St001556The number of inversions of the third entry of a permutation. St001856The number of edges in the reduced word graph of a permutation. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000993The multiplicity of the largest part of an integer partition. 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$. St000681The Grundy value of Chomp on Ferrers diagrams. St000937The number of positive values of the symmetric group character corresponding to the partition.