User Tools

Site Tools


Lucas Rusnak (Binghamton)

The Combinatorics of Lopsided Sets

Abstract for the Combinatorics Seminar 2007 May 1

Given a collection L of closed orthants in d-dimensional Euclidean space, we will look at convex sets that intersect the closed orthants in L, while avoiding those not in L. We will explore examples and a combinatorial condition for such an L known as 'lopsidedness' before finally relating the concept to the theory of oriented matroids.

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