Show simple item record

dc.contributor.advisorRichard Stanley.en_US
dc.contributor.authorBóna, Miklósen_US
dc.date.accessioned2008-09-03T17:54:59Z
dc.date.available2008-09-03T17:54:59Z
dc.date.copyright1997en_US
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/42691
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.en_US
dc.descriptionIncludes bibliographical references (leaves 79-82).en_US
dc.description.statementofresponsibilityby Miklós Bóna.en_US
dc.format.extent82 leavesen_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.subjectMathematicsen_US
dc.titleExact and asymptotic enumeration of permutations with subsequence conditionsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc37923919en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record