Antichains of interval orders and semiorders, and Dilworth lattices of maximum size antichains

This thesis consists of two parts. In the first part we count antichains of interval orders and in particular semiorders. We associate a Dyck path to each interval order, and give a formula for the number of antichains of an interval order in terms of the corresponding Dyck path. We then use this formula to give a generating function for the total number of antichains of semiorders, enumerated by the sizes of the semiorders and the antichains. In the second part we expand the work of Liu and Stanley on Dilworth lattices. Let L be a distributive lattice, let -(L) be the maximum number of elements covered by a single element in L, and let K(L) be the subposet of L consisting of the elements that cover o-(L) elements. By a result of Dilworth, K(L) is also a distributive lattice. We compute o(L) and K(L) for various lattices L that arise as the coordinate-wise partial ordering on certain sets of semistandard Young tableaux.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Mathematics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Engel Shaposhnik, Efrat

Advisor dc:contributor.advisor

• Richard P. Stanley.

• Mathematics.

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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/104603

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/104603