- FindStat

Identifier

Mp00056: Parking functions —to Dyck path⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000054: Permutations ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 18248 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 first entry of the permutation.
This can be described as 1 plus the number of occurrences of the vincular pattern ([2,1], {(0,0),(0,1),(0,2)}), i.e., the first column is shaded, see [1].
This statistic is related to the number of deficiencies St000703The number of deficiencies of a permutation. as follows: consider the arc diagram of a permutation $\pi$ of $n$, together with its rotations, obtained by conjugating with the long cycle $(1,\dots,n)$. Drawing the labels $1$ to $n$ in this order on a circle, and the arcs $(i, \pi(i))$ as straight lines, the rotation of $\pi$ is obtained by replacing each number $i$ by $(i\bmod n) +1$. Then, $\pi(1)-1$ is the number of rotations of $\pi$ where the arc $(1, \pi(1))$ is a deficiency. In particular, if $O(\pi)$ is the orbit of rotations of $\pi$, then the number of deficiencies of $\pi$ equals
$$ \frac{1}{|O(\pi)|}\sum_{\sigma\in O(\pi)} (\sigma(1)-1). $$

Map

to Dyck path

Description

Sends a parking function to its support Dyck word.

Map

to 312-avoiding permutation

Description

Sends a Dyck path to the 312-avoiding permutation according to Bandlow-Killpatrick.
This map is defined in [1] and sends the area (St000012The area of a Dyck path.) to the inversion number (St000018The number of inversions of a permutation.).