Common intervals of permutations
The set \(I\subseteq [n]\) is called a \(2\)-interval of \([n]\) of length \(k\) if \(I\) is the set of integers \(\{i_1,\dots,i_k\}\) with \(1\leq i_{r+1} - i_r \leq 2\) for each \(1\leq r\leq k-1\). Such a set is called \(2\)-interval of length \(k\) of a permutation \(G\) if both \(I\) and \(G^{-1}(I)\) are \(2\)-intervals. Let \(G\) be a permutation chosen uniformly at random from the set of all permutations of \([n]\). The main purpose of the paper is to investigate the asymptotic properties of the random variables \(X^{(2)}_2\) and \(X^{(2)}\), where \(X^{(2)}_2\) counts the number of \(2\)-intervals of length \(2\) in \(G\), and \(X^{(2)}\) counts the number of \(2\)-intervals of any length in \(G\). For the entire collection see [Zbl 1047.68003].
This page was built for publication: Common intervals of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154658)
