First of all, I’d like to express my sympathies to everyone who is enduring hardships due to COVID-19. Stay well and be strong.
In this previous post, I discussed two important classical results giving examples of polynomials whose roots interlace:
Theorem 1: The roots of a real-rooted polynomial and its derivative interlace.
Theorem 2: (Cauchy’s interlacing theorem) The eigenvalues of a real symmetric matrix interlace with those of any principal minor.
In this post, I’d like to explain a general method, based on partial fraction expansions of rational functions, which gives a unified approach to proving Theorems 1 and 2 and deserves to be better known.
A few years ago I discovered an amusing proof of Euclid’s theorem that there are infinitely many primes which I thought I’d record here for posterity. (I subsequently learned that a similar argument appears in this paper by Paul Pollack.)
To motivate the proof, and illustrate its working in an (admittedly silly) special case, suppose that there were just two prime numbers, called p and q. Then by the fundamental theorem of arithmetic (i.e., unique factorization into primes) we would have the following identity between generating functions:
Indeed, there is precisely one term for each integer on the left-hand side, and the same is true for the right-hand side (consider separately the cases where but , but , and ). Using the formula for the sum of a geometric series, we can rewrite our formula as an identity between complex-analytic functions valid on the open unit disc :
This is impossible, however, as we see by letting approach a primitive root of unity, since each term stays bounded except for , which tends to infinity.
In this post, I’d like to present an amusing and off-the-beaten-path solution to the classical “Drunkard’s Walk” problem which at the same time derives the well-known generating function for the Catalan numbers. This solution evolved from a suggestion by my former undergraduate student Stefan Froehlich during a discussion in my Math 4802 (Mathematical Problem Solving) class at Georgia Tech in Fall 2007.
In case you’re not familiar with it, here’s the problem (in a formulation I learned from this book by Frederick Mosteller):
A drunken man standing one step from the edge of a cliff takes a sequence of random steps either away from or toward the cliff. At any step, his probability of taking a step away from the cliff is (and therefore his probability of taking a step toward the cliff is ). What is the probability that the man will eventually fall off the cliff?
My goal in this post is to describe a surprising and beautiful method (the Stern-Brocot tree) for generating all positive reduced fractions. I’ll then discuss how properties of the tree yield a simple, direct proof of a famous result in Diophantine approximation due to Hurwitz. Finally, I’ll discuss how improvements to Hurwitz’s theorem led Markoff to define another tree with some mysterious (and partly conjectural) similarities to the Stern-Brocot tree.
Next week I start a new position as Associate Dean for Faculty Development in the Georgia Tech College of Sciences. One of the things I’m looking forward to is getting to know more faculty outside the School of Mathematics and learning about their research. My knowledge of biology, in particular, is rather woeful, but I love reading about the latest developments in Quanta Magazine and elsewhere.
The other day I took my 14-year-old daughter, who is hoping to study genetics, to visit the lab of a Georgia Tech colleague in the School of Biology. During the visit we discussed how expensive it can be not just to purchase but also to maintain certain kinds of lab equipment, for example centrifuges. This reminded me about a blog post I’ve been meaning to write for a long time now…
Back in 2011-12, I spent a year as a faculty member at UC Berkeley and I became friends with some biologists there. One weekend afternoon I was chatting with a cancer researcher named Iswar Hariharan at a barbecue, and when he heard that I was a number theorist he told me about a problem he had been thinking about on and off for more than 15 years. The problem concerns balancing centrifuges. Continue reading
On Pi Day 2016, I wrote in this post about the remarkable fact, discovered by Euler, that the probability that two randomly chosen integers have no prime factors in common is . The proof makes use of the famous identity , often referred to as the “Basel problem”, which is also due to Euler. In the 2016 post I presented Euler’s original solution to the Basel problem using the Taylor series expansion for .
In honor of Pi Day 2018, I’d like to explain a simple and intuitive solution to the Basel problem due to Johan Wästlund. (Wästlund’s paper is here; see also this YouTube video, which is where I first heard about this approach – thanks to Francis Su for sharing it on Facebook!) Wästlund’s approach is motivated by physical considerations (the inverse-square law which governs the apparent brightness of a light source) and uses only basic Euclidean geometry and trigonometry.
The 2018 Georgia Algebraic Geometry Symposium is a wrap! This was the first time that the annual conference was held at Georgia Tech, and I thought it went very well. Each of the eight talks seems to have been well-received, and some spectacular new results were announced. Here’s a quick summary of (what I remember about) the talks: Continue reading
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’d like to continue this discussion of break divisors on graphs & tropical curves by describing an interesting connection to algebraic geometry. In this post, I’ll explain a beautiful connection to the theory of compactified Jacobians discovered by Tif Shen, a recent Ph.D. student of Sam Payne at Yale. Continue reading
I recently gave three lectures at Yale University for the Hahn Lectures in Mathematics. The unifying theme of my talks was the notion of break divisor, a fascinating combinatorial concept related to the Riemann-Roch theorem for graphs. Some applications of break divisors to algebraic geometry will be discussed in a follow-up post.
Break divisors on graphs
Let be a connected finite graph of genus , where . Our central object of study will be the notion of a break divisor on . Recall that a divisor on a graph is an assignment of an integer to each vertex of . The divisor is called effective if for all ; in this case, we often visualize by placing “chips” at . And the degree of is the sum of over all vertices , i.e., the total number of chips. By analogy with algebraic geometry, we write divisors on as formal sums , i.e., as elements of the free abelian group on .
A break divisor on is an effective divisor of degree such that for every connected subgraph of , the degree of restricted to is at least . In other words, there are total chips and each connected subgraph contains at least genus-of- of these chips. One surprising fact, proved in this paper (referred to henceforth as [ABKS]), is that the number of break divisors on is equal to the number of spanning trees of . Continue reading
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)
My thesis advisor Robert Coleman passed away two years ago today (see this remembrance on my blog). One of the things I learned from Robert is that p-adic numbers have many unexpected applications (see, for example, this blog post). Today I want to share one of my favorite surprising applications of p-adic numbers, to a simple problem in Euclidean geometry. Continue reading