The breadth of a permutation.
According to [1, Def.1.6], this is the minimal Manhattan distance between two ones in the permutation matrix of $\pi$: $$\min\{|i-j|+|\pi(i)-\pi(j)|: i\neq j\}.$$
According to [1, Def.1.3], a permutation $\pi$ is $k$-prolific, if the set of permutations obtained from $\pi$ by deleting any $k$ elements and standardising has maximal cardinality, i.e., $\binom{n}{k}$.
By [1, Thm.2.22], a permutation is $k$-prolific if and only if its breath is at least $k+2$.
By [1, Cor.4.3], the smallest permutations that are $k$-prolific have size $\lceil k^2+2k+1\rceil$, and by [1, Thm.4.4], there are $k$-prolific permutations of any size larger than this.
According to [2] the proportion of $k$-prolific permutations in the set of all permutations is asymptotically equal to $\exp(-k^2-k)$.

Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.

The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.

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)$.