On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)
This paper studies permutations avoiding the pattern \(\omega_N= NN- 1\dots 1\). The authors show that the set of these permutations is an ideal in the weak Bruhat order and its maximal elements can be obtained from an automaton.
scientific article; zbMATH DE number 1417654