Tableaux and chains in a new partial order of \(S_ n\) (Q1119668)

The set of all permutations of the set ṉ\(=\{1,...,n\}\) may be partially ordered by the rule \(\sigma\leq \tau \Leftrightarrow (I(\sigma)\subseteq I(\tau)\) and if (j,i)\(\in I(\tau)-I(\sigma)\) then for all \(k\in \underline n\), \(\sigma^{-1}(k)<\sigma^{-1}(j)\) implies that \(k<j)\), where \(I(\rho)=\{(j,i)|\) \(i<j\), \(\rho^{-1}(j)<\rho^{- 1}(i)\}\). Some facts about this partial order are proved.