February 20
Upcoming Presentation
Date & Time: Thursday, March 7, 2013 3:30 - 4:30 p.m.
Location: ITB A113A
Speaker: Ariel Fernandez
Title: Formalizing Combinatorial Matrix Theory
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.