The size of Bruhat intervals between nested involutions in \(S_{n}\) (Q2383530)

The author builds a chain \(\text{ id} = \vartheta_0 < \vartheta_1 < \cdots < \vartheta_{\lfloor \frac{n}{2} \rfloor}\) of nested involutions in the Bruhat order of the symmetric group \(S_n\), with \(\vartheta_{\lfloor \frac{n}{2} \rfloor}\) the maximal element for the Bruhat order. Then two enumerative results are presented: {\parindent=5mm \begin{itemize}\item[1)]The sizes of the Bruhat intervals \([\vartheta_j, \vartheta_k]\), \(0\leq j < k \leq \lfloor\frac{n}{2} \rfloor\), are computed . \item[2)]For each \(\vartheta_t\), \(0\leq t \leq \lfloor\frac{n}{2} \rfloor\) the number of permutations incomparable with it is computed. \end{itemize}} These results imply and generalize the result of [\textit{M. Pagliacci} and \textit{N. Zagaglia Salvi}, Bull. Inst. Comb. Appl. 48, 107--115 (2006; Zbl 1102.05063)].