Basic Interval Orders

Amy Myers

University of Pennsylvania

April 14,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

A finite interval order is a partially ordered set whose elements are in correspondence with a finite set of intervals in a linear order, with disjoint intervals ordered by their relative position. Such set of intervals is a representation of the interval order.

A finite interval order of length n has a unique representation using intervals with endpoints in the set [n]. A basic interval order of length n has the property that removal of any element yields an order of length less than n. I will construct and enumerate the set of basic length n interval orders using a recurrence relation.


Speaker's Contact Info: anmyers(at-sign)math.upenn.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on March 24, 2000 at 12:39 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.