Show simple item record

dc.contributor.advisorAlexander Postnikov.en_US
dc.contributor.authorLewis, Joel Brewsteren_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2012-09-27T18:23:35Z
dc.date.available2012-09-27T18:23:35Z
dc.date.copyright2012en_US
dc.date.issued2012en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/73444
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2012.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionCataloged from student submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (p. 67-69).en_US
dc.description.abstractWe consider a variety of questions related to pattern avoidance in alternating permutations and generalizations thereof. We give bijective enumerations of alternating permutations avoiding patterns of length 3 and 4, of permutations that are the reading words of a "thickened staircase" shape (or equivalently of permutations with descent set {k, 2k, 3k, . . .}) avoiding a monotone pattern, and of the reading words of Young tableaux of any skew shape avoiding any of the patterns 132, 213, 312, or 231. Our bijections include a simple bijection involving binary trees, variations on the Robinson-Schensted-Knuth correspondence, and recursive bijections established via isomorphisms of generating trees.en_US
dc.description.statementofresponsibilityby Joel Brewster Lewis.en_US
dc.format.extent69 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMathematics.en_US
dc.titlePattern avoidance for alternating permutations and reading words of tableauxen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.identifier.oclc809654848en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record