Campuses:

Simplicial Complexes

Tuesday, April 29, 2014 - 9:00am - 9:50am
Matthew Kahle (The Ohio State University)
(This is work in progress with Dominic Dotterrer and Larry Guth.)

In a graph, the girth is the length of the smallest cycle. How large
the girth can be for a graph on n vertices and m edges is a very well
studied problem in combinatorics. More generally, in a d-dimensional
simplicial complex, we define the d-systole to be the smallest
nonempty collection of closed d-dimensional faces whose union has no
boundary, and we measure the size of a systole in terms of volume,
Subscribe to RSS - Simplicial Complexes