On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (Q1970072)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) |
scientific article |
Statements
On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (English)
0 references
14 January 2001
0 references
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.
0 references
permutations
0 references
pattern
0 references
Bruhat order
0 references
automaton
0 references
0 references
0 references
0 references
0 references
