searching the database
Your data matches 278 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: St001033
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 0
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
The normalized area of the parallelogram polyomino associated with the Dyck path.
The area of the smallest parallelogram polyomino equals the semilength of the Dyck path. This statistic is therefore the area of the parallelogram polyomino minus the semilength of the Dyck path.
The area itself is equidistributed with [[St001034]] and with [[St000395]].
Matching statistic: St001584
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
St001584: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 0
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
The area statistic between a Dyck path and its bounce path.
The bounce path [[Mp00099]] is weakly below a given Dyck path and this statistic records the number of boxes between the two paths.
Matching statistic: St000496
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 2
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 3
Description
The rcs statistic of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a '''rcs''' (right-closer-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a < b$.
Matching statistic: St001843
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St001843: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001843: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 2
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 1
Description
The Z-index of a set partition.
The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1\dots w_n$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$.
The Z-index of $w$ equals
$$
\sum_{i < j} w_{i,j},
$$
where $w_{i,j}$ is the word obtained from $w$ by removing all letters different from $i$ and $j$.
Matching statistic: St000394
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St001841
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St001841: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St001841: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => {{1}}
=> 0
[1,0,1,0]
=> [2,1] => [2,1] => {{1,2}}
=> 0
[1,1,0,0]
=> [1,2] => [1,2] => {{1},{2}}
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => [2,1,3] => {{1,2},{3}}
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => [3,2,1] => {{1,3},{2}}
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => [2,3,1] => {{1,2,3}}
=> 0
[1,1,0,1,0,0]
=> [1,3,2] => [1,3,2] => {{1},{2,3}}
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => {{1},{2},{3}}
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => {{1,2},{3,4}}
=> 0
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [3,2,4,1] => {{1,3,4},{2}}
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => {{1,2},{3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => {{1,3},{2},{4}}
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4,2,3,1] => {{1,4},{2},{3}}
=> 2
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [3,4,1,2] => {{1,3},{2,4}}
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [2,4,3,1] => {{1,2,4},{3}}
=> 2
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [2,3,1,4] => {{1,2,3},{4}}
=> 0
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => {{1},{2,3},{4}}
=> 0
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [1,4,3,2] => {{1},{2,4},{3}}
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [2,3,4,1] => {{1,2,3,4}}
=> 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,3,4,2] => {{1},{2,3,4}}
=> 0
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [1,2,4,3] => {{1},{2},{3,4}}
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [3,2,4,1,5] => {{1,3,4},{2},{5}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => {{1,2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => {{1,4},{2},{3,5}}
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [3,2,5,4,1] => {{1,3,5},{2},{4}}
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [2,1,4,5,3] => {{1,2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [3,2,4,5,1] => {{1,3,4,5},{2}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => {{1,3},{2},{4,5}}
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,2,3,5,1] => {{1,4,5},{2},{3}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => {{1,3},{2},{4},{5}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => {{1,4},{2},{3},{5}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => {{1,5},{2},{3},{4}}
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [3,4,1,2,5] => {{1,3},{2,4},{5}}
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [2,4,3,1,5] => {{1,2,4},{3},{5}}
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [3,5,1,4,2] => {{1,3},{2,5},{4}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [4,5,3,1,2] => {{1,4},{2,5},{3}}
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [2,5,3,4,1] => {{1,2,5},{3},{4}}
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [3,4,1,5,2] => {{1,3},{2,4,5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [2,4,3,5,1] => {{1,2,4,5},{3}}
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [1,4,3,5,2] => {{1},{2,4,5},{3}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => {{1},{2,5},{3},{4}}
=> 2
Description
The number of inversions of a set partition.
The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1\dots w_n\}$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$.
A pair $(i,j)$ is an inversion of the word $w$ if $w_i > w_j$.
Matching statistic: St000491
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000491: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000491: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> ? = 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 2
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 0
Description
The number of inversions of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1], see also [2,3], an inversion of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a < b$.
This statistic is called '''ros''' in [1, Definition 3] for "right, opener, smaller".
This is also the number of occurrences of the pattern {{1, 3}, {2}} such that 1 and 2 are minimal elements of blocks.
Matching statistic: St000497
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000497: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000497: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> ? = 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 2
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 0
Description
The lcb statistic of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a '''lcb''' (left-closer-bigger) of $S$ is given by a pair $i < j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a > b$.
Matching statistic: St000572
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000572: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000572: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> ? = 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 2
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 0
Description
The dimension exponent of a set partition.
This is
$$\sum_{B\in\pi} (\max(B) - \min(B) + 1) - n$$
where the summation runs over the blocks of the set partition $\pi$ of $\{1,\dots,n\}$.
It is thus equal to the difference [[St000728]] - [[St000211]].
This is also the number of occurrences of the pattern {{1, 3}, {2}}, such that 1 and 3 are consecutive elements in a block.
This is also the number of occurrences of the pattern {{1, 3}, {2}}, such that 1 is the minimal and 3 is the maximal element of the block.
Matching statistic: St000581
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000581: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000581: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> ? = 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 2
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 0
Description
The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal.
The following 268 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000356The number of occurrences of the pattern 13-2. St000809The reduced reflection length of the permutation. St001727The number of invisible inversions of a permutation. St000065The number of entries equal to -1 in an alternating sign matrix. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000039The number of crossings of a permutation. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001176The size of a partition minus its first part. St000935The number of ordered refinements of an integer partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000463The number of admissible inversions of a permutation. St001214The aft of an integer partition. St001377The major index minus the number of inversions of a permutation. St000355The number of occurrences of the pattern 21-3. St000358The number of occurrences of the pattern 31-2. St000454The largest eigenvalue of a graph if it is integral. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001083The number of boxed occurrences of 132 in a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St000874The position of the last double rise in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001500The global dimension of magnitude 1 Nakayama algebras. St000693The modular (standard) major index of a standard tableau. St001498The normalised height of a Nakayama algebra with magnitude 1. St000460The hook length of the last cell along the main diagonal of an integer partition. St000667The greatest common divisor of the parts of the partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001587Half of the largest even part of an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001933The largest multiplicity of a part in an integer partition. St000993The multiplicity of the largest part of an integer partition. St000223The number of nestings in the permutation. St000359The number of occurrences of the pattern 23-1. St000143The largest repeated part of a partition. St001571The Cartan determinant of the integer partition. St000145The Dyson rank of a partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000030The sum of the descent differences of a permutations. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St001311The cyclomatic number of a graph. St000456The monochromatic index of a connected graph. St001271The competition number of a graph. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001305The number of induced cycles on four vertices in a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St000363The number of minimal vertex covers of a graph. St001304The number of maximally independent sets of vertices of a graph. St001725The harmonious chromatic number of a graph. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001432The order dimension of the partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001525The number of symmetric hooks on the diagonal of a partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000800The number of occurrences of the vincular pattern |231 in a permutation. 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. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. 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. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000100The number of linear extensions of a poset. St000089The absolute variation of a composition. St001330The hat guessing number of a graph. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (2,3) are consecutive in a block. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. 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. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001438The number of missing boxes of a skew partition. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000770The major index of an integer partition when read from bottom to top. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St001470The cyclic holeyness of a permutation. St001568The smallest positive integer that does not appear twice in the partition. St001964The interval resolution global dimension of a poset. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000624The normalized sum of the minimal distances to a greater element. St000650The number of 3-rises of a permutation. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000850The number of 1/2-balanced pairs in a poset. St000872The number of very big descents of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001731The factorization defect of 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. 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. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001117The game chromatic index of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001742The difference of the maximal and the minimal degree in a graph. St001812The biclique partition number of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001510The number of self-evacuating linear extensions of a finite poset. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000909The number of maximal chains of maximal size in a poset. St000632The jump number of the 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. St001435The number of missing boxes in the first row. St001624The breadth of a lattice. St000307The number of rowmotion orbits of a poset. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000731The number of double exceedences of a permutation. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000028The number of stack-sorts needed to sort a permutation. St000451The length of the longest pattern of the form k 1 2. St001948The number of augmented double ascents of a permutation. St000527The width of the poset. St001423The number of distinct cubes in a binary word. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001397Number of pairs of incomparable elements in a finite poset. St001902The number of potential covers of a poset. St000908The length of the shortest maximal antichain in a poset. St001268The size of the largest ordinal summand in the poset. St001399The distinguishing number of a poset. St001472The permanent of the Coxeter matrix of the poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000769The major index of a composition regarded as a word. St000455The second largest eigenvalue of a graph if it is integral. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St000766The number of inversions of an integer composition. St001868The number of alignments of type NE of a signed permutation. St000181The number of connected components of the Hasse diagram for the poset. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001846The number of elements which do not have a complement in the lattice. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000352The Elizalde-Pak rank of a permutation. St001720The minimal length of a chain of small intervals in a lattice. St000741The Colin de Verdière graph invariant. St001398Number of subsets of size 3 of elements in a poset that form a "v". St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St001779The order of promotion on the set of linear extensions of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000058The order of a permutation. 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$. St001820The size of the image of the pop stack sorting operator. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000264The girth of a graph, which is not a tree. St001864The number of excedances of a signed permutation. St000768The number of peaks in an integer composition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001060The distinguishing index of a graph. St001487The number of inner corners of a skew partition. St001115The number of even descents of a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St000920The logarithmic height of a Dyck path. St000091The descent variation of a composition. St000988The orbit size of a permutation under Foata's bijection. St000516The number of stretching pairs of a permutation. St000074The number of special entries. St000237The number of small exceedances. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000534The number of 2-rises of a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000873The aix statistic of a permutation. St000884The number of isolated descents of a permutation. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001394The genus of a permutation. St001569The maximal modular displacement of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001821The sorting index of a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St000031The number of cycles in the cycle decomposition of a permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000711The number of big exceedences of a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. 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)$. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000764The number of strong records in an integer composition. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000883The number of longest increasing subsequences of a permutation.
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!