Prof. Dr. Rico Zenklusen (ETH Zürich)

Matroids are an elegant combinatorial abstraction of linear independence. Alternatively, they can be interpreted as characterizing optimization problems that can be solved through a simple greedy algorithm. At first sight, this latter viewpoint can easily be deceiving by giving the impression that matroids may only be useful for very basic computational problems. However, their rich structural and algorithmic properties can be exploited to tackle highly non-trivial optimization problems in a unifying framework. The goal of this talk is to give a brief introduction to matroids and exemplify their versatility to solve combinatorial optimization problems. Apart from some classical results, we present a link between a wireless information flow model, known as the ADT model, and matroids. This link allows for translating results from (algorithmic) matroid theory to the ADT model, which leads, among other implications, to a fast procedure for determining an optimal coding strategy.

If you wish to attend one (or more) of the talks please send to request for the zoom link to anapde_mathematik.tu-darmstadt.de (please replace  _ by @ ). Please include in your mail your full name, status (teacher, professor, student,...) and institution.

Wenn Sie als Zuhörer*in an den Kolloquien teilnehmen möchten, schicken Sie bitte eine Anfrage per Mail an anapde_mathematik.tu-darmstadt.de (ersetzen Sie dabei bitte _ durch @ ). Ihre Mail sollte Ihren vollständigen Namen, Ihren Status (Lehrer*in, Professor*in, Student*in, Doktorand*in , ...) und Ihre Institution enthalten.


14. Juli 2021, 17:15-19:00




FB Mathematik, AG Numerik und wissenschaftliches Rechnen




Mathematisches Kolloquium, Mathematik, Numerik