Symmetric chain decompositions of partially ordered sets
2014-07
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Symmetric chain decompositions of partially ordered sets
Authors
Published Date
2014-07
Publisher
Type
Thesis or Dissertation
Abstract
A partially ordered set, or poset, is a set of elements and a binary relation which determines an order within elements. Various combinatorial properties of finite and ordered posets have been extensively studied during the last 4 decades. The Sperner property states that the size of the largest subset of pairwise incomparable elements does not exceed the size of the largest level set in an ordered poset. Since a symmetric chain decomposition is a sufficient condition for the Sperner property, we may prove the Sperner property by finding a symmetric chain decomposition for a poset.In this paper we focus on three types of posets: the Boolean algebra, inversion poset and the Young's lattice. An explicit construction for a symmetric chain decomposition is known only for Boolean algebras. No explicit construction has been found for inversion posets and Young's lattices, a symmetric chain decomposition was found only for a small subset of these posets. Using a maximal flow, we introduce an algorithm for finding this decomposition. We present our results and discuss two implementations of this algorithm.
Description
University of Minnesota Master of Science thesis. July 2014. Major: Applied and Computational Mathematics. Advisors: John Greene, Dalibor Froncek. 1 computer file (PDF); vi, 92 pages, appendices A-C.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Zjevik, Ondrej. (2014). Symmetric chain decompositions of partially ordered sets. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/166874.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.