342
Views
0
CrossRef citations to date
0
Altmetric
Original Article

Face counting formula for toric arrangements defined by root systemsFootnote

&
Pages 66-77 | Received 31 May 2017, Accepted 06 Jul 2018, Published online: 10 Jun 2020

Abstract

A toric arrangement is a finite collection of codimension-1 subtori in a torus. The intersections of these subtori stratify the ambient torus into faces of various dimensions. The incidence relations among these faces give rise to many interesting combinatorial problems. One such problem is to obtain a closed-form formula for the number of faces in terms of the intrinsic arrangement data. In this paper we focus on toric arrangements defined by crystallographic root systems. Such an arrangement is equipped with an action of the associated Weyl group. The main result is a formula that expresses the face numbers in terms of a sum of indices of certain subgroups of this Weyl group.

1 Introduction

An arrangement of hyperplanes is a locally finite collection of hyperplanes in a vector space. Such a collection defines a stratification of the vector space into relatively open convex subsets. The incidence relations among these strata give rise to interesting problems in combinatorics; many of them still unsolved. The simplest possible example of a hyperplane arrangement is an arrangement of lines in the Euclidean plane. Such a collection determines a stratification of the plane consisting of vertices (intersections of lines), edges (maximal connected components of the lines not containing any vertex) and chambers (maximal connected components of the plane containing neither the edges nor the vertices). The combinatorics that emerges from these intersections is intriguing. This is evident by the number of interesting problems and conjectures described in Grünbaum’s exposition [Citation1]. A classical source for systematic discussion of combinatorial aspects of hyperplane arrangements is [Citation2, Chapter 18]. For a more modern exposition we refer the reader to Richard Stanley’s notes [Citation3].

Let A be an arrangement of hyperplanes in Rl. The rank of A is the dimension of the largest subspace spanned by the normals to hyperplanes in A. An arrangement is essential if it is of rank l. We call A a central arrangement if all the hyperplanes pass through a common point; otherwise we call A a non-central arrangement.

There are two posets associated with A, namely, the face poset and the intersection poset. They encode the combinatorial information about the arrangement.

Definition 1

The intersection poset L(A) of a hyperplane arrangement A is defined as the set of all nonempty intersections of hyperplanes, including Rl itself as the empty intersection, ordered by reverse inclusion.

The rank of each element is the codimension of the corresponding intersection. In general L(A) is a (meet) semilattice; it is a lattice if and only if the arrangement is central.

Definition 2

The characteristic polynomial of an arrangement A is: p(A,t)XL(A)μ(Rl,X)tdim(X),where μ(,) denotes the Möbius function of L(A) (see Definition 12).

The hyperplanes of A induce a stratification of Rl; the components of each stratum are (relatively) open polyhedra called faces of A.

Definition 3

The face poset F(A) of A is the set of all faces ordered by topological inclusion: FG if and only if FG¯.

The set of all top-dimensional faces (also called chambers) is denoted by C(A). A natural question regarding chambers asks how does the cardinality C(A) depends on the intersection data? Zaslavsky in his fundamental treatise [Citation4] studied the relationship between the intersection lattice of an arrangement and the number of chambers. His main result is as follows:

Theorem 4

Theorem A [Citation4]

Let A be a hyperplane arrangement in Rl with L(A) as its intersection poset and let p(A,t) be the associated characteristic polynomial. Then C(A) =XL(A) μ(Rl,X) =(1)lp(A,1).

Given a hyperplane arrangement A denote by fi the number of i-dimensional faces (for example, fl is the number of chambers). One of the combinatorial problems in the theory of hyperplane arrangements is to obtain a complete characterization of these numbers. These numbers satisfy the Euler relation i=0l(1)ifi=(1)l.One would like to find more such relations satisfied by fi’s. Another aspect of this problem is to construct a combinatorially defined set whose elements are in one-to-one correspondence with, say, i-dimensional faces of the arrangement. It should be noted that such a problem can only be solved by looking at ‘nice’ families of hyperplane arrangement. We refer the reader to [Citation3] for more details.

