Intersections of finite sets: geometry and topology
Geometric and topological combinatorics: Modern techniques and methods October 09, 2017 - October 13, 2017
Kneser hypergraph
chromatic number
geometric transversality
06-XX - Order, lattices, ordered algebraic structures [See also 18B35]
49J50 - Fréchet and Gateaux differentiability in optimization [See also 46G05, 58C20]
4-Frick
Given a collection of finite sets, Kneser-type problems aim to partition the collection into parts with well-understood intersection pattern, such as in each part any two sets intersect. Since Lovász' solution of Kneser's conjecture, concerning intersections of all k-subsets of an n-set, topological methods have been a central tool in understanding intersection patterns of finite sets. We will develop a method that in addition to using topological machinery takes the topology of the collection of finite sets into account via a translation to a problem in Euclidean geometry. This leads to simple proofs of old and new results.
Frick Notes
|
Download |
4-Frick
H.264 Video |
4-Frick.mp4
|
Download |
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.