Advanced Search
DSpace@MIT

Pattern avoidance for alternating permutations and reading words of tableaux

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Alexander Postnikov. en_US
dc.contributor.author Lewis, Joel Brewster en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Mathematics. en_US
dc.date.accessioned 2012-09-27T18:23:35Z
dc.date.available 2012-09-27T18:23:35Z
dc.date.copyright 2012 en_US
dc.date.issued 2012 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/73444
dc.description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2012. en_US
dc.description This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. en_US
dc.description Cataloged from student submitted PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 67-69). en_US
dc.description.abstract We 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.statementofresponsibility by Joel Brewster Lewis. en_US
dc.format.extent 69 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
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. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Mathematics. en_US
dc.title Pattern avoidance for alternating permutations and reading words of tableaux en_US
dc.type Thesis en_US
dc.description.degree Ph.D. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Mathematics. en_US
dc.identifier.oclc 809654848 en_US


Files in this item

Name Size Format Description
809654848.pdf 574.0Kb PDF Preview, non-printable (open to all)
809654848-MIT.pdf 572.1Kb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage