Date of Award
Petr Vojtechovsky, Ph.D.
Algebraic combinatorics, Coxeter groups, Permutation patterns
This thesis is concerned with problems involving permutations. The main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections between permutation patterns and reduced decompositions were first studied various mathematicians including Stanley, Billey and Tenner. In particular, they studied pattern avoidance conditions on reduced decompositions with no repeated elements. This thesis classifies the pattern avoidance and containment conditions on reduced decompositions with one and two elements repeated. This classification is then used to obtain new enumeration results for pattern classes related to the reduced decompositions and introduces the technique of counting pattern classes via reduced decompositions. In particular, counts on pattern classes involving 1 or 2 copies of the patterns 321 and 3412 are obtained. Pattern conditions are then used to classify and enumerate downsets in the Bruhat order for the symmetric group and the rook monoid which is a generalization of the symmetric group. Finally, motivated by coding theory, the concepts of displacement, additive stretch and multiplicative stretch of permutations are introduced. These concepts are then analyzed with respect to maximality and distribution as a new prospect for improving interleaver design.
Copyright is held by the author. User is responsible for all copyright compliance.
Daly, Daniel Alan, "Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order" (2009). Electronic Theses and Dissertations. 796.
Received from ProQuest
Daniel Alan Daly