The goal of this post is to give a purely combinatorial proof of Newton’s sums which would have interrupted the flow of the previous post. Recall that, in the notation of the previous post, Newton’s sums (also known as the first Newton-Girard identity) state that
One way to motivate a combinatorial proof is to recast the generating function interpretation appropriately. Given a polynomial with non-negative integer coefficients and , let be the reciprocals of the roots of . Then
The left hand side of this identity suggests a particular interpretation in terms of the combinatorial species described by . Today we’ll describe this species when is a polynomial with non-negative integer coefficients and then describe it in the general case, which will handle the extension to the symmetric function case as well.
The method of proof used here is closely related to a post I made previously about the properties of the Frobenius map, and at the end of the post I’ll try to discuss what I think might be going on.
Tilings and closed walks on graphs
The simplest way to set up the combinatorics of the proof is as follows. Suppose one has a collection, not necessarily finite, of tiles of various lengths and colors such that the number of colors of tile of a particular length is finite. Let denote the number of colors of tiles of size in this collection. This information can be organized in a generating function
and then one can place the tiles in various orders. Then the generating function counts the number of tilings of a strip of length by the above collection of tiles, since counts the number of ways to place tiles in linear order by the total length of the tiles involved.
What we need is a corresponding combinatorial interpretation of the generating function . The operation of sending to is known as pointing. It sends a sequence to the sequence and has the following combinatorial interpretation: if we think of a tile of size as being composed of segments, then describes the “pointed tiles,” where one of these square segments has been distinguished, or pointed to. then counts the number of ways to pick out a pointed tile, then a sequence of regular tiles.
I claim that this description is equivalent to counting the number of circular tilings, defined as follows: distinguish a “starting tile” on a circle composed of segments and place tiles from the collection on this circle of total length . This is equivalent to allowing the last tile in a regular tiling to “wrap around.” The starting tile on the circle then points to a unique pointed tile, and counting counterclockwise from that tile one obtains a unique sequence of regular tiles. This construction might be familiar if you’ve ever encountered it in the case , where it gives a combinatorial description of the Lucas numbers. Let denote the number of circular tilings of length ; by definition, . The equivalence of pointing and circularity implies the following result, which we re-prove for the sake of clarity.
Proof. Consider a circular tiling of length and consider the first non-pointed tile in counterclockwise order. If it exists and has some length , it has one of colors and removing it produces a circular tiling of length . The only tilings not of this form are the tilings with only one (pointed) tile of size , of which there are .
In order to describe the connection to power sums, we now give a description of circular tilings in terms of closed walks on a certain directed graph associated to any collection of tiles, which is the final ingredient of the proof. The graph consists of vertices and edges defined as follows: there are edges and an additional edges for every . Then we have the following result.
Proposition: For a fixed length, the number of closed walks in from to is the number of regular tilings and the total number of closed walks is the number of circular tilings.
Corollary: If is a polynomial, then is the sum of the powers of the reciprocals of the roots of .
Proof. Choosing a vertex to step to from is equivalent to choosing the length of a tile, and choosing an edge to use is equivalent to choosing its color. Once you are at vertex , the only way to continue the walk is to take steps back to , so in total you have taken steps corresponding to a particular color of tile of length . Thus walks from to of a particular length are in one-to-one correspondence with tilings of the same length. Similarly, arbitrary closed walks start at some intermediate vertex which is not necessarily , and this is equivalent to pointing to a particular segment of the first tile.
To show that this implies the corollary, the first result implies that the eigenvalues of are, at least in the generic case, identical to the reciprocals of the roots of . Arbitrary closed walks are then counted by traces of powers of the adjacency matrix of , so they are power sums in the eigenvalues. One can also show the first part of the corollary by observing that the adjacency matrix of is a companion matrix.
As stated, we have only proven Newton’s sums for roots of polynomials with a restriction on their coefficients. This restriction can be removed by regarding as a weight, i.e. a formal variable, and weighting a walk by the product of the weights of the edges involved. One can then regard the roots of the polynomial also as formal variables which determine the formal variables ; the proof still carries through because all of the counting above can be done in a weighted fashion, and because we can regard the roots of as formal, we can also allow countably many of them (hence tiles of arbitrary size) and prove Newton’s sums in the full ring of symmetric functions.
From here on the graph above is to replaced by an arbitrary directed graph , and instead of circular tilings we will consider more general closed walks. will still denote the number of closed walks of length . More generally we can take where is a square matrix with integer entries (and not necessarily finite-dimensional, as long as all but finitely many of the diagonal entries of are nonzero for every .)
As I remarked in a previous post, the cyclic group acts on closed walks of length in the obvious way, and the fixed points of an element of order consist precisely of copies of a closed walk of length . There are such elements, so by Polya’s theorem the number of orbits of closed walks is
Thinking of this result as a significant generalization of Fermat’s little theorem, we will refer to the congruence as the first necklace congruence, since one can interpret it as talking about circular tilings, which generalize necklaces.
When is a power of a prime, the first necklace congruence implies what Richard Lipton calls Fermat’s little theorem for matrices, which states that
Using the Frobenius map appears to get you at best . I don’t know an algebraic proof of the stronger statement. A remarkable corollary of this result is that is a well-defined -adic number. This fact appears to be related to taking the algebraic closure of a variety over , which I’ll attempt to discuss later.
Instead of counting orbits, we may consider the following property of closed walks: each has a unique fundamental period, and a closed walk of length and period consists precisely of copies of an aperiodic closed walk of length . The aperiodic closed walks of length are precisely those in full orbits under the group action of , and we cannot count them directly using Polya theory; however, we can use Mobius inversion. Let denote the number of full orbits of closed walks under the group action of ; then denotes the number of closed walks in all such orbits, and since every closed walk consists of copies of some such walk, we obtain
By Mobius inversion, it follows that
Because the case prime here also implies Fermat’s little theorem, we will refer to the congruence as the second necklace congruence.
We have just proven the necklace congruences for a fairly general class of sequences . It’s a good exercise to show that they imply each other, but that fact won’t be necessary for our next application.
As we have seen, Newton’s sums is equivalent to the identity
which can be seen by dividing the first statement by , integrating, and then exponentiating. The graph-theoretic argument above shows that this identity can be phrased as follows: if is a graph with adjacency matrix and denotes the corresponding identity matrix, then
This identity is in turn equivalent to Jacobi’s identity with . Introducing a second matrix , we now obtain
Of course a similar result is true if the determinants are replaced by power series, but we won’t need that result for now.
Corollary: Let be an integer sequence such that is a rational function with integer-coefficient numerator and denominator satisfying . Then satisfies the necklace congruences.
As a special case, this is known to be true for varieties over finite fields, where denotes the number of points on a variety over the finite field , and the corresponding function is called a local zeta function in part because it satisfies an analogue of the Riemann hypothesis.
What’s the connection between local zeta functions and our discussion? Well, at the heart of the construction of the local zeta function is the action of the Frobenius map on the points of a variety over . The fixed points of are precisely the points of over , so the local zeta function can be written
And the fixed-point function is a trace, since acts as a linear operator on as a vector space over . Under a suitable choice of basis, acts by permutation, and then as desired.
I may not know anything about fancy things like the Lefschetz zeta function, but from my perspective it seems to me that the general idea is that given a dynamical system consisting of a set , a weighting , and a function one is interested in establishing rationality or a Riemann hypothesis for the associated dynamical zeta function
since these properties are associated with good regularity phenomena, which I referred to above as local finiteness. As the article above indicates, dynamical zeta functions have a very general notion of Euler product which I am still trying to digest.
It’s interesting that the theory of zeta functions focuses so much on fixed points. From a purely combinatorial perspective, fixed points of are precisely closed walks of length on the functional graph associated to acting on , so there’s no reason not to consider closed walks on more general graphs than functional graphs and define something like the Ihara zeta function in a general context, which is closely related, but apparently not identical, to the function defined earlier. From the example of the Lefschetz zeta function, however, it seems as if when is infinite and carries additional structure this viewpoint may no longer be feasible. I would very much appreciate it if someone could clarify the situation here for me.
Edit, 8/24/2009: There is a fairly simple result that might clarify this situation.
Proposition: A sequence of integers satisfies the necklace congruences if and only if there exist two functions on a set of at most countable cardinality such that .
Proof. The left implication follows from arguments above. For the right implication, recall that a sequence satisfies the necklace congruences if and only if there exists an integer sequence such that . Let be sequences of non-negative integers such that ; if we require that one of always be equal to zero, these sequences are unique.
Let be a permutation with cycles of length for all , and similarly let be a permutation with cycles of length for all . Clearly one only needs at most countable to achieve this. Then a cycle of length contains fixed points of if and only if , in which case every element of the cycle is a fixed point. It follows that as desired.
Applied to the case of walks on graphs, the set is the set of closed walks and is the permutation that takes a given closed walk to the same closed walk, but starting on the next vertex. So in a sense I had my order of inclusion wrong: as long as one isn’t too picky about finiteness, closed walks are a special case of fixed points and not the other way around.
My combinatorics teacher, Gregg Musiker, gave a talk whose slides inspired much of the second half of this post. Instead of discussing closed walks on graphs he discusses the more-or-less equivalent notion of cyclic language, i.e. a language on which the cyclic group can act. He then goes on to discuss a specific connection between zeta functions of elliptic curves and certain sequences of chip-firing games, both of which are distinguished by the existence of group structure. I would love to see all of this stuff fit into a cohesive framework someday.
Thinking of a dynamical system as a category with object set and morphisms determined by the iterates of , one might hope that there is a meaningful definition of the zeta function of a category. My big hope is that this definition, or a modification thereof, somehow subsumes both the definition of the zeta function of a dynamical system and the zeta function of a poset. At the moment, I have no idea if this is true.
- Based on the above arguments, I am reasonably certain the following is true: an integer sequence satisfies the necklace congruences if and only if is a power series with integer coefficients. I’d be interested in seeing a proof involving the Mellin transform and Dirichlet series, as well as a more direct combinatorial proof.
- If is the adjacency matrix of a finite directed graph , what combinatorial interpretation do the coefficients of have? (I am convinced that one exists because these coefficients are precisely the complete homogeneous symmetric polynomials of the eigenvalues of , but for some reason I’m just not seeing it.) This combinatorial interpretation should be closely related to the symmetric function identity
since counts the number of -tuples of closed walks of prescribed lengths. Alternately, one might proceed via the second Newton-Girard identity.
If your interpretation is really good, it should also somehow explain Molien’s theorem, at least for permutation representations.