MATH 583

fall 2011
 
All Classes
Partial Orders and Comb Optim

Credit: 4 hours.

Combinatorial aspects of partially ordered sets and their relation to optimization problems. Structure of posets and lattices, Dilworth's theorem and generalizations, linear extensions and sorting, dimension of posets, order ideals, extremal set theory, integer programming and minmax relations, matroids and their applications. Prerequisite: MATH 580 or consent of instructor.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Section Status updates every 10 minutes.
Detail Status CRN Type Section Time Day Location Instructor