Complex Matroids
speaker: Emanuele Delucchi (Université de Fribourg, CH)abstract: The combinatorial data associated to an arrangement is encoded by the associated matroid. In the case of real arrangements, this data can be refined by the structure of oriented matroids. In fact, matroid theory can be viewed as an abstraction of some combinatorial properties of linear dependencies among elements of vector spaces, whereas the theory of oriented matroids specifically deals with the combinatorics of linear dependencies over the real numbers. A substantial part of the richness of those theories lies in the fact that they each can be axiomatized in a number of equivalent ways. Some work has been devoted to the search for a similar structure for linear dependencies over the complex numbers. After a quick review of matroids and oriented matroids, we will present our attempt at a theory of "complex matroids" that shares much of the structural richness of oriented matroid theory. This is joint work with Laura Anderson.
timetable:
Mon 21 Jun, 11:45 - 12:45, Aula Dini
documents:
Delucchi
<< Go back