Identifier
-
Mp00032:
Dyck paths
—inverse zeta map⟶
Dyck paths
St001509: Dyck paths ⟶ ℤ
Values
[1,0] => [1,0] => 0
[1,0,1,0] => [1,1,0,0] => 0
[1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[1,0,1,1,0,0] => [1,0,1,1,0,0] => 1
[1,1,0,0,1,0] => [1,1,0,1,0,0] => 1
[1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 1
[1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => 2
[1,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,0] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 1
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => 2
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => 2
[1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,0,0] => 2
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[1,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,0] => 2
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => 3
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 2
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => 3
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 3
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 3
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 3
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => 3
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 3
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 4
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 3
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => 3
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
>>> Load all 196 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary.
Given two lattice paths $U,L$ from $(0,0)$ to $(d,n-d)$, [1] describes a bijection between lattice paths weakly between $U$ and $L$ and subsets of $\{1,\dots,n\}$ such that the set of all such subsets gives the standard complex of the lattice path matroid $M[U,L]$.
This statistic gives the cardinality of the image of this bijection when a Dyck path is considered as a path weakly below the diagonal and relative to the trivial lower boundary.
Given two lattice paths $U,L$ from $(0,0)$ to $(d,n-d)$, [1] describes a bijection between lattice paths weakly between $U$ and $L$ and subsets of $\{1,\dots,n\}$ such that the set of all such subsets gives the standard complex of the lattice path matroid $M[U,L]$.
This statistic gives the cardinality of the image of this bijection when a Dyck path is considered as a path weakly below the diagonal and relative to the trivial lower boundary.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
searching the database
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!