\begin{table}[ht] \caption{The count in the proof of Proposition~\ref{prop:two}: for each value of $\alpha$ above $2$ and below $\alpha(Q)$, the sets $K$ that can carry it, by their size and $X$-part $(e_1(K),e_2(K))$, and the bound on the cost $m(K)$. A set is aligned if its pattern is $(1,1,1)$ or $(0,0,0)$.}\label{tab:costs} \centering\small \begin{tabular}{@{}llll@{}} \toprule class & value of $\alpha$ & size, $X$-part & cost at most\\ \midrule $\{1/2,2\}$ & $N$, $3\leq N\leq n$ & $N$, $(0,0)$ & $n-N$ if aligned (then $N\leq n-3$), else $2$\\ & & $N-1$, $(1,0)$ & $1$\\ & $N+\frac12$, $2\leq N\leq n-1$ & $N$, $(1,1)$ & $N$ if aligned (then $N\geq3$), else $2$\\ & & $N+1$, $(0,1)$ & $1$\\ \addlinespace $\{3/2,2\}$ & $N$, $3\leq N\leq n$ & $N$, $(0,0)$ & $n-N$ if aligned (then $N\leq n-3$), else $2$\\ & & $N-1$, $(1,0)$ & $1$\\ & $N+\frac12$, $2\leq N\leq n$ & $N$, $(0,1)$ & $1$\\ & & $N-1$, $(1,1)$, for $N\geq3$ & $N-1$ if aligned (then $N\geq4$), else $2$\\ \bottomrule \end{tabular} \end{table}