DMS Combinatorics Seminar

Speaker: Chris Kapulkin, University of Western Ontario

Abstract: Discrete homology is a graph invariant, known for its discerning power in analysis of social and technological networks. This talk will report on joint work with Nathan Kershaw on creating software for effective computations of this invariant. I will explain what discrete homology is and how it can be used in a variety of applied contexts, e.g., as an alternative to persistence homology in topological data analysis or as a poset invariant in systems biology.

In addition to presenting our techniques for effective computations, I will discuss some open problems of a combinatorial nature that would lead to further improvements in the software.

No prior knowledge of homology will be assumed.