- FindStat

Identifier

Mp00027: Dyck paths —to partition⟶ Integer partitions
St000377: Integer partitions ⟶ ℤ

Values

[1,0] => [] => 0

[1,0,1,0] => [1] => 0

[1,1,0,0] => [] => 0

[1,0,1,0,1,0] => [2,1] => 0

[1,0,1,1,0,0] => [1,1] => 1

[1,1,0,0,1,0] => [2] => 0

[1,1,0,1,0,0] => [1] => 0

[1,1,1,0,0,0] => [] => 0

[1,0,1,0,1,0,1,0] => [3,2,1] => 0

[1,0,1,0,1,1,0,0] => [2,2,1] => 2

[1,0,1,1,0,0,1,0] => [3,1,1] => 1

[1,0,1,1,0,1,0,0] => [2,1,1] => 2

[1,0,1,1,1,0,0,0] => [1,1,1] => 2

[1,1,0,0,1,0,1,0] => [3,2] => 0

[1,1,0,0,1,1,0,0] => [2,2] => 1

[1,1,0,1,0,0,1,0] => [3,1] => 0

[1,1,0,1,0,1,0,0] => [2,1] => 0

[1,1,0,1,1,0,0,0] => [1,1] => 1

[1,1,1,0,0,0,1,0] => [3] => 1

[1,1,1,0,0,1,0,0] => [2] => 0

[1,1,1,0,1,0,0,0] => [1] => 0

[1,1,1,1,0,0,0,0] => [] => 0

[1,0,1,0,1,0,1,0,1,0] => [4,3,2,1] => 0

