seminars:comb:abstract.202002swa
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| seminars:comb:abstract.202002swa [2020/05/18 02:08] – created zaslav | seminars:comb:abstract.202002swa [2020/05/18 02:20] (current) – [Combinatorics Seminar,] zaslav | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== | ||
| + | ====== | ||
| + | |||
| + | ====== Speaker: Ed Swartz (Cornell) ====== | ||
| + | |||
| + | ====== Title: Polymatroids are to Finite Groups as Matroids are to Finite Fields ====== | ||
| + | |||
| + | ===== Combinatorics Seminar, Tuesday, February 25, 2020 ===== | ||
| + | |||
| + | In 1935 Whitney introduced matroids as a combinatorial abstraction of linear independence. Since then there has been a strong connection between matroids, and the geometry and combinatorics of finite dimensional vector spaces over finite fields. Polymatroids are a very simply defined generalization of matroids. I will try to convince the audience that the title is nowhere near as crazy as it sounds. I will take classic examples of how matroids and vector spaces over finite fields interact, and show that they are special cases of how polymatroids and finite groups interact. | ||
