Back to results

Massachusetts Institute of Technology

The combinatorics of reduced decompositions

Abstract

dc:description.abstract

This thesis examines several aspects of reduced decompositions in finite Coxeter groups. Effort is primarily concentrated on the symmetric group, although some discussions are subsequently expanded to finite Coxeter groups of types B and D. In the symmetric group, the combined frameworks of permutation patterns and reduced decompositions are used to prove a new characterization of vexillary permutations. This characterization and the methods used yield a variety of new results about the structure of several objects relating to a permutation. These include its commutation classes, the corresponding graph of the classes, the zonotopal tilings of a particular polygon, and a poset defined in terms of these tilings. The class of freely braided permutations behaves particularly well, and its graphs and posets are explicitly determined. The Bruhat order for the symmetric group is examined, and the permutations with boolean principal order ideals are completely characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, it is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Department of Mathematics
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2006

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tenner, Bridget Eileen
Advisor dc:contributor.advisor
  • Richard P. Stanley.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/34617
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/34617

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Tenner, Bridget Eileen. The combinatorics of reduced decompositions. Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34617