Partitioning problems for spaces other than Euclidean and projective spaces have not been extensively studied. To our knowledge the first paper that deals with a more general situation is by Zaslavsky [Citation5]. He derives a formula for counting the number of connected components of a topological space when dissected by finitely many of its subspaces. He showed that not only the combinatorics of the intersections (as encoded by the Möbius function) but also their geometry (as captured by the Euler characteristic) plays a role. In recent years several authors have considered toric arrangements. A toric arrangement is a finite collection of codimension-1 subtori in a torus. The formula for the number of chambers for such arrangements was first discovered by Ehrenborg et al. in [Citation6]; it also appears in [Citation7] and [Citation8]. Recently, Shnurnikov has characterized the set of all possible values of top-dimensional faces for arrangements in a 2-torus in [Citation9] and for arrangements in higher-dimensional tori in [Citation10]. See also [Citation11] for a complete characterization of face numbers in case of arrangements in a 2-torus.

The aim of this paper is to derive a closed form formula for the number of faces of toric arrangements defined by crystallographic root systems. The paper is organized as follows. In Section 2 we introduce toric arrangements in full generality and fix notations. In Section 3 we start with a brief exposition on reflection groups, root systems and associated reflection arrangements. Then we move on to introduce toric Weyl arrangements using affine Weyl groups and prove the face counting formula. We also show that these face numbers satisfy Dehn–Sommerville relations.

2 Toric arrangements

The l-dimensional torus Tl is the quotient space RlZl. When identified with the set [0,1)l it forms an abelian group with the group structure given by the componentwise addition modulo 1. There is also a ‘multiplicative’ way of looking at the torus when we consider it as the product (S1)l. The group structure here is the componentwise multiplication of complex numbers of modulus 1. However, throughout this paper, we stick to the additive way. In this section we define toric arrangements and collect some relevant background material.

We assume the reader’s familiarity with basic algebraic topology and combinatorics. The combinatorics of posets and lattices that we need can be found in Stanley’s book [Citation12].

The field of toric arrangements is fairly recent. Ehrenborg, Readdy and Slone mainly study the problem of enumerating faces of the induced decomposition of the torus in [Citation6]. On the other hand a number theoretic aspect is explored by Lawrence in [Citation7].

We denote by π:RlTl the quotient map. Note that π is also the covering map and Rl is the universal cover. We say that a k-subspace V of Rl is rational if it is the kernel of an n×l matrix A with integer entries. The image V¯π(V) is a closed subgroup of Tl. Topologically V¯ is disconnected and each connected component is a k-torus. The connected components are known as toric subspaces (or cosets) of V¯. Let 0V¯ denote the coset containing 0. Then V¯0V¯ is a finite abelian group whose order is the number of cosets of V¯. One can check that every closed subgroup of the torus arises in this manner. It is important to note that the subgroup V¯ depends only on the free abelian group generated by the row-space of A. Hence one can assume that the rows of A form a basis for the row-space. The subgroup V¯ is connected if and only if the greatest common divisor of all the k×k minors of A is 1.

A toric hyperplane is a toric subspace of codimension-1, i.e., it is the projection of an affine hyperplane in Rl. We have the following definition.

Definition 5

A toric arrangement in Tl is a finite collection A= H1,,Hn of toric hyperplanes.

To every toric arrangement there is an associated periodic hyperplane arrangement à in Rl. The inverse image of each Hi under the covering map π is the union of parallel integer translates of a codimension-1 subspace. We say that a toric arrangement is essential if the associated hyperplane arrangement à is essential. Without loss of generality we assume that a toric arrangement is always essential; which forces nl. If this is not the case then the enumerative problems that we consider in this paper reduce to equivalent problems in a torus of smaller dimension.

The hyperplane arrangement à induces a stratification of Rl such that these open strata are relative interiors of convex polytopes. A nonempty subset FTl is said to be a face of the toric arrangement A if there is a stratum F̃ of à such that π(F̃)=F. The dimension of F is the dimension of the support of F̃ and it is denoted by dim(F).

