The maximum magnitude of the Möbius function of a poset.
The Möbius function of a poset is the multiplicative inverse of the zeta function in the incidence algebra. The Möbius value $\mu(x, y)$ is equal to the signed sum of chains from $x$ to $y$, where odd-length chains are counted with a minus sign, so this statistic is bounded above by the total number of chains in the poset.

The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.

Sends a binary word $w_1\cdots w_m$ to the binary word $v_1 \cdots v_m$ with $v_i = w_i$ if $i$ is odd and $v_i = 1 - w_i$ if $i$ is even.
This map is used in [1], see Definitions 3.2 and 5.1.

The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.