Speaker: Ariel Fernandez

Abstract:
In this talk, we show a feasible framework to analyze and formalize concepts in Combinatorial Matrix Theory - concepts which are a cornerstone in different fields of Discrete mathematics and Computer Science. We take a proof-complexity approach to formalize mini-max type of reasoning (like Konig's Theorem) within a feasible framework. Also, we see some examples--inside of our framework--of combinatorial properties such as Menger's Theorem, Hall's Theorem, and Dilworth's Theorem.