It is important to note that the closure of F in Tl need not be homeomorphic to a disk. While a toric arrangement stratifies the ambient torus, this stratification need not define a regular cell structure but it does have special properties.

Definition 6

A polytopal complex is a cell complex (X, eλ λΛ) with the following additional data.

(1)

Every cell eλ is equipped with a k-polytopal cell structure which is a pair (Pλ,ϕλ) of a k-convex polytope and a cellular map ϕλ:PλX such that ϕλ(Pλ)=eλ¯ and the restriction of ϕλ to the interior of Pλ is a homeomorphism.

(2)

If eμeλ¯ then eμeλ¯.

(3)

For every face P of Pλ, there exists a cell eμ in X and a map b:QμPλ such that b(IntQμ)=P and ϕλb=ϕμ.

Example 7

Recall that a Δ-complex is a quotient space of a collection of disjoint simplices obtained by identifying certain of their faces via canonical linear homeomorphisms that preserve the ordering of vertices. This is an example of a polytopal complex where all the indexing polytopes are required to be simplices.

The following lemma is a straightforward application of the fact that the covering map π is stratification preserving.

Lemma 8

If A is a toric arrangement in Tl then the induced stratification is polytopal.

Definition 9

The intersection poset L(A) of a toric arrangement A is defined to be the set of all connected components arising from all possible intersections of the toric hyperplanes ordered by reverse inclusion.

By convention, the ambient torus corresponds to the empty intersection. The intersection poset is graded by the codimensions of the intersections. Before proceeding further let us look at a couple of examples.

Example 10

Let A be the toric arrangement in T2 obtained by projecting the lines x=2y and y=2x. These toric hyperplanes intersect in three points p1=(0,0),p2=(13,13) and p3=(23,23). The arrangement stratifies the torus into three 0-faces, six 1-faces and three 2-faces. This is not a regular subdivision of the torus since the closure of every 2-face is a cylinder. shows the arrangement together with the associated intersection poset.

Fig. 1 A toric arrangement in T2.

Example 11

Now consider the arrangement formed by including the projection of the line y=x in the previous arrangement. They intersect in the same three points as above but now there are nine 1-faces and six 2-faces. The induced stratification is a regular Δ-complex. shows the arrangement and the associated intersection poset.

Fig. 2 A toric arrangement with regular cell decomposition.

Since our focus is on counting the number of various-dimensional faces of a toric arrangement we now turn to the combinatorial aspect. The idea that captures the combinatorics of the intersections is the Möbius function of the arrangement which we now define.

Definition 12

The Möbius function of a toric arrangement is the function μ:L(A)×L(A)Z defined recursively as follows: μ(X,Y)=1, if X=Y,XZ<Yμ(X,Z), if X<Y,0, otherwise .

The Möbius function plays an important role in counting the number of faces of an arrangement. The following theorem has appeared in [Citation6, Corollary 3.12], [Citation7, Theorem 3] and [Citation8, Example 5.5].

Theorem 13

Let fk denote the number of k-dimensional faces of a toric arrangement A. Then we have fk=dimY=kdimZ=0YZ μ(Y,Z) .

In this paper we focus on toric arrangements that arise in the context of crystallographic root systems. Moreover, there is a natural action of a Weyl group associated with these arrangements. The main theorem relates the face numbers of a toric Weyl arrangement to indices of certain subgroups.

3 Linear and toric Weyl arrangements

Recall that a finite reflection group acts naturally on a vector space by fixing reflecting hyperplanes. This forms an interesting class of hyperplane arrangements and the group theoretic data plays an important role in their study. We begin by a quick survey of root systems, finite and affine Weyl groups. We follow Humphrey’s book [Citation13, Chapters 1, 4].

Let V be a real vector space of dimension l endowed with a positive definite symmetric bilinear form v,v. For a vector αV the reflection across the linear hyperplane orthogonal to α is given by the formula sα(v)=v2α,vα,αα.Denote by Hα the codimension-1 subspace fixed by sα.

