Z-flows in the random environment

Combinatorics Seminar
Friday, March 3, 2017 - 15:05
1 hour (actually 50 minutes)
Skiles 005
Adam Mickiewicz University
In the talk we state, explain, comment, and finally prove a theorem (proved jointly with Yuval Peled) on the size and the structure of certain homology groups of random simplicial complexes. The main purpose of this presentation is to demonstrate that, despite topological setting, the result can be viewed as a statement on Z-flows in certain model of random hypergraphs, which can be shown using elementary algebraic and combinatorial tools.