CW complexes and arithmetic matroids

Colorings and flows on CW complexes, Tutte quasi-polynomials and arithmetic matroids

Abstract.

In this note we provide a higher-dimensional analogue of Tutte’s theorem on colorings and flows of graphs, by showing that the theory of arithmetic Tutte polynomials and quasi-polynomials encompasses invariants defined for CW complexes by Beck–Breuer–Godkin–Martin [3] and Duval–Klivans–Martin [12]. Furthermore, we answer a question by Bajo–Burdick–Chmutov [2], concerning the modified Tutte–Krushkal–Renhardy polynomials defined by these authors: to this end, we prove that the product of two arithmetic multiplicity functions on a matroid is again an arithmetic multiplicity function.

1. Introduction

The enumeration of colorings, flows and spanning trees on graphs are classical topics, unified by a two-variable polynomial due to W. T. Tutte [21]. This polynomial specializes to both the coloring counting and the flow counting functions, and it evaluates to the number of spanning trees. H. Crapo extended Tutte’s definition to arbitrary matroids and since then this Tutte polynomial went on to become one of the most studied matroid polynomial invariants with great theoretical significance and a host of applications — e.g., in statistics and physics. Recently, this classical setup has been generalized in two ways.

First, the concept of coloring and flow has been generalized from graphs to higher dimensional objects such as simplicial complexes by Beck and Kemper [4] and, more generally, to CW complexes by Beck–Breuer–Godkin–Martin [3] and Duval–Klivans–Martin [12]. These authors showed, among other things, that the functions counting the number of colorings and flows with values on a CW complex is a quasi-polynomial in . In a related vein, Bajo, Burdick and Chmutov [2] introduced a family of modified TKR polynomials that connects Kalai’s enumeration of weighted cellular spanning trees of complexes [14] to a class of polynomials defined by Krushkal and Renhardy [15] in their study of graph embeddings and to a polynomial defined by Bott [5].

On the other hand, in collaboration with M. D’Adderio [8] and with P. Brändén [6] the second-named author developed a theory of arithmetic matroids as “matroids decorated with a multiplicity function”, abstracting the arithmetic properties of lists of elements in finitely generated abelian groups. To each arithmetic matroid is naturally associated an arithmetic Tutte polynomial. These polynomials have been in the focus of recent and lively research, which brought to light manifold connections and a rich structure theory. For instance, arithmetic Tutte polynomials specialize to Poincaré polynomials of toric arrangements [18], to Ehrhart polynomials of zonotopes [7] and to the Hilbert series of some zonotopal spaces [16]. Moreover, they can be recovered from the Tutte polynomials for group actions on semimatroids [10], and they satisfy a convolution formula [1].

With a list of elements in a finitely generated abelian group is also associated a Tutte quasi-polynomial [6], which interpolates between the (ordinary) Tutte polynomial and the arithmetic Tutte polynomial. This quasi-polynomial does not depend only on the arithmetic matroid, but on a finer structure: a matroid over in the sense of [13]. As pointed out in [3], the enumerating functions of colorings and flows on a CW complex are not matroidal, and hence cannot be obtained from the ordinary Tutte polynomial. In this paper we show that, however, they are specializations of the Tutte quasi-polynomial, thus providing a higher-dimensional analogy to Tutte’s celebrated theorem for graphs [21].

Moreover, we show that the set of arithmetic matroids over a fixed underlying matroid has a natural structure of commutative monoid. This implies that the modified TKR polynomials are indeed arithmetic Tutte polynomials; in particular, their coefficients are positive.

In this way we address questions of the authors of [2, 3, 12], who ask whether and how the coloring and flow polynomials for CW complexes and the modified TKR polynomials are related to arithmetic matroids.

Structure of the paper

In Section 2 we start off with some preliminaries on incidence algebras and arithmetic matroids. We prove a general theorem about products of integer functions on posets (Theorem 1) and specialize it to one about products of arithmetic multiplicity functions (Theorem 2).

In Section 3 we discuss how the flow and chromatic quasi-polynomials for CW complexes are indeed specializations of the Tutte quasi-polynomial (Theorem 3).

We close with Section 4 where we prove that the modified TKR polynomial is the arithmetic Tutte polynomial of an arithmetic matroid (Theorem 4).

Acknowledgements