Definition 14

A finite set Φ of non-zero vectors in V is called a root system if it satisfies the following conditions:

(R1)

ΦRα= α,α αΦ;

(R2)

sα(Φ)=ΦαΦ.

The elements of Φ are called roots.

Unless otherwise stated we assume that a root system Φ is essential, i.e., it spans V. For a given a root system Φ the group generated by the reflections sααΦ is a finite reflection group. However, not all the reflections are needed to write down a generating set. A subset ΔΦ is a simple system if Δ is a vector space basis of V and if each root in Φ is a linear combination of elements of Δ with coefficients all of the same sign. The corresponding reflections are called simple reflections.

Theorem 15

[Citation13, Section 1.5]

The group W=sααΦ is generated by the simple reflections sααΔ . Moreover, it has the following presentation W=s1,,sl(sisj)mij=1,where si=sαiΔ and mij is the order of sisj.

3.1 Linear reflection arrangements

The finite reflection group W acts on V via reflections. The set of fixed points of this action is a union of hyperplanes fixed by reflections in W.

Definition 16

Given a finite reflection group W corresponding to an essential root system Φ the reflection arrangement associated to W is AW= HααΦ .

Since Hα=Hα we only need positive roots to define the reflection arrangement. Every face F of a reflection arrangement is a cone over a simplex of dimension dimF1. The action of W is simply-transitive on the set of chambers of AW. In particular, the number of chambers is equal to W . If C is any chamber, then W is generated by the reflections across the walls of C. The closure C¯ is the strict fundamental domain for the W action on V. Let S be the set of reflections with respect to the walls of C. Then, the stabilizer Wx of a point xC¯ is the subgroup generated by Sx sSsx=x . In particular, Wx fixes every point of F¯, where F is the face containing x.

Example 17

The following is the reflection arrangement corresponding to the symmetric group S3.

Let Φ be an essential root system. Arbitrarily choose and fix a simple system ΔΦ. Denote by S the set of generating reflections of W. Finally, let AW be the associated reflection arrangement. The fundamental chamber of AW is defined as C vVsα(v)>0sαS .For a subset IS define CI vC¯sα(v)=0sαIandsα(v)>0sαI .Note first that C=C and second that the set CI is a codimension- I face of AW contained in C¯. It is clear that faces CI IS partition C¯.

As the closure C¯ is a strict fundamental domain for the W action given a face F of AW there exists a wW and JS such that F=wCJ.

Definition 18

Given a subset I of S the subgroup generated by reflections in I is called a parabolic subgroup and is denoted by WI.

Note that WI is the stabilizer of CI. The following two results are consequences of the theorems proved in [Citation13, Section 1.12, Section 1.15]. However we provide necessary details for the benefit of the reader.

Proposition 19

For each fixed IS, the faces wCI and wCI are disjoint unless w,w lie in the same left coset of WI, in which case they coincide.

Proof

Fix I and suppose vwCIwCI. This implies both w1v and w1v are in CIC¯. But the W-orbit of v can intersect C¯ in only one point. So w1v=w1v which means the element ww1 belongs to the isotropy subgroup of v. By the definition of CI and the fact that isotropy subgroup is generated by the reflections fixing it, we deduce that wWIw1 is the isotropy subgroup of v. So ww1wWIw1 which implies the conclusion that wwmodWI. □

Corollary 20

For two disjoint subsets I and J of S the faces wCI and wCJ are disjoint.

Theorem 21

The number fk of k-faces of a reflection arrangement AW are given by the formula: fk=IS I =lk W WI .

Proof

First note that any k-face of AW is in the W-orbit of some k-face CI of C, where I =lk. It follows from Proposition 19 that there is a bijection between the faces of AW labeled wCI and the left cosets wWI. Hence the orbit stabilizer theorem implies that the number of faces labeled by wWI is equal to the index of WI in W. Now fk is obtained by varying I over all the subsets of cardinality lk. □

