Show simple item record

dc.contributor.advisorRichard P. Stanley.en_US
dc.contributor.authorClifford, Peter, 1975-en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2006-03-24T18:09:11Z
dc.date.available2006-03-24T18:09:11Z
dc.date.copyright2003en_US
dc.date.issued2003en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/29985
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003.en_US
dc.descriptionIncludes bibliographical references (p. 59-60).en_US
dc.description.abstractMotivated by results and conjectures of Stanley concerning minimal border strip tableaux of partitions, we present three results. First we generalize the rank of a partition [lambda] to the rank of a shifted partition S([lambda]).We show that the number of bars required in a minimal bar tableau of S([lambda]) is max(o, e + (â„“([lambda]) mod 2)), where o and e are the number of odd and even rows of [lambda]. As a consequence we show that the irreducible negative characters of [tilde]S[sub]n vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schur's Q[sub][lambda] symmetric functions in terms of the power sum symmetric functions. The second result gives a basis for the space spanned by the lowest degree terms in the expansion of the Schur symmetric functions in terms of the power sum symmetric functions. These lowest degree terms studied by Stanley correspond to minimal border strip tableaux of [lambda]. The Hilbert series of these spaces is the generating function giving the number of partitions of n into parts differing by at least 2. Applying the Rogers-Ramanujan identity, the generating function also counts the number of partitions of n into parts 5k + 1 and 5k - 1. Finally for each [lambda] we give a relation between the power sum symmetric functions and the monomial symmetric functions; the terms are indexed by the types of minimal border strip tableaux of [lambda].en_US
dc.description.statementofresponsibilityby Peter Clifford.en_US
dc.format.extent60 p.en_US
dc.format.extent1736084 bytes
dc.format.extent1735892 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
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/7582
dc.subjectMathematics.en_US
dc.titleAlgebraic and combinatorial properties of minimal border strip tableauxen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc54790768en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record