Monday, September 28, 3pm ET (8pm BST, 7am Tue NZST)
Dan Cranston, Virginia Commonwealth U
Vertex Partitions into an Independent Set and a Forest with Each Component Small
Zoom [Email rose.mccarty ~at~ uwaterloo ~.~ ca if you need the password]

Abstract:
For each integer $k \ge 2$, we determine a sharp bound on $\text{mad}(G)$ such that $V(G)$ can be partitioned into sets $I$ and $F_k$, where $I$ is an independent set and $G[F_k]$ is a forest in which each component has at most $k$ vertices. For each $k$ we construct an infinite family of examples showing our result is best possible. Hendrey, Norin, and Wood asked for the largest function $g(a,b)$ such that if $\text{mad}(G)<g(a,b)$ then $V(G)$ has a partition into sets $A$ and $B$ such that $\text{mad}(G[A])<a$ and $\text{mad}(G[B])<b$. They specifically asked for the value of $g(1,b)$, which corresponds to the case that $A$ is an independent set. Previously, the only values known were $g(1,4/3)$ and $g(1,2)$. We find the value of $g(1,b)$ whenever $4/3<b<2$. This is joint work with Matthew Yancey.

We’re really excited to have Alexey Pokrovskiy speak on his fantastic recent result on Rota’s Basis Conjecture this upcoming week. This talk has been moved to be a part of the Tutte Colloquium at Waterloo and so will be held at a different day and time than usual. Here are the full details.

Friday, September 25, 1pm ET (6pm BST, 5am Tue NZST)
Alexey Pokrovskiy, Birkbeck, University of London
Rota’s Basis Conjecture holds asymptotically
Zoom [Type the first ten characters of the usual password. Email rose.mccarty ~at~ uwaterloo ~.~ ca if you need the password]

Abstract:
Rota’s Basis Conjecture is a well known problem, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic version of this is will be discussed – that it is possible to find $n – o(n)$ disjoint rainbow independent sets of size $n – o(n)$.

Mon, September 14, 3pm ET (8pm BST, 7am Tue NZST)
Oliver Lorscheid, Instituto Nacional de Matemática Pura e Aplicada
Foundations of Matroids without Large Uniform Minors, Part 2
Zoom [email rose.mccarty ~at~ uwaterloo ~.~ ca if you need the password]
(Part 1 is on Youtube)

Abstract:
In this talk, we take a look under the hood of last week’s talk by Matt Baker: we inspect the foundation of a matroid.

The first desired properties follow readily from its definition: the foundation represents the rescaling classes of the matroid and shows a functorial behaviour with respect to minors and dualization. It requires however deep results by Tutte, Dress-Wenzel and Gelfand-Rybnikov-Stone to gain an understanding of the foundation in terms of generators and relations.

For small matroids, this allows us to determine the foundation explicitly. This, in turn, lets us derive the structure theorem for foundations of matroids without large uniform minors, which is the central result behind the applications from last week.

In a concluding part of the talk, we turn to potential future directions and open problems.

Mon, September 7, 3pm ET (8pm BST, 7am Tue NZST)
Matt Baker, Georgia Tech
Foundations of Matroids without Large Uniform Minors, Part 1
Youtube

Abstract:
Matroid theorists are of course very interested in questions concerning representability of matroids over fields. More generally, one can ask about representability over partial fields in the sense of Semple and Whittle. Pendavingh and van Zwam introduced the universal partial field of a matroid $M$, which governs the representations of $M$ over all partial fields. Unfortunately, almost all matroids are not representable over any partial field, and in this case, the universal partial field gives no information.

Oliver Lorscheid and I have introduced a generalization of the universal partial field which we call the foundation of a matroid. The foundation of $M$ is a type of algebraic object which we call a pasture; pastures include both hyperfields and partial fields. Pastures form a natural class of field-like objects within Lorscheid’s theory of ordered blueprints, and they have desirable categorical properties (e.g., existence of products and coproducts) that make them a natural context in which to study algebraic invariants of matroids. The foundation of a matroid $M$ represents the functor taking a pasture $F$ to the set of rescaling equivalence classes of $F$-representations of $M$; in particular, $M$ is representable over a pasture $F$ if and only if there is a homomorphism from the foundation of $M$ to $F$.

As a particular application of this point of view, I will explain the classification which Lorscheid and I have recently obtained of all possible foundations for matroids having no $U(2,5)$ or $U(3,5)$ minors. The proof of this classification theorem relies crucially on Tutte’s Homotopy Theorem and the theory of cross-ratios for matroids. Among other things, our classification provides a short conceptual proof of the 1997 theorem of Lee and Scobee which says that a matroid is both ternary and orientable if and only if it is dyadic.

This is part 1 of a series of two talks. The second talk will be given the following week by Oliver Lorscheid.