The following corollary appears in [Citation13, Section 1.11] and is proved using a different argument.

Corollary 22

With the notation as before we have IS(1) I W WI =1.

Proof

The proof only requires rewriting the left hand side:

LHS=k=0l(1)kIS I =k W WI =(1)lk=0(1)lkflk
The equality follows from the Euler relation. □

3.2 Toric Weyl arrangements

Since these arrangements arise in the context of affine Weyl groups we quickly revise the relevant details here.

Definition 23

A root system Φ is called crystallographic if it satisfies in addition to (R1) and (R2) the condition

(R3)

2α,ββ,βZfor allα,βΦ.

Definition 24

Let Φ be a root system as before, then call α2αα,αthe coroot corresponding to αΦ. The set of all coroots Φ is called the dual of Φ; and it is also a root system in V.

Affine reflections are defined using coroots. These are involutive affine maps which fix a hyperplane not passing through the origin. The group generated by affine reflections is called a Euclidean reflection group. For αΦ and kZ, let Hα,k vVv,α =kdenote an affine hyperplane. The corresponding (affine) reflection is given by the formula sα,k(v)=v(v,αk)α.It is easy to see that every affine reflection is a composition of a linear reflection followed by a translation. In particular the following holds: sα,k(v)=sα(v)+kα.

Definition 25

Let Φ be an essential crystallographic root system. The group generated by all affine reflections sα,k with αΦ and kZ is called the affine Weyl group and is denoted by Wa.

Similar to the finite case, the Wa action on V defines an affine hyperplane arrangement.

Definition 26

The affine Weyl arrangement A(Wa) is defined as follows A(Wa) Hα,kαΦ,kZ .

This hyperplane arrangement is clearly invariant under the Wa action. The arrangement stratifies V into open and bounded convex subsets called faces. In this case the codimension-0 faces are called alcoves. The Wa action on alcoves is simply transitive. For an alcove C, the codimension-1 faces of its closure C¯ are called walls of C. Arbitrarily choose and fix a chamber C and let S˜ be the set of reflections with respect to the walls of C. The group Wa is generated by reflections in S˜. The following theorem summarizes some important properties of these arrangements and its proof can be found in [Citation13, Section 4.3].

Theorem 27

The alcove C¯ is an l-simplex and is a strict fundamental domain for the action of Wa on V. The stabilizer of a point xC¯ is the standard subgroup of Wa generated by S˜x= sS˜s(x)=s .

The fundamental alcove is defined by the following inequalities C vVsα(v)>0,αΔ and sα̃(v)<1 .Here α̃ is the unique highest root in Φ. The faces of C¯ are indexed by proper subsets of S˜. For a proper subset JS˜ CJ vVsα(v)=0,sαJ,sα(v)>0,sαJ,sα̃(v)<1 if α̃J; vVsα(v)=0,sαJ α̃ ,sα(v)>0,sαJ,sα̃(v)=1 if α̃J.Since C¯ is the strict fundamental domain for Wa action the faces of A(Wa) are labeled by wCJ for wWa and for some face CJ of the fundamental alcove. It is not hard to verify that each reflection in J fix CJ.

For the affine Weyl group Wa let W denote the subgroup generated by linear reflections, i.e., reflections of the form sα,0. Then structure of Wa can be explained in terms of W and a lattice in V.

Theorem 28

There are points vV such that their stabilizer subgroup is isomorphic to W. Moreover, there is a surjection WaW such that the kernel is isomorphic to the lattice L(Φ) generated by coroots and we have the following semi-direct product structure: WaL(Φ)W.

Since the root system is essential the translation subgroup is isomorphic to Zl, the free abelian group of rank l. The non-identity elements of L(Φ) act by translation and consequently have no fixed points. Moreover this action also preserves the arrangement A(Wa). The quotient VL(Φ) is homeomorphic to the compact torus Tl=(S1)l. We call this torus the coroot torus. The L-orbits of the affine hyperplanes in A(Wa) define a toric arrangement in Tl. Two hyperplanes Hα,k and Hα,m in A(Wa) define the same toric hyperplane in the coroot torus if and only if one is a translate of the other by a coroot. In particular, we have the following two situations:

