Back to results

Massachusetts Institute of Technology

Differential posets and dual graded graphs

Abstract

dc:description.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.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Mathematics.
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2008

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Qing, Yulan, S.M. Massachusetts Institute of Technology
Advisor dc:contributor.advisor
  • Richard Stanley.

Subjects

dc:subject × 1

Rights

dc:rights
Statement 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.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/47899
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/47899

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Qing, Yulan, S.M. Massachusetts Institute of Technology. Differential posets and dual graded graphs. Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/47899