Note: This talk does NOT have a pre-seminar. The main talk starts at 3:30.
Join Zoom Meeting: https://washington.zoom.us/j/
Meeting ID: 915 4733 5974
How can we arrange convex sets in Euclidean space? Versions of this question arise in many combinatorial and geometric contexts: hyperplane arrangements, the study of polytopes and simplicial complexes, optimization, and more. We'll look at convex codes, a relatively recent topic of research that seeks to answer this question very generally. We'll discuss an abstract framework for studying convex codes, some geometric theorems that help us understand them, and see how they differ fundamentally from more classical topics like d-representability.