- FindStat

Identifier

Mp00131: Permutations —descent bottoms⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000306: Dyck paths ⟶ ℤ (values match St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: )

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Description

The bounce count of a Dyck path.
For a Dyck path $D$ of length $2n$, this is the number of points $(i,i)$ for $1 \leq i < n$ that are touching points of the bounce path of $D$.

Map

descent bottoms

Description

The descent bottoms of a permutation as a binary word.

Map

bounce path

Description

The bounce path determined by an integer composition.

Map

to composition

Description

The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.