Reduced Decompositions and Permutation Patterns
| dc.creator | Tenner, Bridget Eileen | |
| dc.date | 2005-06-13 | |
| dc.date | 2006-02-17 | |
| dc.date.accessioned | 2026-07-07T06:42:25Z | |
| dc.date.available | 2026-07-07T06:42:25Z | |
| dc.description | Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a particular poset. Additionally, the combined frameworks yield several new results about the commutation classes of a permutation. In particular, these describe structural aspects of the corresponding graph of the classes and the zonotopal tilings of a polygon defined by Elnitsky that is associated with the permutation. | |
| dc.description | 19 pages, 6 figures; to appear in J. Alg. Combin | |
| dc.identifier | https://arxiv.org/abs/math/0506242 | |
| dc.identifier | http://arxiv.org/abs/math/0506242 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102031 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05; 05E15 | |
| dc.title | Reduced Decompositions and Permutation Patterns | |
| dc.type | text |