Ponente: Alex Fink
Institución: Queen Mary University of London

15/10/2019  de 12:00 a 13:00
Dónde Auditorio "Alfonso Nápoles Gándara"

 

A matroid is a combinatorial structure which records dependence information, such as the linear dependence of lists of vectors over a field. As such they arise in many discrete algebraic problems. But often there is more information to be extracted than the field-agnostic linear algebra that the matroid can see, and so several more general structures have recently been proposed. After introducing matroids, I will present some of these generalisations and the problems for which they're useful, such as Rota's log-concavity conjecture, proved in 2015 by Adiprasito, Huh and Katz.

 

Temas:

Combinatoria, Teoría de gráficas, Grafos o Gráficas

Lunes, May 20, 2024