The first-named author has been supported by the Swiss National Foundation Professorship grant PP00P2_150552/1. We thank Yvonne Kemper for pointing out [17], and Fengwei Zhou for finding an error in a previous version of this paper.

2. On arithmetic matroids

2.1. Poset theory preliminaries

The goal of this section is to prove a result on Möbius functions of posets (short for “partially ordered sets”) which will serve as a stepping stone towards Theorem 2. We will assume familiarity with basic terminology of poset theory. We refer the reader unfamiliar with it to [20].

Throughout, we will let denote a finite poset.1 An interval of is any subset of of the form for some , . The set of intervals of is denoted .

The so-called Möbius function of is the function

defined recursively as follows

where for simplicity we write .

The (dual) Möbius transform2 of a function is the function

It is characterized by .

Consider two elements . If there is an element with

then is unique, called the meet (or minimal upper bound) of and , and denoted by . If every pair admits a meet, the poset is called a meet semilattice.

The following lemma should be folklore. We give here a proof for completeness, because we do not know of a reference for it.

Lemma 1.

Let be a meet-semilattice, and be a function such that for all . Then,

for all .

Proof.

Define for all

We claim that

The right-to left inclusion is clear: means , hence . For the left-to-right inclusion consider . The set has a unique maximal element (since and imply – hence, imply ). Now we see that . Uniqueness of implies that the union is indeed disjoint.

Thus, for all we have

and, by Möbius inversion,

as required. ∎

Theorem 1.

Let be a meet-semilattice, and consider two functions . If and for all , then for all .

Proof.

The positivity hypothesis allows us to define, for every and , a set

where the are pairwise distinct formal elements – i.e., if and only if , , . Then, set

Then,

Notice also that, by definition of ,

Consider now the family of sets defined by

Since cartesian products commute with intersections, for we have

and thus, by Lemma 1,

The claim now follows because for all .

2.2. Arithmetic matroids

In this section we recall basic definitions on matroids and arithmetic matroids in order to set some notation, and we prove Theorem 2. For background on matroid theory we refer, e.g., to Oxley’s textbook [19], while our presentation of arithmetic matroids follows mostly [6].

Definition 1.

A matroid is given by a pair , where is a finite set and is a function such that, for all ,

  • ,

  • implies ,

  • .

A molecule in a matroid is a triple of disjoint subsets of such that, for every with ,

To the molecule , following e.g. [10], we associate a poset

ordered by if , .

Remark 1.

The poset is bounded, with unique minimal element and unique maximal element . Moreover, every interval in (say, ) is the poset for another molecule (i.e., ).

Given any function and a molecule of a matroid over the ground set , we define as the function with

Definition 2.

An arithmetic matroid is a triple where is a matroid, and is a function satisfying the following axioms.

  • For every molecule of

  • For every molecule of

  • For all and all ,

Remark 2.

Axiom (P) is usually given in a different form. In fact, for a molecule we see that the poset is boolean and the length of the interval is . Therefore, the Möbius function of satisfies

If we now expand our form of axiom (P) we get

and we recover the formulation given in [6].

2.3. Product of multiplicity functions

Consider now a fixed matroid , two (possibly different) functions and their (pointwise) product

Lemma 2.

If both and satisfy axiom (P), so does .

Proof.

Suppose and both satisfy (P) and consider a molecule . The poset is boolean, hence in particular a (meet semi-)lattice. Since every interval of defines a molecule, and satisfy the conditions of Theorem 1 on . Hence,

Theorem 2.

If both and are arithmetic matroids, then is also an arithmetic matroid.

Proof.

The triple satisfies (P) by Lemma 2, and (Q), (A) trivially. ∎

Remark 3.

This theorem endows the set of arithmetic matroids over a fixed underlying matroid with a natural product, which makes it into a commutative monoid. We leave the investigation of this algebraic structure as an open problem.

3. On Tutte quasi-polynomials associated to cell complexes

3.1. The Tutte quasi-polynomial

Let be a finitely generated abelian group, be a finite set, and be a list (multiset) of elements in . For every we denote by the sublist , by the subgroup that it generates, and by the torsion subgroup of the quotient . In [6, Section 7], the Tutte quasi-polynomial of is defined as follows.

Remark 4.

If for every the integer is coprime with , then equals and we get the ordinary Tutte polynomial of the matroid of linear dependencies among elements of :

On the other hand, when for every the integer is a multiple of we have that is trivial and we obtain the arithmetic Tutte polynomial:

