User Tools

Site Tools


Jim Lawrence (George Mason)

Interval Posets, Parity Representations, Binary Partitions, and Antiprisms

Abstract for the Combinatorics Seminar 2018 May 8

Given a poset (a partially ordered set), one obtains another poset by considering the collection of intervals of the first, partially ordered by inclusion. (There are various possibilities, depending, for instance, upon whether one considers the empty set as being an “interval.”) This construction has found use in the study of convex polytopes and other places. I describe a new method of representation of posets by utilizing certain geometric complexes in Rd having vertices in Zd. The striking feature of this method of representation is that taking the interval poset corresponds to dilation by a factor of 2 of the geometric complex. I explore connections with the integer partitions of powers of 2 into powers of 2.

seminars/comb/abstract.201805law.txt · Last modified: 2020/01/29 14:03 (external edit)