11/28/2017 - 12:15pm

11/28/2017 - 1:10pm

Speaker:

Alex Hof (Pomona College)

Abstract:

It is well known that any partially ordered set can be partitioned into totally ordered subsets, or chains, and in particular that it is possible to obtain such a partition where the number of chains is equal to the poset's width. However, the constraints on the sizes of these chains have yet to be fully understood. In this talk, we examine the conjectures of Füredi, Griggs, and Sands, which concern this question and apply variously to the Boolean lattice and to the larger class of posets which possess the so-called normalized matching property.

Where:

Millikan 2099, Pomona College