The hat guessing number of a graph.
Suppose that each vertex of a graph corresponds to a player, wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The hat guessing number $HG(G)$ of a graph $G$ is the largest integer $q$ such that there exists a guessing strategy guaranteeing at least one correct guess for any hat assignment of $q$ possible colors.
Because it suffices that a single player guesses correctly, the hat guessing number of a graph is the maximum of the hat guessing numbers of its connected components.

The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.

The DEX composition of a permutation.
Let $\pi$ be a permutation in $\mathfrak S_n$. Let $\bar\pi$ be the word in the ordered set $\bar 1 < \dots < \bar n < 1 \dots < n$ obtained from $\pi$ by replacing every excedance $\pi(i) > i$ by $\overline{\pi(i)}$. Then the DEX set of $\pi$ is the set of indices $1 \leq i < n$ such that $\bar\pi(i) > \bar\pi(i+1)$. Finally, the DEX composition $c_1, \dots, c_k$ of $n$ corresponds to the DEX subset $\{c_1, c_1 + c_2, \dots, c_1 + \dots + c_{k-1}\}$.
The (quasi)symmetric function
$$ \sum_{\pi\in\mathfrak S_{\lambda, j}} F_{DEX(\pi)}, $$
where the sum is over the set of permutations of cycle type $\lambda$ with $j$ excedances, is the Eulerian quasisymmetric function.

The conjugate of a composition.
The conjugate of a composition $C$ is defined as the complement (Mp00039complement) of the reversal (Mp00038reverse) of $C$.
Equivalently, the ribbon shape corresponding to the conjugate of $C$ is the conjugate of the ribbon shape of $C$.