Therefore is a quasi-polynomial function that in some sense interpolates between these two polynomials. It appeared as a specialization of a multivariate ”Fortuin–Kasteleyn quasi-polynomial”.

Now recall the following definitions.

Definition 3 ([6, Section 7]).

Let , and be as above.

  1. A proper -coloring is an element such that for all .

  2. A nowhere zero -flow is a function such that
    in .

The number of proper -colorings and the number of nowhere zero -flows are denoted by and respectively.

The following statement generalizes a result of [9].

Lemma 3 ([6, Theorem 9.1]).

In particular, and are quasi-polynomial functions of , called the chromatic quasi-polynomial and the flow quasi-polynomial respectively.

3.2. On flows and colorings on CW complexes

Let be a CW complex of dimension and, for every , let be the set of the -dimensional cells of . The top-dimensional boundary map is represented by a matrix with integer entries, that (by a slight abuse of notation) we denote again by . By reducing modulo , we get a map , that we can view as a matrix with coefficients in .

Definition 4 (cf. [4] and [3]).

Let and be as above.

  1. a proper -coloring of is an element such that all the entries of the vector are nonzero.

  2. a nowhere zero -flow on is an element such that the coordinate is nonzero for every .

The authors of [4] and [3] prove that the number of proper -colorings and the number of nowhere zero -flows are quasi-polynomial functions, that we will denote by and .

In fact, to the (integer) matrix we can associate a Tutte quasi-polynomial, an arithmetic matroid and an arithmetic Tutte polynomial. With the following lemma we address [3, Remark 3.15] by showing that the coloring- and flow- counting quasi-polynomials of [3] and [12] are instances of the coloring- and flow- quasi-polynomials associated to the matrix .

Lemma 4.

Definitions (1’) and (2’) agree with definitions (1) and (2), when , , and .

Proof.

Every uniquely extends to a homomorphism . Then since , (1) specializes to (1’). On the other hand, definition (2’) is equivalent to saying that is a function such that . This is precisely the specialization of definition (2). ∎

The following “higher-dimensional analogue” of Tutte’s theorem about the dichromate [21] now follows immediately from Lemma 4 and Theorem 3.

Theorem 3.

With the notations above, we have:

Remark 5.

As pointed out in [6], the Tutte quasi-polynomial is not an invariant of the arithmetic matroid, but is an invariant of the matroid over associated to the matrix . We call this matroid the cellular matroid over of .

Remark 6.

Underlying matroids of cellular matroids over (i.e., the matroids defined by the matrices ) have been studied in their own right. Allowing different generality for the complex one obtains different interesting classes of matroids. Already in the case where is a simplicial complex, the matroids obtained this way are strictly more general than graphical matroids [17].

Remark 7.

Given a -dimensional CW-complex , for every the -skeleton of is itself a -dimensional CW-complex for which we can carry out all considerations of this section. Thus, in fact gives rise to a class of arithmetic quasi-polynomials and arithmetic matroids. In the following section we will consider properties of this class as a whole.

4. On the modified Tutte-Krushkal-Renhardy polynomial

When considering cell complexes as higher dimensional generalizations of graphs, besides flows and colorings it is natural to enumerate the analogue of spanning trees. Following Kalai [14], this enumeration is weighted by the cardinality of the torsion of the subcomplexes that are enumerated. This line of thought inspired [2], where the authors introduced a class of polynomials arising as a modification of Krushkal and Renhardy’s polynomial invariants of triangulations. This last section is devoted to answering a question of [2] which we will state after reviewing some definitions (following [2, 15]).

Definition 5.

We denote by the family of all spanning subcomplexes of dimension , i.e., of all the subcomplexes such that . These are naturally identified with the subsets of , the set of -dimensional cells of the -skeleton of . Let be the -th Betti number of (i.e., the rank of the homology ), and let be the cardinality of its torsion, .

Remark 8.

As has been pointed out e.g. in [3], the function is the multiplicity function of the arithmetic matroid defined by the matrix .

Definition 6 ([2, Definition 3.1]).

The -th Tutte–Krushkal–Renhardy (TKR for short) polynomial of is defined in [15] as

The “modified -th Tutte–Krushkal–Renhardy (TKR for short) polynomial” of is

Remark 9.

