- FindStat

Identifier

Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001509: Dyck paths ⟶ ℤ

Values

[1,0] => [1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 2
[1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0] => 2
[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] => 4
[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] => 4
[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] => 4
[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] => 4
[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] => 3
[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] => 4
[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] => 4
[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] => 4
[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] => 4
[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] => 3
[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] => 3
[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] => 3
[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] => 3
[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] => 5
[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] => 5
[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] => 5
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 5
[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] => 5
[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] => 4
[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] => 4
[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] => 4
[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] => 4
[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] => 3
[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] => 5
[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] => 5
[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] => 5
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 5
[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] => 5
[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] => 4
[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] => 4
[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] => 4
[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] => 4
[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] => 3
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 4
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 4
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 4
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 4
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => 3
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 3
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[] => [1,0] => [1,0] => 0

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

click to show known generating functions

$F_{1} = q$

$F_{2} = 2\ q^{2}$

$F_{3} = q^{2} + 4\ q^{3}$

$F_{4} = q^{2} + 5\ q^{3} + 8\ q^{4}$

$F_{5} = q^{2} + 7\ q^{3} + 18\ q^{4} + 16\ q^{5}$

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.

Map

prime Dyck path

Description

Return the Dyck path obtained by adding an initial up and a final down step.

Map

peeling map

Description

Send a Dyck path to its peeled Dyck path.