(1) Hα,k=Hα,0+k2α;(1) (2) Hβ,1=Hβ,0+γ.(2)
For a hyperplane Hα,k of A(Wa) let Hα,k¯ denote its image in the coroot torus.

Definition 29

Given an affine Weyl group Wa and the corresponding root system Φ the toric Weyl arrangement is the following collection of toric hyperplanes in the coroot torus At(Wa) Hαi,ki¯αiΦ,kiZ2Z .

Example 30

Consider the affine Weyl group of type Ã2; it is isomorphic to Z2S3 (S3 is the symmetric group on three letters). Its reflection action on R2 fixes three families of parallel lines. shows the reflecting hyperplanes and the simple coroots.

In the toric Weyl arrangement of type A˜2 is drawn in the fundamental parallelogram.

Fig. 3 The affine arrangement of type Ã2.
Fig. 4 The toric Weyl arrangement of type Ã2.

4 The face counting formula

In order to relate the face numbers with the indices of parabolic subgroups it is convenient to consider a different fundamental domain.

Proposition 31

The coroot torus VL(Φ) can be identified with the W-orbits of the closed fundamental alcove C¯.

Proof

Pick a point yC. Then the set Uy xyxC is an open neighborhood of the origin homeomorphic to C. Observe that UyL(Φ)= 0 since all the translates are disjoint. Since the closed alcove C¯ is a strict fundamental domain for the Wa-action, every point of V is equivalent modulo L(Φ) to the compact set wWwC¯. □

Example 32

We redraw the toric Weyl arrangement of type Ã2 with the new fundamental domain. shows the arrangement; here the coroot torus is obtained by identifying opposite edges of a regular hexagon.

Fig. 5 The toric Weyl arrangement of type Ã2.

Similar to the finite case one can define parabolic subgroups of Wa. Let J be a subset of S˜ and WJ be the subgroup generated by reflections in J. Then WJ is finite if and only if JS˜. Moreover, in this case WJ stabilizes CJ (see [Citation13, Sections 4.7, 4.8]).

Theorem 33

The number fk of k-faces of At(Wa) are given by the formula fk=JS˜ J =lk W WJ .

Proof

The proof is similar to that of Theorem 21. First recall that there exactly l+1 reflections in S˜. Now note that faces of At(Wa) are labeled by wCJ, where wW and CJ is a face of C¯. Consequently, they are in bijection with left cosets wWJ. Now apply the orbit stabilizer theorem. □

4.1 The Dehn–Sommerville relations

Since the Euler characteristic of a positive-dimensional torus is 0 the face numbers of a toric arrangement satisfy the following relation: i=0n(1)ifi=0.However, this relation does not provide a complete characterization of face numbers. In this section we prove a necessary condition that is satisfied by the face numbers of a toric Weyl arrangement.

We say that a toric arrangement is simplicial if the induced stratification is that of a Δ-complex. Note that a simplicial arrangement need not define the structure of a simplicial complex on the torus. For example, the arrangement in Example 11 is a simplicial arrangement such that the resulting stratification is not a simplicial complex. The arrangement consisting of the line y=x is also simplicial however the stratification is not even regular.

Face numbers of simplicial polytopes satisfy special kind of relations known as the Dehn–Sommerville relations [Citation2, Section 9.2]. It was shown by Klee in [Citation14] that similar relations are satisfied by simplicial complexes that arise as triangulations of closed manifolds.

Theorem 34

Let K be a simplicial complex homeomorphic to a closed l-manifold and let fi denote the number of i-simplices. Then the face numbers of K satisfy the following Dehn–Sommerville relations (3) fi=j=il(1)j+lj+1i+1fj,(3) for i=0,1,,l.

