searching the database
Your data matches 434 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: St000032
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
St000032: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> 3
[1,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> 6
Description
The number of elements smaller than the given Dyck path in the Tamari Order.
Matching statistic: St000082
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000082: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000082: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 3
[1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 3
[1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 4
[1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 3
[1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [[[.,.],[[.,.],.]],.]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[[[.,.],.],.]],.]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [[[[.,.],.],.],[[.,.],.]]
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[[[.,.],.],[.,.]],[.,.]]
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[[[.,.],.],[[.,.],.]],.]
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [[[.,.],.],[[[.,.],.],.]]
=> 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[[[.,.],[.,.]],.],[.,.]]
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[[[.,.],[.,.]],[.,.]],.]
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[[.,.],[.,.]],[[.,.],.]]
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[[[.,.],[[.,.],.]],.],.]
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[[.,.],[[.,.],.]],[.,.]]
=> 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[[.,.],[[[.,.],.],.]],.]
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [[.,.],[[[[.,.],.],.],.]]
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [[[[.,[.,.]],.],.],[.,.]]
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [[[[.,[.,.]],.],[.,.]],.]
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [[[.,[.,.]],.],[[.,.],.]]
=> 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [[[[.,[.,.]],[.,.]],.],.]
=> 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [[[.,[.,.]],[[.,.],.]],.]
=> 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [[[[.,[[.,.],.]],.],.],.]
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [[[.,[[.,.],.]],.],[.,.]]
=> 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [[[.,[[.,.],.]],[.,.]],.]
=> 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [[[.,[[[.,.],.],.]],.],.]
=> 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [[.,[[[[.,.],.],.],.]],.]
=> 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [.,[[[[[.,.],.],.],.],.]]
=> 6
Description
The number of elements smaller than a binary tree in Tamari order.
Matching statistic: St000110
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000110: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000110: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 6
Description
The number of permutations less than or equal to a permutation in left weak order.
This is the same as the number of permutations less than or equal to the given permutation in right weak order.
Matching statistic: St001346
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001346: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001346: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,1,3] => 3
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 4
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 3
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 6
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 6
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,2,1] => 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,2,1] => 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,3,1] => 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,6,2,3,1] => 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,6,3,2,4,1] => 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,5,1] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,6,1] => 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,1,2] => 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,1,2] => 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,1,2] => 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,1,2] => 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,1,2] => 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,6,4,2,1,3] => 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,1,3] => 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,4] => 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,1,5] => 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,1,6] => 6
Description
The number of parking functions that give the same permutation.
A '''parking function''' (a1,…,an) is a list of preferred parking spots of n cars entering a one-way street. Once the cars have parked, the order of the cars gives a permutation of {1,…,n}. This statistic records the number of parking functions that yield the same permutation of cars.
Matching statistic: St001464
(load all 25 compositions to match this statistic)
(load all 25 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St001464: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001464: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 6
Description
The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise.
Matching statistic: St000071
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000071: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000071: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 3
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> 3
[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,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> 3
[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,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> 4
[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,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,3),(0,4),(1,7),(2,6),(3,8),(4,8),(5,1),(5,6),(6,7),(8,2),(8,5)],9)
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ([(0,4),(0,5),(1,8),(2,6),(3,6),(4,7),(5,1),(5,7),(7,8),(8,2),(8,3)],9)
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
=> 5
[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]
=> ([(0,5),(1,8),(2,7),(3,6),(4,1),(4,7),(5,3),(6,2),(6,4),(7,8)],9)
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> ([(0,5),(1,8),(2,8),(3,7),(4,7),(5,6),(6,1),(6,2),(8,3),(8,4)],9)
=> 4
[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,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9)
=> 3
[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),(1,7),(2,8),(3,4),(3,7),(4,2),(4,9),(5,6),(6,1),(6,3),(7,9),(9,8)],10)
=> 4
[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,6),(1,8),(2,8),(3,7),(4,7),(5,3),(5,4),(6,1),(6,2),(8,5)],9)
=> 4
[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,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9)
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> ([(0,6),(1,9),(2,9),(3,8),(4,7),(5,3),(5,7),(6,1),(6,2),(7,8),(9,4),(9,5)],10)
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9)
=> 3
[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,6),(1,9),(2,7),(3,7),(4,8),(5,1),(5,8),(6,4),(6,5),(8,9),(9,2),(9,3)],10)
=> 6
[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,6),(2,9),(3,7),(4,2),(4,8),(5,4),(5,7),(6,3),(6,5),(7,8),(8,9),(9,1)],10)
=> 4
[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,6),(1,7),(2,8),(3,4),(3,7),(4,5),(4,10),(5,2),(5,9),(6,1),(6,3),(7,10),(9,8),(10,9)],11)
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,7),(2,7),(3,8),(4,8),(5,6),(6,1),(6,2),(8,5)],9)
=> 4
[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]
=> ([(0,4),(0,5),(2,8),(3,8),(4,7),(5,7),(6,2),(6,3),(7,6),(8,1)],9)
=> 4
[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,3),(0,4),(1,9),(2,8),(3,7),(4,7),(5,1),(5,8),(6,2),(6,5),(7,6),(8,9)],10)
=> 6
[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,4),(0,5),(2,7),(3,7),(4,8),(5,8),(6,1),(7,6),(8,2),(8,3)],9)
=> 4
[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]
=> ([(0,4),(0,5),(1,8),(3,7),(4,9),(5,9),(6,1),(6,7),(7,8),(8,2),(9,3),(9,6)],10)
=> 6
[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]
=> ([(0,3),(0,6),(1,8),(3,7),(4,2),(5,4),(6,1),(6,7),(7,8),(8,5)],9)
=> 3
[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),(1,9),(2,7),(3,7),(4,8),(5,1),(5,8),(6,2),(6,3),(8,9),(9,6)],10)
=> 6
[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,5),(0,6),(1,8),(2,8),(4,9),(5,7),(6,4),(6,7),(7,9),(8,3),(9,1),(9,2)],10)
=> 6
[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]
=> ([(0,3),(0,6),(2,8),(3,7),(4,2),(4,9),(5,1),(6,4),(6,7),(7,9),(8,5),(9,8)],10)
=> 4
[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]
=> ([(0,3),(0,6),(2,10),(3,7),(4,5),(4,9),(5,2),(5,8),(6,4),(6,7),(7,9),(8,10),(9,8),(10,1)],11)
=> 5
[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,2),(0,6),(1,8),(2,7),(3,5),(3,9),(4,3),(4,11),(5,1),(5,10),(6,4),(6,7),(7,11),(9,10),(10,8),(11,9)],12)
=> 6
Description
The number of maximal chains in a poset.
Matching statistic: St000100
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000100: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
St000100: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(0,4),(3,2),(4,1),(4,3)],5)
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(0,2),(0,4),(3,1),(4,3)],5)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(0,4),(3,2),(4,5),(5,1),(5,3)],6)
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2)],6)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(0,5),(3,4),(4,2),(5,1),(5,3)],6)
=> 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => ([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => ([(0,2),(0,3),(2,4),(2,5),(3,4),(3,5),(5,1)],6)
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => ([(0,2),(0,3),(1,4),(1,5),(2,4),(2,5),(3,1)],6)
=> 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(0,2),(0,5),(3,4),(4,1),(5,3)],6)
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => ([(0,5),(1,5),(4,2),(4,3),(5,4)],6)
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => ([(0,4),(1,4),(2,5),(3,5),(4,2),(4,3)],6)
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => ([(0,5),(1,5),(4,2),(5,3),(5,4)],6)
=> 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => ([(0,4),(0,5),(1,4),(1,5),(3,2),(4,3),(5,3)],6)
=> 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => ([(0,5),(1,2),(2,5),(5,3),(5,4)],6)
=> 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => ([(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => ([(0,5),(1,4),(2,5),(4,2),(5,3)],6)
=> 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
=> 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => ([(1,5),(3,4),(4,2),(5,3)],6)
=> 6
Description
The number of linear extensions of a poset.
Matching statistic: St000468
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000468: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St000468: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => ([(2,5),(3,4)],6)
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(2,5),(3,5),(4,5)],6)
=> 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => ([(2,5),(3,4)],6)
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => ([(2,5),(3,4)],6)
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => ([(2,5),(3,5),(4,5)],6)
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => ([(2,5),(3,4)],6)
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => ([(2,5),(3,4)],6)
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => ([(2,5),(3,4)],6)
=> 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => ([(3,5),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => ([(1,2),(3,5),(4,5)],6)
=> 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => ([(2,5),(3,5),(4,5)],6)
=> 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 6
Description
The Hosoya index of a graph.
This is the total number of matchings in the graph.
Matching statistic: St000708
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000708: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
St000708: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5]
=> 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [3,1,1,1]
=> 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [2,2,1,1]
=> 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [3,1,1,1]
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [4,1,1]
=> 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [2,2,1,1]
=> 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => [2,2,1,1]
=> 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => [3,2,1]
=> 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [3,1,1,1]
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => [3,2,1]
=> 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [4,1,1]
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [5,1]
=> 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,2,1,1]
=> 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,2,1,1]
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [3,2,1]
=> 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [2,2,1,1]
=> 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => [3,2,1]
=> 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [3,1,1,1]
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [3,2,1]
=> 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => [3,2,1]
=> 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => [4,1,1]
=> 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => [5,1]
=> 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => [6]
=> 6
Description
The product of the parts of an integer partition.
Matching statistic: St000883
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000883: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000883: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,3,2,1] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => 5
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,6,5,4] => 3
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [1,2,4,3,6,5] => 4
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,5,4,3,6] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,6,5,4,3] => 4
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => 4
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => [1,3,2,5,4,6] => 4
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => [1,3,2,6,5,4] => 6
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,4,3,2,5,6] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => [1,4,3,2,6,5] => 6
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,5,4,3,2,6] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,6,5,4,3,2] => 5
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,1,3,4,6,5] => 4
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [2,1,3,6,5,4] => 6
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [2,1,4,3,5,6] => 4
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => [2,1,5,4,3,6] => 6
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [3,2,1,4,5,6] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [3,2,1,4,6,5] => 6
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => [3,2,1,5,4,6] => 6
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => [4,3,2,1,5,6] => 4
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => [5,4,3,2,1,6] => 5
[1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => [6,5,4,3,2,1] => 6
Description
The number of longest increasing subsequences of a permutation.
The following 424 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001814The number of partitions interlacing the given partition. St001959The product of the heights of the peaks of a Dyck path. St000548The number of different non-empty partial sums of an integer partition. St000189The number of elements in the poset. St000363The number of minimal vertex covers of a graph. St000656The number of cuts of a poset. St000909The number of maximal chains of maximal size in a poset. St000910The number of maximal chains of minimal length in a poset. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001717The largest size of an interval in a poset. St001813The product of the sizes of the principal order filters in a poset. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001377The major index minus the number of inversions of a permutation. St000456The monochromatic index of a connected graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000255The number of reduced Kogan faces with the permutation as type. St001684The reduced word complexity of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001220The width of a permutation. St000741The Colin de Verdière graph invariant. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000454The largest eigenvalue of a graph if it is integral. St001330The hat guessing number of a graph. St001964The interval resolution global dimension of a poset. St001889The size of the connectivity set of a signed permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length 3. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St000422The energy of a graph, if it is integral. St001060The distinguishing index of a graph. St000264The girth of a graph, which is not a tree. St000291The number of descents of a binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001118The acyclic chromatic index of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001644The dimension of a graph. St001875The number of simple modules with projective dimension at most 1. 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. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St000455The second largest eigenvalue of a graph if it is integral. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. 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. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001769The reflection length of a signed permutation. St001864The number of excedances of a signed permutation. St001260The permanent of an alternating sign matrix. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001597The Frobenius rank of a skew partition. St001861The number of Bruhat lower covers of a permutation. St001894The depth of a signed permutation. St001596The number of two-by-two squares inside a skew partition. St000392The length of the longest run of ones in a binary word. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St000982The length of the longest constant subword. St000764The number of strong records in an integer composition. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001487The number of inner corners of a skew partition. St000768The number of peaks in an integer composition. St000031The number of cycles in the cycle decomposition of a permutation. St000308The height of the tree associated to a permutation. St001488The number of corners of a skew partition. St000691The number of changes of a binary word. 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. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001645The pebbling number of a connected graph. St001863The number of weak excedances of a signed permutation. St000306The bounce count of a Dyck path. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St000863The length of the first row of the shifted shape of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. 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]/(xn). St001267The length of the Lyndon factorization of the binary word. St001801Half the number of preimage-image pairs of different parity in a permutation. St001171The vector space dimension of Ext1A(Io,A) when Io is the tilting module corresponding to the permutation o in the Auslander algebra A of K[x]/(xn). St001520The number of strict 3-descents. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001823The Stasinski-Voll length of a signed permutation. St000649The number of 3-excedences of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001948The number of augmented double ascents of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000062The length of the longest increasing subsequence of the permutation. St000117The number of centered tunnels of a Dyck path. St000144The pyramid weight of the Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000325The width of the tree associated to a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000381The largest part of an integer composition. St000451The length of the longest pattern of the form k 1 2. St000470The number of runs in a permutation. St000619The number of cyclic descents of a permutation. St000652The maximal difference between successive positions of a permutation. St000670The reversal length of a permutation. St000717The number of ordinal summands of a poset. St000742The number of big ascents of a permutation after prepending zero. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000808The number of up steps of the associated bargraph. St000840The number of closers smaller than the largest opener in a perfect matching. St000876The number of factors in the Catalan decomposition of a binary word. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000983The length of the longest alternating subword. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant 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. 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. 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. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of projdim(S)+injdim(S) over all simple modules in the Nakayama algebra corresponding to the Dyck path. 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. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001298The number of repeated entries in the Lehmer code of a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001424The number of distinct squares in a binary word. St001437The flex of a binary word. St001481The minimal height of a peak of a Dyck path. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001727The number of invisible inversions of a permutation. St000021The number of descents of a permutation. St000039The number of crossings of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000141The maximum drop size of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. 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. St000216The absolute length of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000238The number of indices that are not small weak excedances. St000240The number of indices that are not small excedances. St000242The number of indices that are not cyclical small weak excedances. St000245The number of ascents of a permutation. St000314The number of left-to-right-maxima of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000443The number of long tunnels of a Dyck path. St000653The last descent of a permutation. St000735The last entry on the main diagonal of a standard tableau. St000740The last entry of a permutation. St000746The number of pairs with odd minimum in a perfect matching. St000765The number of weak records in an integer composition. St000789The number of crossing-similar perfect matchings of a perfect matching. St000837The number of ascents of distance 2 of a permutation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000904The maximal number of repetitions of an integer composition. St000921The number of internal inversions of a binary word. St000942The number of critical left to right maxima of the parking functions. St000956The maximal displacement of a permutation. St000963The 2-shifted major index of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001096The size of the overlap set of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001209The pmaj statistic of a parking function. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001388The number of non-attacking neighbors of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001391The disjunction number of a graph. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001417The length of a longest palindromic subword of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001462The number of factors of a standard tableaux under concatenation. St001497The position of the largest weak excedence of a permutation. St001517The length of a longest pair of twins in a permutation. St001524The degree of symmetry of a binary word. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001557The number of inversions of the second entry of a permutation. St001624The breadth of a lattice. St001668The number of points of the poset minus the width of the poset. St001730The number of times the path corresponding to a binary word crosses the base line. St001760The number of prefix or suffix reversals needed to sort a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001777The number of weak descents in an integer composition. St001811The Castelnuovo-Mumford regularity of a permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between eiJ and ejJ (the radical of the indecomposable projective modules). St001884The number of borders of a binary word. St000023The number of inner peaks of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000120The number of left tunnels of a Dyck path. St000136The dinv of a parking function. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000223The number of nestings in the permutation. St000297The number of leading ones in a binary word. St000307The number of rowmotion orbits of a poset. St000317The cycle descent number of a permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000331The number of upper interactions of a Dyck path. St000338The number of pixed points of a permutation. St000353The number of inner valleys of a permutation. St000628The balance of a binary word. St000654The first descent of a permutation. St000657The smallest part of an integer composition. St000673The number of non-fixed points of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000779The tier of a permutation. St000805The number of peaks of the associated bargraph. St000872The number of very big descents of a permutation. St000899The maximal number of repetitions of an integer composition. St000902 The minimal number of repetitions of an integer composition. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001002Number of indecomposable modules with projective and injective dimension at most 1 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. St001114The number of odd descents of a permutation. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn−1] such that n=c0<ci 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. 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. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001344The neighbouring number of a permutation. St001375The pancake length of a permutation. St001394The genus of a permutation. St001399The distinguishing number of a poset. St001413Half the length of the longest even length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001470The cyclic holeyness of a permutation. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001556The number of inversions of the third entry of a permutation. St001569The maximal modular displacement of a permutation. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001665The number of pure excedances of a permutation. 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. St001712The number of natural descents of a standard Young tableau. St001729The number of visible descents of a permutation. St001768The number of reduced words of a signed permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001820The size of the image of the pop stack sorting operator. St001821The sorting index of a signed permutation. St001822The number of alignments of a signed permutation. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001866The nesting alignments of a signed permutation. St001903The number of fixed points of a parking function. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001937The size of the center of a parking function. St001946The number of descents in a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St000017The number of inversions of a standard tableau. St000296The length of the symmetric border of a binary word. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000393The number of strictly increasing runs in a binary word. St000488The number of cycles of a permutation of length at most 2. St000516The number of stretching pairs of a permutation. St000626The minimal period of a binary word. St000650The number of 3-rises of a permutation. St000664The number of right ropes of a permutation. St000732The number of double deficiencies of a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000754The Grundy value for the game of removing nestings in a perfect matching. St000761The number of ascents in an integer composition. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000850The number of 1/2-balanced pairs in a poset. St000873The aix statistic of a permutation. St000877The depth of the binary word interpreted as a path. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001082The number of boxed occurrences of 123 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001396Number of triples of incomparable elements in a finite poset. St001435The number of missing boxes in the first row. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001845The number of join irreducibles minus the rank of a lattice. St001847The number of occurrences of the pattern 1432 in a permutation. St001856The number of edges in the reduced word graph of a permutation. St000226The convexity of a permutation. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St000259The diameter of a connected graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. 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. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000035The number of left outer peaks of a permutation. St000153The number of adjacent cycles of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000237The number of small exceedances. St000374The number of exclusive right-to-left minima of a permutation. St000522The number of 1-protected nodes of a rooted tree. St000528The height of a poset. St000647The number of big descents of a permutation. St000703The number of deficiencies of a permutation. St000906The length of the shortest maximal chain in a poset. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001618The cardinality of the Frattini sublattice of a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000080The rank of the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000356The number of occurrences of the pattern 13-2. St000521The number of distinct subtrees of an ordered tree. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000679The pruning number of an ordered tree. St000834The number of right outer peaks of a permutation. St000871The number of very big ascents of a permutation. St000907The number of maximal antichains of minimal length in a poset. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001498The normalised height of a Nakayama algebra with magnitude 1. St001616The number of neutral elements in a lattice. St000366The number of double descents of a permutation. St000908The length of the shortest maximal antichain in a poset. St000911The number of maximal antichains of maximal size in a poset. St000914The sum of the values of the Möbius function of a poset. St001115The number of even descents of a permutation. St001490The number of connected components of a skew partition. St001613The binary logarithm of the size of the center of a lattice. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001301The first Betti number of the order complex associated with the poset. St001438The number of missing boxes of a skew partition. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001631The number of simple modules S with dimExt1(S,A)=1 in the incidence algebra A of the poset. St001862The number of crossings of a signed permutation. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000632The jump number of the poset. St000884The number of isolated descents of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St000054The first entry of the permutation. St000327The number of cover relations in a poset. St000402Half the size of the symmetry class of a permutation. St000417The size of the automorphism group of the ordered tree. St000463The number of admissible inversions of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000635The number of strictly order preserving maps of a poset into itself. St000662The staircase size of the code of a permutation. St000842The breadth of a permutation. St000862The number of parts of the shifted shape of a permutation. St001058The breadth of the ordered tree. St001581The achromatic number of a graph. St001632The number of indecomposable injective modules I with dimExt1(I,A)=1 for the incidence algebra A of a poset. St001637The number of (upper) dissectors of a poset. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000181The number of connected components of the Hasse diagram for the poset. St000352The Elizalde-Pak rank of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000383The last part of an integer composition. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001621The number of atoms of a lattice. St001890The maximum magnitude of the Möbius function of a poset. St000119The number of occurrences of the pattern 321 in a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in 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. St000546The number of global descents of a permutation. St001846The number of elements which do not have a complement in the lattice. St001833The number of linear intervals in a lattice.
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!