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

# Category Archives: Graphs

# Effective Chabauty

One of the deepest and most important results in number theory is the **Mordell Conjecture**, proved by Faltings (and independently by Vojta shortly thereafter). It asserts that if is an algebraic curve of genus at least 2, then the set of rational points on is finite. At present, we do not know any effective algorithm (in theory or in practice) to compute the finite set . The techniques of Faltings and Vojta lead in principle to an upper bound for the number of rational points on , but the bound obtained is far from sharp and is difficult to write down explicitly. In his influential paper *Effective Chabauty*, Robert Coleman combined his theory of p-adic integration with an old idea of Chabauty and showed that it led to a simple explicit upper bound for the size of provided that the Mordell-Weil rank of the Jacobian of is not too large. (For a memorial tribute to Coleman, who passed away on March 24, 2014, see this blog post.)

# The Pentagon Problem

In this post I’ll talk about another favorite recreational math puzzle, the (in)famous “Pentagon Problem”. First, though, I wanted to provide a solution to the Ghost Bugs problem from my last blog post. The puzzle is the following:

*You are given four lines in a plane in general position (no two parallel, no three intersecting in a common point). On each line a ghost bug crawls at some constant velocity (possibly different for each bug). Being ghosts, if two bugs happen to cross paths they just continue crawling through each other uninterrupted. Suppose that five of the possible six meetings actually happen. Prove that the sixth does as well.*

Here is the promised solution. The idea (like in Einstein’s theory of general relativity) is to add an extra dimension corresponding to **time. **We thus lift the problem out of the page and replace the four lines by the graph of the bugs’ positions as a function of time. Since each bug travels at a constant speed, each of the four resulting graphs is a straight line. By construction, two lines and intersect if and only if the corresponding bugs cross paths.

Suppose that every pair of bugs cross paths except possibly for bugs 3 and 4. Then the lines each intersect one another (in distinct points) and therefore they lie in a common plane. Since line intersects lines and in distinct points, it must lie in the same plane. The line cannot be parallel to , since their projections to the page (corresponding to forgetting the time dimension) intersect. Thus and must intersect, which means that bugs 3 and 4 do indeed cross paths.

Cool, huh? As I mentioned in my last post, I can still vividly remember how I felt in the AHA! moment when I discovered this solution more than 15 years ago.

# Riemann-Roch theory for graph orientations

In this post, I’d like to sketch some of the interesting results contained in my Ph.D. student Spencer Backman’s new paper “Riemann-Roch theory for graph orientations”.

First, a bit of background. In a 2007 paper, Emeric Gioan introduced the **cycle-cocycle reversal system** on a (finite, connected, unoriented) graph G, which is a certain natural equivalence relation on the set of orientations of G. Recall that an **orientation** of G is the choice of a direction for each edge. A **cycle flip** on an orientation consists of reversing all the edges in a directed cycle in . Similarly, a **cocycle flip** consists of reversing all the edges in a directed cocycle in , where a **directed cocycle** (also called a **directed cut**) is the collection of all oriented edges connecting a subset of vertices of G to its complement. The cycle-cocycle reversal system is the equivalence relation on the set of orientations of G generated by all cycle and cocycle flips. In his paper, Gioan proves (via a deletion-contraction recursion) the surprising fact that the number of equivalence classes equals the number of spanning trees in G. A bijective proof of this result was subsequently obtained by Bernardi. Continue reading

# Reduced divisors and Riemann-Roch for Graphs

In an earlier post, I described a graph-theoretic analogue of the Riemann-Roch theorem and some of its applications. In this post, I’d like to discuss a proof of that theorem which is a bit more streamlined than the one which Norine and I gave in our original paper [BN]. Like our original proof, the one we’ll give here is based on the concept of **reduced divisors**. Continue reading

# Riemann-Roch for Graphs and Applications

I plan to write several posts related to the Riemann-Roch Theorem for Graphs, which was published several years ago in this paper written jointly with Serguei Norine. In this post I want to explain the statement of the theorem, give some anecdotal background, and mention a few applications which have been discovered in recent years.

**The Riemann-Roch Theorem**

The (classical) Riemann-Roch Theorem is a very useful result about analytic functions on compact one-dimensional complex manifolds (also known as Riemann surfaces). Given a set of constraints on the orders of zeros and poles, the Riemann-Roch Theorem computes the dimension of the space of analytic functions satisfying those constraints. More precisely, if denotes the set of constraints and is the dimension of the space of analytic functions satisfying those constraints, then the Riemann-Roch theorem asserts that

where is the *genus* (“number of holes”) of the Riemann surface , is the total number of constraints, and is the “canonical divisor” on . See the Wikipedia page for much more information.

Before formulating the combinatorial analogue of this result which Norine and I discovered, I want to briefly reminisce about how this result came about. In the summer of 2006, my Georgia Tech REU (Research Experience for Undergraduates) student Dragos Ilas worked on a graph-theoretic conjecture which I had made some time earlier. Dragos spent eight weeks working on the problem and compiled a lot of experimental evidence toward my conjecture. He gave a talk about the problem one Friday toward the end of the summer in an REU Mini-Conference that I was organizing at Georgia Tech. Serguei Norine (then a postdoc working with my colleague Robin Thomas) was in the audience. On Monday morning, Serguei knocked on my office door and showed me an extremely clever proof of my conjecture. I told Serguei about my real goal, which was to prove a graph-theoretic analogue of the Riemann-Roch theorem. I outlined what I had in mind and within a week, we had exactly the kind of Riemann-Roch formula that I had hoped for… thanks in large part to Serguei’s amazing combinatorial mind! Continue reading