Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Differential posets and dual graded graphs

Differential posets and dual graded graphs

Thumbnail Image
Download
Name

436221569-MIT.pdf

Description
Full printable version
Size

1.46 MB

Format

Adobe PDF

Checksum (MD5)

dd308881430b00874a0e7e4f8447cf18

Author(s)
Qing, Yulan, S.M. Massachusetts Institute of Technology
Advisor(s)
Richard Stanley.
Date Issued
2008
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis I study r-differential posets and dual graded graphs. Differential posets are partially ordered sets whose elements form the basis of a vector space that satisfies DU-UD=rI, where U and D are certain order-raising and order-lowering operators. New results are presented related to the growth and classification of differential posets. In particular, we prove that the rank sequence of an r-differential poset is bounded above by the Fibonacci sequence and that there is a unique poset with such a maximum rank sequence. We also prove that a 1-differential lattice is either Young's lattice or the Fibonacci lattice. In the second part of the thesis, we present a series of new examples of dual graded graphs that are not isomorphic to the ones presented in Fomin's original paper.
Description
Thesis (S. M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008.
Includes bibliographical references (leaf 53).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
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.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/47899
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.