The Jacobian of a finite graph is a finite abelian group whose cardinality is equal to the number of spanning trees of . In this earlier post, I discussed a family of combinatorial bijections between elements of and the set of spanning trees of . I also discussed the fact that for plane graphs, these Bernardi bijections come from a natural simply transitive action of on (or, more precisely, a natural isomorphism class of such actions).
In the present post, I’d like to discuss a different family of simply transitive actions of on discovered by myself, Spencer Backman (a former student of mine), and Chi Ho Yuen (a current student of mine). One virtue of our construction is that it generalizes in a natural way from graphs to regular matroids. (We will mostly stick to the graphical case in this post, but will insert some comments about extensions to regular and/or oriented matroids. A regular matroid can be thought of, rather imprecisely, as the smallest natural class of objects which contain graphs and admit a duality theory generalizing duality for planar graphs. Regular matroids are special cases of the more general concept of oriented matroids.)
One of the main new ideas in [BBY] (as we will henceforth refer to our paper) is to use the torsor as an intermediate object rather than . The latter is canonically isomorphic (as a -torsor) to the set of break divisors on ; the former is isomorphic to the circuit-cocircuit reversal system, which we now introduce.
I’m speaking tomorrow in the AMS Current Events Bulletin about the work of Adiprasito, Huh, and Katz on the Rota-Welsh conjecture and Hodge theory for matroids. See this previous post for an introduction to their work. [Note added 9/21/17: My write-up for the Current Events Bulletin can be found here.]
Here’s an excerpt from the last section of my slides which I may or may not have time to discuss in tomorrow’s talk. It concerns this recent paper of June Huh and Botong Wang. (Note added: As anticipated I did not have time to cover this material! Here are the slides themselves: ceb_talk)
In this post and its sequel, I’d like to explain a new perspective on matroid theory which was introduced in this recent preprint which I wrote with Nathan Bowler. The main observation is that by working with algebraic structures called hyperfields, in which addition is allowed to be multi-valued, linear subspaces, matroids, valuated matroids, and oriented matroids become special cases of a single general concept. In the process of explaining this observation, I also hope to advertise how natural hyperfields are, for example in the context of tropical geometry.
The notion of an algebraic structure in which addition is allowed to be multi-valued goes back to Frédéric Marty, who introduced hypergroups in 1934. Later on, in the mid-1950’s, Marc Krasner developed the theory of hyperrings and hyperfields in the context of approximating non-Archimedean fields, and in the 1990’s Murray Marshall explored connections to the theory of real spectra and spaces of orderings. For the most part, however, the theory of hyperstructures was largely ignored by the mathematical community at large until Connes and Consani started advocating its potential utility in connection with -geometry and the Riemann hypothesis. There now seems to be a reappraisal of sorts going on within the math community of the “bias” against multi-valued operations. Continue reading
From L to R: Karim Adiprasito, June Huh, Eric Katz
In January 2016, my colleague Josephine Yu and I are organizing a workshop called Hodge Theory in Combinatorics. The goal of the workshop is to present the recent proof of a 50-year-old conjecture of Rota by Karim Adiprasito, June Huh, and Eric Katz. In this post, I want to explain what the conjecture says and give a brief outline of its marvelous proof. I will follow rather closely this paper by Adiprasito-Huh-Katz (henceforth referred to as [AHK]) as well as these slides from a talk by June Huh. Continue reading
Yesterday marked the second anniversary of my blog, and today is the 239th birthday of the U.S. In celebration of Independence Day, I want to explain what matroids are. Matroids were invented by Hassler Whitney (and independently by Takeo Nakasawa) to abstract the notion of linear independence from vector spaces to a much more general setting that includes acyclicity in graphs. Other pioneering early work on matroids was done by Garrett Birkhoff and Saunders MacLane. Matroid theory is a rich subject about which we will only scratch the surface here. In particular, there are many different (“cryptomorphic“) ways to present the matroid axioms which all turn out to be (non-obviously) equivalent to one another. We will focus on just a couple of ways of looking at matroids, emphasizing their connections to tropical geometry. Continue reading