[1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => 3

[1,0,1,0,1,1,0,0,1,0] => [4,2,2,1] => 2

[1,0,1,0,1,1,0,1,0,0] => [3,2,2,1] => 4

[1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 4

[1,0,1,1,0,0,1,0,1,0] => [4,3,1,1] => 1

[1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3

[1,0,1,1,0,1,0,0,1,0] => [4,2,1,1] => 2

[1,0,1,1,0,1,0,1,0,0] => [3,2,1,1] => 3

[1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => 4

[1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => 3

[1,0,1,1,1,0,0,1,0,0] => [3,1,1,1] => 3

[1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => 3

[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 3

[1,1,0,0,1,0,1,0,1,0] => [4,3,2] => 0

[1,1,0,0,1,0,1,1,0,0] => [3,3,2] => 2

[1,1,0,0,1,1,0,0,1,0] => [4,2,2] => 1

[1,1,0,0,1,1,0,1,0,0] => [3,2,2] => 2

[1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 3

[1,1,0,1,0,0,1,0,1,0] => [4,3,1] => 0

[1,1,0,1,0,0,1,1,0,0] => [3,3,1] => 1

[1,1,0,1,0,1,0,0,1,0] => [4,2,1] => 0

[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => 0

[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => 2

[1,1,0,1,1,0,0,0,1,0] => [4,1,1] => 2

[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => 1

[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => 2

[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => 2

[1,1,1,0,0,0,1,0,1,0] => [4,3] => 2

[1,1,1,0,0,0,1,1,0,0] => [3,3] => 2

[1,1,1,0,0,1,0,0,1,0] => [4,2] => 1

[1,1,1,0,0,1,0,1,0,0] => [3,2] => 0

[1,1,1,0,0,1,1,0,0,0] => [2,2] => 1

[1,1,1,0,1,0,0,0,1,0] => [4,1] => 2

[1,1,1,0,1,0,0,1,0,0] => [3,1] => 0

[1,1,1,0,1,0,1,0,0,0] => [2,1] => 0

[1,1,1,0,1,1,0,0,0,0] => [1,1] => 1

[1,1,1,1,0,0,0,0,1,0] => [4] => 2

[1,1,1,1,0,0,0,1,0,0] => [3] => 1

[1,1,1,1,0,0,1,0,0,0] => [2] => 0

[1,1,1,1,0,1,0,0,0,0] => [1] => 0

[1,1,1,1,1,0,0,0,0,0] => [] => 0

[1,0,1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 0

[1,0,1,0,1,0,1,0,1,1,0,0] => [4,4,3,2,1] => 4

[1,0,1,0,1,0,1,1,0,0,1,0] => [5,3,3,2,1] => 3

[1,0,1,0,1,0,1,1,0,1,0,0] => [4,3,3,2,1] => 6

[1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 6

[1,0,1,0,1,1,0,0,1,0,1,0] => [5,4,2,2,1] => 2

[1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 5

[1,0,1,0,1,1,0,1,0,0,1,0] => [5,3,2,2,1] => 4

[1,0,1,0,1,1,0,1,0,1,0,0] => [4,3,2,2,1] => 6

[1,0,1,0,1,1,0,1,1,0,0,0] => [3,3,2,2,1] => 7

[1,0,1,0,1,1,1,0,0,0,1,0] => [5,2,2,2,1] => 5

[1,0,1,0,1,1,1,0,0,1,0,0] => [4,2,2,2,1] => 6

[1,0,1,0,1,1,1,0,1,0,0,0] => [3,2,2,2,1] => 6

[1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => 6

[1,0,1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,1] => 1

[1,0,1,1,0,0,1,0,1,1,0,0] => [4,4,3,1,1] => 4

[1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => 3

[1,0,1,1,0,0,1,1,0,1,0,0] => [4,3,3,1,1] => 5

[1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 6

[1,0,1,1,0,1,0,0,1,0,1,0] => [5,4,2,1,1] => 2

[1,0,1,1,0,1,0,0,1,1,0,0] => [4,4,2,1,1] => 4

[1,0,1,1,0,1,0,1,0,0,1,0] => [5,3,2,1,1] => 3

[1,0,1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,1] => 4

[1,0,1,1,0,1,0,1,1,0,0,0] => [3,3,2,1,1] => 6

[1,0,1,1,0,1,1,0,0,0,1,0] => [5,2,2,1,1] => 5

[1,0,1,1,0,1,1,0,0,1,0,0] => [4,2,2,1,1] => 5

[1,0,1,1,0,1,1,0,1,0,0,0] => [3,2,2,1,1] => 6

[1,0,1,1,0,1,1,1,0,0,0,0] => [2,2,2,1,1] => 6

[1,0,1,1,1,0,0,0,1,0,1,0] => [5,4,1,1,1] => 4

[1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => 5

[1,0,1,1,1,0,0,1,0,0,1,0] => [5,3,1,1,1] => 4

[1,0,1,1,1,0,0,1,0,1,0,0] => [4,3,1,1,1] => 4

[1,0,1,1,1,0,0,1,1,0,0,0] => [3,3,1,1,1] => 5

[1,0,1,1,1,0,1,0,0,0,1,0] => [5,2,1,1,1] => 5

[1,0,1,1,1,0,1,0,0,1,0,0] => [4,2,1,1,1] => 4

[1,0,1,1,1,0,1,0,1,0,0,0] => [3,2,1,1,1] => 4

[1,0,1,1,1,0,1,1,0,0,0,0] => [2,2,1,1,1] => 5

>>> Load all 1008 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

click to show known generating functions

$F_{1} = 1$

$F_{2} = 2$

$F_{3} = 4 + q$

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

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

$F_{6} = 16 + 13\ q + 22\ q^{2} + 27\ q^{3} + 28\ q^{4} + 15\ q^{5} + 10\ q^{6} + q^{7}$

Description

The dinv defect of an integer partition.
This is the number of cells

$c$ in the diagram of an integer partition

$\lambda$ for which

$\operatorname{arm}(c)-\operatorname{leg}(c) \not\in \{0,1\}$ .

Map

to partition

Description

The cut-out partition of a Dyck path.
The partition

$\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition

$(n-1,\ldots,2,1)$ when cutting out

$D$ considered as a path from

$(0,0)$ to

$(n,n)$ .
In other words,

$\lambda_{i}$ is the number of down-steps before the

$(n+1-i)$ -th up-step of

$D$ .
This map is a bijection between Dyck paths of size

$n$ and partitions inside the staircase partition

$(n-1,\ldots,2,1)$ .