Following [11, Section 5.4] we note that is the number of ”cellular -spanning trees” of (according to Definition 2.1 of [2]), while is an invariant introduced by G. Kalai in [14]: the number of cellular -spanning trees of , each counted with multiplicity . Moreover, if and are dual cell structures on a sphere (according e.g. to [2, Definition 1.2]) we have

by [15], and

by [2, Theorem 3.4].

In [2, Remark 3.3] the authors ask whether the multiplicity defines an arithmetic matroid. The results established in Section 2 allow us to give a positive answer to this question.

Theorem 4.

Let be a CW-complex of dimension and, for every let denote the cellular matroid of the -skeleton of (see Remark 6). Then, for every the pair (, ) is an arithmetic matroid, and the modified -th Tutte–Krushkal–Renhardy polynomial is the associated arithmetic Tutte polynomial. In particular, the coefficients of are nonnnegative.

Proof.

We first notice that the pair is an arithmetic matroid (see Remark 8), then apply Theorem 2 with . ∎

Footnotes

  1. This will avoid unnecessary technicalities and will suffice for the applications later in the paper, even though most of what we will prove in this section holds in the generality of locally finite posets.
  2. We will henceforth simply use the term Möbius transform. It is referred to as “dual form” in [20, Proposition 3.7.2]

References

  1. S. Backman and M. Lenz. A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures. ArXiv e-prints, February 2016.
  2. Carlos Bajo, Bradley Burdick, and Sergei Chmutov. On the Tutte-Krushkal-Renardy polynomial for cell complexes. J. Combin. Theory Ser. A, 123:186–201, 2014.
  3. Matthias Beck, Felix Breuer, Logan Godkin, and Jeremy L. Martin. Enumerating colorings, tensions and flows in cell complexes. J. Combin. Theory Ser. A, 122:82–106, 2014.
  4. Matthias Beck and Yvonne Kemper. Flows on simplicial complexes. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Discrete Math. Theor. Comput. Sci. Proc., AR, pages 817–826. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.
  5. Raoul Bott. Two new combinatorial invariants for polyhedra. Portugaliae Math., 11:35–40, 1952.
  6. Petter Brändén and Luca Moci. The multivariate arithmetic Tutte polynomial. Trans. Amer. Math. Soc., 366(10):5523–5540, 2014.
  7. Michele D’Adderio and Luca Moci. Ehrhart polynomial and arithmetic Tutte polynomial. European J. Combin., 33(7):1479–1483, 2012.
  8. Michele D’Adderio and Luca Moci. Arithmetic matroids, the Tutte polynomial and toric arrangements. Adv. Math., 232:335–367, 2013.
  9. Michele D’Adderio and Luca Moci. Graph colorings, flows and arithmetic Tutte polynomial. J. Combin. Theory Ser. A, 120(1):11–27, 2013.
  10. Emanuele Delucchi and Sonja Riedel. Group actions on semimatroids. ArXiv e-prints, July 2015.
  11. A. M. Duval, C. J. Klivans, and J. L. Martin. Simplicial and Cellular Trees. ArXiv e-prints, June 2015.
  12. Art M. Duval, Caroline J. Klivans, and Jeremy L. Martin. Cuts and flows of cell complexes. J. Algebraic Combin., 41(4):969–999, 2015.
  13. Alex Fink and Luca Moci. Matroids over a ring. To appear in Journal of the European Mathematical Society.
  14. Gil Kalai. Enumeration of -acyclic simplicial complexes. Israel J. Math., 45(4):337–351, 1983.
  15. Vyacheslav Krushkal and David Renardy. A polynomial invariant and duality for triangulations. Electron. J. Combin., 21(3):Paper 3.42, 22, 2014.
  16. Matthias Lenz. Splines, lattice points, and arithmetic matroids. J. Algebraic Combin., 43(2):277–324, 2016.
  17. Bernt Lindström. Nonregular simplicial matroids. Discrete Math., 28(1):101–102, 1979.
  18. Luca Moci. A Tutte polynomial for toric arrangements. Trans. Amer. Math. Soc., 364(2):1067–1088, 2012.
  19. James Oxley. Matroid theory, volume 21 of Oxford Graduate Texts in Mathematics. Oxford University Press, Oxford, second edition, 2011.
  20. Richard P. Stanley. Enumerative combinatorics. Volume 1, volume 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2012.
  21. William T. Tutte. A contribution to the theory of chromatic polynomials. Canadian J. Math., 6:80–91, 1954.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
220551
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description