Feeds:
Posts

## Update, and the combinatorics of quintic equations

A brief update. I’ve been at Cambridge for the last week or so now, and lectures have finally started. I am, tentatively, taking the following Part II classes:

• Riemann Surfaces
• Topics in Analysis Probability and Measure
• Graph Theory
• Linear Analysis (Functional Analysis)
• Logic and Set Theory

I will also attempt to sit in on Part III Algebraic Number Theory, and I will also be self-studying Part II Number Theory and Galois Theory for the Tripos.

As far as this blog goes, my current plan is to blog about interesting topics which come up in my lectures and self-study, partly as a study tool and partly because there are a few big theorems I’d like to get around to understanding this year and some of the material in my lectures will be useful for those theorems.

Today I’d like to blog about something completely different. Here is a fun trick the first half of which I learned somewhere on MO. Recall that the Abel-Ruffini theorem states that the roots of a general quintic polynomial cannot in general be written down in terms of radicals. However, it is known that it is possible to solve general quintics if in addition to radicals one allows Bring radicals. To state this result in a form which will be particularly convenient for the following post, this is equivalent to being able to solve a quintic of the form

$\displaystyle y = 1 + xy^5$

for $y$ in terms of $x$. It just so happens that a particular branch of the above function has a particularly nice Taylor series; in fact, the branch analytic in a neighborhood of the origin is given by

$\displaystyle y = \sum_{n \ge 0} \frac{1}{4n+1} {5n \choose n} x^n$.

This should remind you of the well-known fact that the generating function $\displaystyle y = \sum_{n \ge 0} \frac{1}{n+1} {2n \choose n} x^n$ for the Catalan numbers satisfies $y = 1 + xy^2$. In fact, there is a really nice combinatorial proof of the following general fact: the generating function $\displaystyle y = \sum_{n \ge 0} \frac{1}{(k-1)n+1} {kn \choose n} x^n$ satisfies

$y = 1 + xy^k$.

Proof

The above result follows directly from (the combinatorial form of) Lagrange inversion, but unless you’ve seen the combinatorial proof of Lagrange inversion (as detailed in, for example, Stanley), you might not know that Lagrange inversion can be thought of in terms of counting trees, and here the tree-counting can be made quite explicit.

Here’s how it works. The relation $y = 1 + xy^k$ says that, if $y$ is interpreted as a combinatorial species, then a $y$-structure is either the empty set or a set of size $1$ (the $x$) together with $k$ different $y$-structures (arranged in linear order). This is precisely the recursive definition of a certain type of $k$-ary tree; namely, a $k$-ary tree in which each node has $k$ “children” slots which are labeled in left-to-right order, and where the tree remembers which slots are empty and which are non-empty. Since this is a somewhat lengthy definition and I do not know a concise way to put it, I will just say $k$-ary tree in the rest of this post.

So $[x^n] y(x)$ is the number of $k$-ary trees with $n$ nodes. There is an elegant way to count such trees using a depth-first search: starting from the root node, inspect each of the $k$ “children” slots in left to right order. Every time you inspect a new slot (aside from the first slot), write down a $+1$. If a slot is not empty, start inspecting the children of that node. Every time you need to backtrack up one level, write down a $-(k-1)$. At the end of the search, write down a last $-(k-1)$.

The above algorithm associates to every $k$-ary tree with $n$ nodes a sequence of $kn$ numbers, $(k-1)n$ of which are $+1$ and $n$ of which are $-(k-1)$. Moreover, it’s not hard to see that at any point, the partial sums of the sequence must be non-negative. In the other direction, given such a sequence we can construct a $k$-ary tree step-by-step. (Exercise for the reader!) One can think of such sequences as generalized ballot sequences.

So the number of $k$-ary trees with $n$ nodes is the same as the number of sequences satisfying the above conditions. There is an elegant way to count such sequences using the following lemma, which has a name that I always forget (even though I’ve asked Stanley more than once what it’s called).

Lemma: Let $a_1, ... a_m$ be a sequence of integers such that $\sum a_i = 1$. Then there is a unique index $j$ such that the partial sums of the sequence $a_j, a_{j+1}, ... a_{j+m-1}$ (where the indices are taken $\bmod m$) are positive.

Proof. Extend the $a_i$ to a periodic function on $\mathbb{N}$ with period $m$ and consider a plot of the sequence $b_n = \sum_{i=1}^{n} a_i$, which satisfies $b_{rm} = r$. Then the lemma is equivalent to the statement that there is a unique value of $j \bmod m$ such that a horizontal line of length $m-1$ extending to the right from $(j, b_j)$ does not intersect the graph of $b_n$. But now it’s not hard to see (draw a picture!) that it suffices to look at the rightmost place at which $b_n$ attains its minimum in a given “period.”

We apply the lemma as follows. There are ${kn \choose n}$ ways to write down a sequence of length $kn$ with $(k-1)n$ different $+1$s and $n$ different $-(k-1)$s, and this sequence sums to zero. Given such a sequence, prepend an additional $+1$. The resulting sequence of length $kn+1$ satisfies the conditions of the lemma, so there is a unique cyclic permutation of such a sequence such that all the partial sums are positive. Such a sequence must start with $+1$, so given such a cyclic permutation there are $(k-1)n+1$ possible sequences one could have started with.

Now delete the first $+1$. The result is a sequence of length $kn$ which satisfies the $k$-ary tree conditions above. It follows that the number of such sequences is $\displaystyle \frac{1}{(k-1)n+1} {kn \choose n}$, as desired.

### 5 Responses

1. […] qchu uses Raney’s Lemma to find the number of -ary trees with nodes, making use of a bijection with -Raney sequences of length . […]

2. […] qchu uses Raney’s Lemma to find the number of k-ary trees with n nodes, making use of a bijection with k-Raney sequences of length kn + 1. […]

3. on October 18, 2010 at 9:48 am | Reply Philippe Nadeau

Well I, and most people I know, call this lemma the `cycle lemma”.

• That’s a good name. I remember Stanley told me it was referred to as X’s lemma, where X is the name of a mathematician I can never remember. It may have had five letters in it and it may have started with an R.

• I think it’s called Raney’s lemma.