Define an (l+1)×(l+1) upper triangular, integer matrix D=(dij),0i,jl as follows dij=(1)j+lj+1i+1.The face vector of K is an l-tuple f(f0,,fl) whose components are face numbers of K. Then Eq. (Equation3) can be rewritten as f=Df.

Lemma 35

Let K be a non-regular Δ-complex. Then its first barycentric subdivision is a regular Δ-complex and the second subdivision is a simplicial complex.

Proof

See [Citation15, Section 10.3]. □

In view of the above lemma we need to show that the Dehn–Sommerville relations remain invariant under barycentric subdivision. As a first step we figure out a relationship between the face numbers of an l-dimensional Δ-complex K, and the face numbers of its barycentric subdivision. Denote by f the face vector of the barycentric subdivision sd(K).

Lemma 36

Let B=(bij),0i,jl be an (l+1)×(l+1) integer matrix with the entries bij=k=0i(ki1)k+j+1i+1kThen f=Bf.

Proof

See [Citation16, Lemma 2.1]. Note that since bii=(i+1)! the matrix B is invertible. □

Theorem 37

If the face vector f of the subdivision sd(K) satisfies Dehn–Sommerville relations then so does the face vector f of K.

Proof

First observe that BD=DB. Now the proof is straightforward.

f=DfBf=DBf=BDf.

Corollary 38

The face numbers of a toric Weyl arrangement satisfy the Dehn–Sommerville relations.

Notes

Peer review under responsibility of Kalasalingam University.

References

  • Grünbaum B. Arrangements and Spreads CBMS Reg. Conf. Ser. Math. vol. 10 (1972) American Mathematical Society. Providence, R.I.. iv+114.
  • Grünbaum B. Convex Polytopes Pure and Applied Mathematics vol. 16 (1967) Wiley Interscience. New York. xiv+456.
  • Stanley R.P. An introduction to hyperplane arrangements Geometric Combinatorics IAS/Park City Math. Ser. vol. 13 (2007) Amer. Math. Soc.. Providence, RI. 389–496.
  • Zaslavsky T. Facing up to arrangements: face-count formulas for partitions of space by hyperplanes Mem. Amer. Math. Soc. 1 1 Special Issue: Special Issue: International Conference on Discrete Mathematics 1975 154
  • Zaslavsky T. A combinatorial analysis of topological dissections Adv. Math. 25 3 1977 267 285
  • Ehrenborg R. Readdy M. Slone M. Affine and toric hyperplane arrangements Discrete Comput. Geom. 41 4 2009 481 512
  • Lawrence J. Enumeration in torus arrangements European J. Combin. 32 6 2011 870 881
  • Deshpande P. On a generalization of Zaslavsky’s theorem for hyperplane arrangements Ann. Comb. 18 1 Special Issue: Special Issue: International Conference on Discrete Mathematics 2014 35 55
  • Shnurnikov I.N. On the number of regions formed by sets of closed geodesics on flat surfaces Mat. Zametki 90 4 2011 637 640
  • I. Shnurnikov, On the number of connected components of complements to arrangements of subtori http://arxiv:1412.8722 [math.AT].
  • K. Chandrashekhar, P. Deshpande, Face enumeration for line arrangements in a 2-torus http://arxiv:1404.1665 [math.CO].
  • Stanley R.P. Enumerative Combinatorics. Volume 1 Cambridge Studies in Advanced Mathematics vol. 49 (1997) Cambridge University Press. Cambridge. xiv+626.
  • Humphreys J.E. Reflection Groups and Coxeter Groups Cambridge Studies in Advanced Mathematics vol. 29 (1990) Cambridge University Press. Cambridge. xii+204.
  • Klee V. A combinatorial analogue of Poincaré’s duality theorem Canad. J. Math. 16 1964 517 531
  • Kozlov D. Combinatorial Algebraic Topology Algorithms and Computation in Mathematics vol. 21 (2008) Springer. Berlin. xx+389.
  • Brenti F. Welker V. f-vectors of barycentric subdivisions Math. Z. 259 4 2008 849 865