An equivalent formulation of chromatic quasi-polynomials
Tan Nhat Tran

TL;DR
This paper proves that two different types of quasi-polynomials related to arrangements and colorings are actually equivalent, unifying their interpretations and applications in combinatorics.
Contribution
It establishes the equivalence between Chen-Wang's quasi-polynomial and BrÀndén-Moci's chromatic quasi-polynomial, showing they count the same combinatorial objects.
Findings
The two quasi-polynomials are mathematically equivalent.
They enumerate the same set sizes in different contexts.
This unification simplifies the understanding of related combinatorial invariants.
Abstract
Given a central integral arrangement, the reduction of the arrangement modulo positive integers gives rise to a subgroup arrangement in . Kamiya-Takemura-Terao (2008) introduced the notion of characteristic quasi-polynomials, which uses to evaluate the cardinality of the complement of the subgroup arrangement. Chen-Wang (2012) found a similar but more general setting that replacing the integral arrangement by its restriction to a subspace of , and evaluating the cardinality of the -reduction complement will also lead to a quasi-polynomial in . On an independent study, Br\"and\'en-Moci (2014) defined the so-called chromatic quasi-polynomial, and initiated the study of -colorings on a finite list of elements in a finitely generated abelian group. The main purpose of this paper is to verify that the Chen-Wang's quasi-polynomialâŠ
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
An equivalent formulation of chromatic quasi-polynomials
Tan Nhat Tran
Tan Nhat Tran, Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.
Abstract.
Given a central integral arrangement, the reduction of the arrangement modulo positive integers gives rise to a subgroup arrangement in . Kamiya-Takemura-Terao (2008) introduced the notion of characteristic quasi-polynomials, which uses to evaluate the cardinality of the complement of the subgroup arrangement. Chen-Wang (2012) found a similar but more general setting that replacing the integral arrangement by its restriction to a subspace of , and evaluating the cardinality of the -reduction complement will also lead to a quasi-polynomial in . On an independent study, BrĂ€ndĂ©n-Moci (2014) defined the so-called chromatic quasi-polynomial, and initiated the study of -colorings on a finite list of elements in a finitely generated abelian group. The main purpose of this paper is to verify that the Chen-Wangâs quasi-polynomial and the BrĂ€ndĂ©n-Mociâs chromatic quasi-polynomial are equivalent in the sense that the quasi-polynomials enumerate the cardinalities of isomorphic sets.
Key words and phrases:
-Tutte polynomial, chromatic quasi-polynomial, characteristic quasi-polynomial
2010 Mathematics Subject Classification:
05A19 (Primary), 52C35 (Secondary)
1. Introduction
Background. In the simplest setting, when a finite list of integer vectors in is given, we may naturally associate to it a central hyperplane arrangement in , which we call integral arrangement. The study of a hyperplane arrangement typically goes along with the study of its characteristic polynomial as the polynomial carries combinatorial and topological information of the arrangement (e.g., [OS80]). In this paper, we are mainly interested in an arithmetical method, generally known as âfinite field methodâ, for studying the integral arrangements. The method probably was first initiated by [CR70] and developed into a systematic tool by Athanasiadis [Ath96], after closely related techniques have been used by Björner-Ekedahl [BE97], and Blass-Sagan [BS98] to solve problems related to subspace arrangements. Roughly speaking, suppose that the integral arrangement associated to the list is given, we can take coefficients modulo a positive integer and get an arrangement of subgroups in . One of the reasons why the method is regarded as the âfinite field methodâ presumably comes from one of the most well-known and fundamental results in the theory. It states that when is a sufficiently large prime, the arrangement now is defined over the finite field , and the cardinality of its complement coincides with , the evaluation of the characteristic polynomial of at (e.g., [Ath96, Theorem 2.2]).
The fundamental theorem mentioned above is efficiently applicable to compute the characteristic polynomials of several arrangements arising from root systems (e.g., [Ath96]). Kamiya-Takemura-Terao [KTT08] showed that the cardinality of the complement is actually a quasi-polynomial in , and named this the characteristic quasi-polynomial of as its -constituent is identical with . Chen-Wang [CW12] considered the restriction of the integral arrangement to a subspace of , and proved a stronger result that after taking reduction modulo of the restricted arrangement, the cardinality of the complement of is also a quasi-polynomial in . Later on, Yoshinaga ([Yos16], [Yos18]) extended the analysis on the deformations of root system arrangements and enhanced the calculation of the characteristic quasi-polynomials via the connection with Ehrhart quasi-polynomials.
In yet another consideration, given a finite list in , we can also associate it a toric arrangement in the torus with is or (e.g., [DCP05], [Moc12]). Although we are concerned with the subtori (hypersurfaces) instead of the hyperplanes, the âfinite field methodâ remains alive and is formulated in various ways (e.g., [Law11], [ERS09], [ACH15]). To compute and even to make a broader understanding the characteristic polynomial, an arithmetical generalization of the ordinary Tutte polynomial [Tut54], the arithmetic Tutte polynomial was introduced [Moc12]. These polynomials are currently receiving increasing attention (e.g., [DM13], [FM16]). BrĂ€ndĂ©n-Moci [BM14] defined the Tutte quasi-polynomial associated to a finite list of elements in a finitely generated abelian group. This quasi-polynomial not only produces the interpolation between the Tutte polynomial and the arithmetic Tutte polynomial but also gives rise to chromatic quasi-polynomial and flow quasi-polynomial. These are group-theoretical counterparts of the graphic chromatic and flow polynomials which proved to have an application to colorings and flows on CW complexes [DM].
Our result. A newly introduced notion of -Tutte polynomials [LTY17] establishes a common generalization of several âTutte-likeâ polynomials including all of the (quasi-)polynomials mentioned previously. In particular, the notion of -Tutte polynomials is useful that enables us to unify the objects. We take the advantage to get the result that the Chen-Wangâs quasi-polynomial and the BrĂ€ndĂ©n-Mociâs chromatic quasi-polynomial are âthe sameâ in the sense that any Chen-Wangâs quasi-polynomial is a chromatic quasi-polynomial and vice versa (equalities (3.3) and (3.4)).
Organization of the paper. The remainder of the paper is organized as follows. In Section 2, we recall definitions of the characteristic, Chen-Wangâs quasi-polynomials (§2.1), the chromatic quasi-polynomials (§2.2) and briefly recall the motivations of why they have been defined. In Section 3, after recalling the basic facts of -Tutte polynomials, we show the equivalence of the chromatic quasi-polynomials and the Chen-Wangâs quasi-polynomials (equalities (3.3) and (3.4)). In §3.2, we give a Deletion-Contraction formula (Theorem 3.7) for the chromatic quasi-polynomials. By using the language of chromatic quasi-polynomials, we also give a discussion to a problem asked by Chen-Wang (Problem 3.11). In Section 4, we generalize the fundamental theorem in the primary âfinite field methodâ applied to any -plexification. That is, the -constituent of the chromatic quasi-polynomial of a list either is [math] or agrees with the characteristic polynomial of the corresponding -plexification , and the characteristic polynomial of any -plexification can be computed by the -constituent of the chromatic quasi-polynomial of the deletion list of by the list of its torsion elements (Theorem 4.4 and Proposition 4.5).
2. Preliminaries
Let us first fix some definitions and notations throughout the paper.
A function is called a quasi-polynomial if there exist and polynomials () such that for any ,
[TABLE]
when . The number is called a period and the polynomial is called the -constituent of .
Let be a finitely generated abelian group, and let be a finite list (multiset) of elements in . We will use the term pair to refer to these objects.
For each sublist , we denote by the rank (as an abelian group) of the subgroup generated by . By the Structure Theorem, we may write where and . The LCM-period of is defined by
[TABLE]
Given a group , denote by the torsion subgroup of . Denote
[TABLE]
We are going to investigate one of typical problems in enumerative combinatorics: counting the sizes of sets which depend on positive integers . Our motivated example is the graphic chromatic polynomials. Let be a graph. Enumerating the set of all proper -colorings, i.e., labelings such that adjacent vertices get different labels: if then , gives rise to a polynomial in . The polynomial is broadly known as the chromatic polynomial of , going back to Birkhoff and Whitney. More generally, it happens quite often that enumerating the cardinalities of sets will lead to quasi-polynomials. One of the most famous examples is that given a rational polytope , the function for agrees with a quasi-polynomial, called the Ehrhart quasi-polynomial.
2.1. Characteristic and Chen-Wangâs quasi-polynomials
Our next and important example that a quasi-polynomial appears in the counting problem list is that of characteristic quasi-polynomials. We will define the characteristic quasi-polynomials in a slightly different language to what has been stated in the Introduction part. For instance, the arrangement called -reduction arrangement in [KTT08] and its complement will not appear here but later in Section 3.1 after invoking the notion of -plexifications. We specify . Let , and set . For simplicity of notation, we use the same symbols and z for the realizations of the list and the element as matrices of size and , respectively. Denote
[TABLE]
We agree that , thought of as no constraints on z. Kamiya-Takemura-Terao [KTT08] produced two different methods with one of them relies on the theory of Ehrhart quasi-polynomials to show that is a monic quasi-polynomial in with a period . The quasi-polynomial is called the characteristic quasi-polynomial of . The name really explains the main reason of why the quasi-polynomial was introduced as its generality influences the study of real hyperplane arrangements. That is, its -constituent coincides with the characteristic polynomial (e.g., [OT92, Definition 2.52]) of the hyperplane arrangement in with is the hyperplane orthogonal to (e.g., [Ath96], [KTT08]).
Let be another finite list in . Chen-Wang [CW12] considered a more general setting
[TABLE]
and applied the elementary divisor method of [KTT08] to show that the cardinality is also a quasi-polynomial in . The notion of Chen-Wangâs quasi-polynomials strictly generalizes that of characteristic quasi-polynomials because when is the zero matrix, and while still depends on .
2.2. Chromatic quasi-polynomials
Let be any pair. BrÀndén-Moci [BM14] defined the following set
[TABLE]
and proved that its cardinality is a quasi-polynomial in for which is a period.111BrĂ€ndĂ©n-Moci actually defined a somewhat different period. However, the fact that is also a period becomes clear after proving Theorem 3.5. Thus any characteristic quasi-polynomial is indeed a BrĂ€ndĂ©n-Mociâs quasi-polynomial by the following way. Fix a standard basis (of unit vectors) for , and apply the isomorphism to obtain .
The authors named the quasi-polynomial the chromatic quasi-polynomial as it generalizes the concept of chromatic polynomials defined on graphs. We briefly recall how it can be seen. Let be a graph. Define a list of vectors in as follows. If , let be the vector with entry is , entry is , and the other entries are [math]. Then the chromatic polynomial of can be expressed as with the unique constituent coincides with the characteristic polynomial of the real graphical arrangement in variable (e.g., [OT92, Theorem 2.88]).
3. Unify the quasi-polynomials
3.1. -Tutte polynomials
The Chen-Wangâs quasi-polynomial and the BrĂ€ndĂ©n-Mociâs chromatic quasi-polynomial arise independently in different contexts and may seem unrelated at first glance. We will show that the notion of -Tutte polynomials is useful to unify them.
Let be an arbitrary abelian group. We recall the notions of -plexifications and -Tutte polynomials of following [LTY17, §3]. We regard as our total group. For each , we define the -hyperplane associated to as follows:
[TABLE]
Then the -plexification of is the collection of the subgroups
[TABLE]
The -complement of is defined by
[TABLE]
For any sublist , the deletion is defined as a list of elements in the same group . We also define the contraction as the list of cosets in the group . The method of identifying sets discussed in [LTY17, §3.2] enables us to write
[TABLE]
An abelian group is said to be torsion-wise finite if is finite for all . In what follows, we assume that is torsion-wise finite.
Definition 3.1**.**
The -multiplicity for each is defined by
[TABLE]
Definition 3.2**.**
- (1)
The -Tutte polynomial of is defined by
[TABLE] 2. (2)
The -characteristic polynomial of is defined by
[TABLE]
The notion of -reduction arrangements we mentioned in §2.1 is specialization of that of -plexifications. For general , it turns out that
[TABLE]
Using formula (3.1) and the equality (3.2) above, we can write
[TABLE]
Thus any Chen-Wangâs quasi-polynomial is a chromatic quasi-polynomial defined on a certain contraction list. The converse is also true as we will see in the lemma below.
Lemma 3.3**.**
Given a pair with , we can find two lists with such that .
Proof.
We can view , where , has in the -th coordinate and 0 elsewhere. Thus can be identified with a list of cosets with . We choose a representative for each coset, which is determined up to a linear combination of elements from . Define , and . Thus . â
Remark 3.4*.*
The construction of the lists and presented in Lemma 3.3 is probably well-known among experts, for instance [DM13, §3.4], wherein it plays a crucial role in proving the representability of the duals of arithmetic matroids.
With the notation as in Lemma 3.3, for any pair we can write
[TABLE]
We have verified that the Chen-Wangâs quasi-polynomial and the BrĂ€ndĂ©n-Mociâs chromatic quasi-polynomial are âequivalentâ in the sense that the quasi-polynomials enumerate the cardinalities of isomorphic sets.
3.2. More on chromatic quasi-polynomials
Given any pair , let us denote by the chromatic quasi-polynomial of i.e., . We also write for the -constituent of ().
Theorem 3.5** ([BM14], [LTY17]).**
**
Proposition 3.6** ([CW12]).**
- (1)
For any with , . 2. (2)
* satisfies the GCD-property i.e. if .* 3. (3)
For any with , if , then .
Fix . Denote , and .
Theorem 3.7** (Deletion-Contraction formula).**
[TABLE]
Proof.
This follows directly from [LTY17, Corollary 4.11] and Theorem 3.5 by letting . We can also obtain it from [LTY17, Proposition 3.4]. â
Remark 3.8*.*
Using Theorem 3.7, the Deletion-Restriction formula in [CW12, Lemma 3.3] can be exhibited by setting as the contraction list , where and are finite lists in .
Corollary 3.9**.**
If , then the -constituents satisfy
[TABLE]
Proof.
Note that the LCM-period of any deletion/contract list is a divisor of the LCM-period of the parent list. â
Remark 3.10*.*
For a pair , the LCM-period of is not necessarily the minimum period. We clarify it by an example. Let , with and . Then , while the minimum period is actually 1 and for every . Note that this fact can also be clarified by another class of examples originated from [CW12, Example 4.2].
We close this section by giving a discussion on a problem asked in [CW12, Problem 2].
Problem 3.11**.**
Let be finite lists in with . Assume that for every . Then there exists such that .
Discussion.
The statement is true if and only if . Assume that . By equality (3.3), we rewrite the assumption as with , and for some . Suppose to the contrary that for every , . It is equivalent to saying that for all . Set . For each with , set . Thus
[TABLE]
which is a contradiction. For , we show that the statement is not true by providing a counterexample. Let us first prove the following fact: if is a finite abelian group containing at least two distinct nonidentity elements of order 2, say , and , then for every . Indeed by definition,
[TABLE]
If the set above is nonempty, then , are distinct and both have order 2 in . This contradiction implies that . With the notation as in equality (3.4), . Now choose with , and let , .
â
4. Application to hyperplane arrangements
The aim of this section is to generalize the result in [KTT08] that the -constituent of agrees with the characteristic polynomial of some real arrangement. A natural choice is . However, as long as is any finitely generated abelian group and the list may contain torsion elements of , we need to know what is all about. It turns out that we can realize as a certain (restriction of) integral arrangement. Then we also would like to compute the characteristic polynomial of any -plexification . These facts will be made clear in Theorem 4.4 and Propositions 4.3, 4.5. More generally, we will give other interpretations for every chromatic quasi-polynomial and their constituents through subspace and toric viewpoints in our forthcoming paper [TY18].
In the following setting and until before Proposition 4.3, we restrict our attention to the case , and view as a finite list of nonzero vectors in . We regard as the standard basis for , and equip to it the standard inner product . Then the -plexification is an arrangement of (possibly repeated) hyperplanes in with each hyperplane can be identified with . Such -plexifications are integral arrangements. Let be the intersection poset (e.g., [OT92, §2.1]) of . Note that we require the intersection poset to be a set, not multiset. Also, the ambient space can be added to the arrangement without affecting the arrangementâs intersection poset. For each , the localization of on is defined by
[TABLE]
and the restriction of to is defined by
[TABLE]
Denote by the orthogonal complement of in . Set
[TABLE]
Proposition 4.1**.**
The following formulas are valid at level of multisets:
- (1)
. 2. (2)
.
Proof.
The proof of (1) is straightforward. To prove (2), for every with , we use , the longest expression of in terms of intersection of the hyperplanes in . To see as multisets, note that the number of occurrences of each element in these multisets is equal to . â
Denote by the characteristic polynomial of the real arrangement (e.g., [OT92, Definition 2.52]). The following result is essentially appeared in [CW12, Corollary 2.4] (see also [Ath96, Corollary 6.1]). The idea of the proof is to use Whitneyâs theorem (e.g., [Sta07, Theorem 2.4]) and Proposition 4.1.
Lemma 4.2**.**
**
Now we give an arrangement theoretic realization for .
Proposition 4.3**.**
Given a pair , if then is an integral arrangement, and also can be realized as a restriction of where is a finite list in some .
Proof.
We use the notation as in Lemma 3.3. Set , then . The condition is crucial, otherwise it may happen that . By Proposition 4.1, . This means that is the restriction of to , and also can be identified with an integral arrangement in . â
Next, we prove an important property of , which is the main theorem of this section.
Theorem 4.4**.**
Let be any pair. Then
[TABLE]
Proof.
If , we apply Proposition 4.3 and Lemma 4.2. If , note that and have the same intersection poset. â
The -constituent sometimes can be regarded as the chromatic polynomial defined on a graph, for example, via connection with graphical arrangements discussed in §2.2. It is well known (and easy to show) that the graphic chromatic polynomial is identical to 0 if the graph contains some (graph theoretic) loop. Recall from [DM13, §4.4] that an element is called a loop (resp. coloop) if (resp. ). An element that is neither a loop nor a coloop is said to be proper. We will prove in the proposition below that a similar result holds for .
Proposition 4.5**.**
Let be any pair with . Then
[TABLE]
Proof.
Use Corollary 3.9 (viewing as ) to reduce the problem to the case that with and consist of only coloops and loops, respectively. Then apply Proposition 3.6(1). â
Remark 4.6*.*
There is a neater proof: fix and break into two summations with one of them is taken over .
Example 4.7**.**
Let , with , and . Then , and
[TABLE]
[TABLE]
Note that , where and , which can also be identified with the integral arrangement in . In either way,
[TABLE]
Acknowledgements: The author is greatly indebted to Professor Masahiko Yoshinaga for many stimulating conversations, helpful suggestions and for his active interest in the publication of the paper. He also gratefully acknowledges the support of the scholarship program of the Japanese Ministry of Education, Culture, Sports, Science, and Technology (MEXT) under grant number 142506.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ACH 15] F. Ardila, F. Castillo, and M. Henley. The arithmetic Tutte polynomials of the classical root systems. International Mathematics Research Notices , 2015(12):3830â3877, 2015.
- 2[Ath 96] C. A. Athanasiadis. Characteristic polynomials of subspace arrangements and finite fields. Adv. Math. , 122:193â233, 1996.
- 3[BE 97] A. Björner and T. Ekedahl. Subspace arrangements over finite fields: cohomological and enumerative aspects. Adv. Math. , 129:159â187, 1997.
- 4[BM 14] P. BrĂ€ndĂ©n and L. Moci. The multivariate arithmetic Tutte polynomial. Trans. Amer. Math. Soc. , 366(10):5523â5540, 2014.
- 5[BS 98] A. Blass and B. Sagan. Characteristic and Ehrhart polynomials. J. Algebr. Comb. , 7:115â126, 1998.
- 6[CR 70] H. Crapo and G.-C. Rota. On the Foundations of Combinatorial Theory: Combinatorial Geometries . Preliminary edition, MIT Press, Cambridge, MA, 1970.
- 7[CW 12] B. Chen and S. Wang. Comparison on the coefficients of characteristic quasi-polynomials of integral arrangements. Journal of Combinatorial Theory, Series A , 119:271â281, 2012.
- 8[DCP 05] C. De Concini and C. Procesi. On the geometry of toric arrangements. Transform. Groups , 10(3-4):387â422, 2005.
