# [kappa]-parabolic subspace arrangements.

1 Introduction

A subspace arrangement A is a collection of linear subspaces of a finite-dimensional vector space V, such that there are no proper containments among the subspaces. Examples of subspace arrangements include real and complex hyperplane arrangements. One of the main questions regarding subspace arrangements is to study the structure of the complement M(A) = V - [[union].sub.X[member of]A] X. A combinatorial tool that has proven useful in studying the complement is the intersection lattice, L(A), which is the lattice of intersections of subspaces, ordered by inclusion. Many results regarding the homology and homotopy theory of M(A) can be found in the book by Orlik and Terao [17], when A is a real or complex hyperplane arrangement.

There are two interesting problems regarding homotopy of M(A) that we will concern ourselves with. The first problem is determining whether or not M(A) is an Eilenberg-MacLane space. An Eilenberg-MacLane space (or K([pi], m)-space) is a space X such that [[pi].sub.k](X) = 0 for i [not equal to] m and [[pi].sub.m] (X) = [pi]. A K([pi], 1) subspace arrangement is an arrangement whose complement is a K([pi], 1) space. It is worth noting that not all complex hyperplane arrangements are K([pi], 1)-spaces. The second problem is to find a presentation for the fundamental group of M(A).

We will look at several motivating examples where both questions have been answered. One example of a complex K([pi], 1) hyperplane arrangement is the braid arrangement, which is the collection of "diagonals" [z.sub.i] = [z.sub.j] for 1 [less than or equal to] i < j [less than or equal to] n from a complex n-dimensional vector space. In 1963, Fox and Neuwirth [14] showed that the fundamental group of the complement is isomorphic to the pure braid group. It was also shown by Fadell and Neuwirth [12] that the higher homotopy groups of the complement are trivial. Thus this is an example of a K([pi], 1)-arrangement.

An example of a real K([pi], 1) subspace arrangement is the 3-equal arrangement, which is the collection of all subspaces of the form [x.sub.i] = [x.sub.j] = [x.sub.k] for 1 [less than or equal to] i < j < k [less than or equal to] n in a real n-dimensional vector space. It was Khovanov, in 1996, who proved that this is a K([pi], 1) subspace arrangement [16]. He also gave a presentation for the fundamental group of the complement. The presentation of this group, as well as the presentation of the pure braid group, use the symmetric group in their construction. It is well known that the symmetric group is generated by adjacent transpositions [s.sub.i] = (i, i + 1), i [member of] [n - 1], subject to the following relations:

1. [s.sup.2.sub.i] = 1

2. [s.sub.i] [s.sub.j] = [s.sub.j] [s.sub.i], if [absolute value of i - j] > 1

3. [s.sub.i] [s.sub.i+1] [s.sub.i] = [s.sub.i+1][s.sub.i][s.sub.i+1]

The braid group has presentation given by the same generating set, but subject only to relations 2 and 3. The pure braid group is the kernel of the surjective homomorphism, [phi], from the braid group to the symmetric group, given by [phi]([s.sub.i]) = [s.sub.i] for all i [member of] [n - 1]. Khovanov's presentation of the fundamental group of the complement of the 3-equal arrangement is very similar. He defines the triplet group, which we shall denote [A'.sub.n-1]. This group has a presentation given by the generators [s.sub.i], but subject only to relations 1 and 2, and he defines the pure triplet group to be the kernel of the surjective homomorphism, [phi]' : [A'.sub.n-1] [right arrow] [A.sub.n-1], given by [phi]'([s.sub.i]) = [s.sub.i] for all i [member of] [n - 1]. Khovanov showed that the fundamental group of the complement of the 3-equal arrangement is isomorphic to the pure triplet group. Thus, Khovanov found a "real analogue" to the results of Fadell, Fox and Neuwirth.

The work of Fadell and Neuwirth has been generalized to other hyperplane arrangements. A simplicial hyperplane arrangement is an arrangement whose regions are simplicial cones. In 1972, Deligne [11] showed that the complexification of any simplicial hyperplane arrangement is a K([pi], 1)-arrangement. Given a finite real reflection group W, consider the complexification of the reflection arrangement associated to W. Since reflection arrangements are simplicial, their complexifications are K([pi], 1)-arrangements. Moreover, in 1971 Brieskorn [9] found that the fundamental group of the complement is isomorphic to the pure Artin group of type W. We review the definition of Artin groups in Section 4.

Our primary interest is to give "real analogues" of these results for subspace arrangements in [R.sup.n] that correspond to finite real reflection groups. In particular, given a finite real reflection group W, we define a family of (real) subspace arrangements which we call k-parabolic arrangements. We show in Theorem 4.1 that the fundamental group of the complement of a 3-parabolic arrangement has the following simple description. We construct a new Coxeter group W' on the same generating set S as W, but we relax all relations of W that are not commutative relations nor involutions. Then the fundamental group is the kernel of a surjective homomorphism [phi]' : W' [right arrow] W given by [phi]'(s) = s for all s [member of] S. It turns out that the 3-parabolic arrangement is also a K([pi], 1) arrangement, a result due to Davis et al. (Theorem 0.1.9 in [10]).

Our primary tool for finding our presentation is the notion of discrete homotopy theory. Discrete homotopy theory is a theory that was developed in [2]. The theory involves constructing a bigraded sequence of groups defined on an abstract simplicial complex that are invariants of a combinatorial nature. Instead of being defined on the topological space of a geometric realization of a simplicial complex, the discrete homotopy groups are defined in terms of the combinatorial connectivity of the complex. That is, we are interested in how simplices intersect. In this paper, we show that the discrete fundamental group of the Coxeter complex is isomorphic to [[phi].sub.1] of the complement of the 3-parabolic arrangement. Thus, our result shows that sometimes we can replace a group defined in terms of the topology of the space with a group defined in terms of the combinatorial structure of the space.

In Section 2 we give a definition of the k-parabolic arrangement, and review some necessary definitions related to Coxeter groups. We also relate k-parabolic arrangements to previous analogues of the k-equal arrangement given by Bjorner and Sagan [7] for types B and D. In Section 3, we give a brief overview of discrete homotopy theory and the definition of the Coxeter complex. Then we give an isomorphism between the classical fundamental group of the complement of the 3-parabolic arrangement and the discrete fundamental group of the corresponding Coxeter complex. In Section 4, we use this isomorphism and a study of discrete homotopy loops in the Coxeter complex to obtain our algebraic description of the fundamental group of the complement of the 3-parabolic arrangement. In Section 5 we conclude with some open questions related to [W.sub.n,k]-arrangements as well as a discussion on the K([pi], 1) problem.

2 Definition of the [W.sub.n,k]-arrangement

Let W be a finite real reflection group acting on [R.sup.n] and fix a root system [PHI] associated to W. Let {PI] [subset] [PHI] be a fixed simple system. Finally, let S be the set of simple reflections associated to [PI]. Assume that [PI] spans [R.sup.n]. We let m(s, t) denote the order of st in W. We know that m(s, s) = 1 and m(s, t) = m(t, s) for all s, t [member of] S. Finally, given a root [alpha], let [s.sub.[alpha]] denote the corresponding reflection, and let (*,*) denote the standard inner product.

Recall that there is a hyperplane arrangement associated to W, called the Coxeter arrangement H(W), which consists of hyperplanes [H.sub.[alpha]] = {x [member of] [R.sup.n] : (x, [alpha]) = 0} for each [alpha] [member of] [[PHI].sup.+]. Since n spans [R.sup.n], the Coxeter arrangement is central and essential, which implies that the intersection of all the hyperplanes is the origin.

Since we are generalizing the k-equal arrangement, which corresponds to the case W = [A.sub.n], we use it as our motivation. For this paper, we will actually work with the essentialized k-equal arrangement. The k-equal arrangement, [A.sub.n,k] is the collection of all subspaces given by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] over all indices {[i.sub.1],..., [i.sub.k]} [subset] [n + 1], with the relation [[summation].sup.n+1.sub.1] [x.sub.i] = 0. The k-equal arrangement is an arrangement that has been studied extensively ([6], [8], [16]). We note that the intersection poset L([A.sub.n,k]) is a subposet of L(H([A.sub.n])). There is already a well-known combinatorial description of both of these posets. The poset of all set partitions of [n + 1] ordered by refinement is isomorphic to L(H([A.sub.n])), and under this isomorphism, L([A.sub.n,k]) is the subposet of set partitions where each block is either a singleton, or has size at least k. However, our generalization relies on a lesser-known description of these posets in terms of parabolic subgroups.

Definition 2.1 A subgroup G [subset or equal to] W is a parabolic subgroup if there exists a subset T C [subset or equal to] of simple reflections, and an element w [member of] W such that G =< w[Tw.sup.-1]>. If w can be taken to be the identity, then G is a standard parabolic subgroup. We view (G, wT[w.sup.-1]) as a Coxeter system, and call G irreducible if (G, wT[w.sup.-1]) is an irreducible system.

It is well known that the lattice of standard parabolic subgroups, ordered by inclusion, is isomorphic to the Boolean lattice. However, the lattice of all parabolic subgroups, P(W), ordered by inclusion, was shown by Barcelo and Ihrig [1] to be isomorphic to L(H(W)). Since this isomorphism is essential to our generalization, we review it. The isomorphism is given by sending a parabolic subgroup G to Fix(G) = {x [member of] [R.sup.n] : wx = x, [for all]w [member of] G}, and the inverse is given by sending an intersection of hyperplanes X to Gal(X) = {w [member of] W : wx = x, [for all]x [member of] X}.

This Galois correspondence gives a description of L(H([A.sub.n])) in terms of parabolic subgroups of [A.sub.n]. We also obtain another description of L([A.sub.n,k]) under this correspondence.

Proposition 2.2 The Galois correspondence gives a bijection between subspaces of [A.sub.n,k] and irreducible parabolic subgroups of [A.sub.n] of rank k - 1.

Proof: Let X be a subspace of [R.sup.n+1] given by [x.sub.1] = ... = [x.sub.k]. The k-equal arrangement is the orbit of X under the action of [A.sub.n] = [S.sub.n+1], and Gal(X) =< (1, 2),..., (k - 1, k) >, hence is irreducible. For w [member of] [A.sub.n], Gal(wX) = wGal(X)[w.sup.-1], so all of the subspaces in the k-equal arrangement have irreducible Galois groups.

Conversely, every irreducible parabolic subgroup of rank k - 1 in [A.sub.n] is the Galois group of some subspace in the k-equal arrangement. To see this, consider an irreducible parabolic subgroup G of rank k -1. Then there exists a standard parabolic subgroup H and an element w [member of] W such that G = wH[w.sup.-1]. Since H is an irreducible standard parabolic subgroup, H =< (i, i + 1),..., (i + k - 1, i + k) > for some 1 [less than or equal to] i [less than or equal to] n + 1 - k. Thus, Fix(H) is given by [x.sub.i] = ... = [x.sub.k], and Fix(G) = Fix(wH[w.sup.-1]) = wFix(G) is given by [x.sub.w(i)] = ... [x.sub.w(k)], which is a subspace in the k-equal arrangement.

With this proposition as motivation, we give the following definition for a k-parabolic arrangement.

Definition 2.3 Let W be an finite real reflection group of rank n. Let [P.sub.n,k] (W) be the collection of all irreducible parabolic subgroups of W of rank k-1.

Then the k-parabolic arrangement [W.sub.n,k] is the collection of subspaces

{Fix(G) : G [member of] [P.sub.n,k] (W)}.

The k-parabolic arrangements have many properties in common with the k-equal arrangements. Both of these arrangements can be embedded in the corresponding Coxeter arrangement. That is, every subspace in these arrangements can be given by intersections of hyperplanes of the Coxeter arrangements. Moreover, L([W.sub.n,k]) is a subposet of L(H(W)) = L([W.sub.n,2]), and these arrangements are invariant under the action of W. Indeed, consider a subspace X in[W.sub.n,k] and an element w [member of] W. Since X is in [W.sub.n,k], Gal(X) is an irreducble parabolic subgroup of rank k - 1. It is clear that Gal(wX) = wGal(X)[w.sup.-1], so Gal(wX) is also an irreducible parabolic subgroup of rank k - 1, whence Gal(wX) [member of] [P.sub.n,k](W). Since Fix(Gal(wX)) = wX, it follows that w X [member of] [W.sub.n,k].

When W is of type A, we see that we have recovered the k-equal arrangement. To see what happens when W is type B or D, first we recall type B and D analogues of the k-equal arrangement. In 1996, Bjorner and Sagan defined a class of subspace arrangements of type B and D [7], which they call the [B.sub.n,k,h]-arrangements and [D.sub.n,k]-arrangements.

Definition 2.4 The [D.sub.n,k] -arrangement consists of subspaces given by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], over distinct indices [i.sub.1],..., [i.sub.k]. The [B.sub.n,k,h]-arrangements are obtained from the [D.sub.n,k] - arrangements by including subspaces given by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] over distinct indices [i.sub.1],..., [i.sub.h], with h < k.

The Betti numbers of M ([B.sub.n,k,h] ) were computed by Bjorner and Sagan in [7], while the Betti numbers of M([D.sub.n,k]) were computed by Kozlov and Feichtner in [13].

Example 2.5 (When W is of type B) When W is of type B, the k-parabolic arrangement is the [B.sub.n,k,k-1]- arrangement of Bjorner and Sagan [7]. Recall that Bn has presentation given by generators [s.sub.i], 0 [less than or equal to] i [less than or equal to] n, such that < [s.sub.1],..., [s.sub.n] > generate the symmetric group, ([[s.sub.0][s.sub.1]).sup.4] = 1, and [[s.sub.0][s.sub.1] = [[s.sub.0][s.sub.1] for i > 1. It is well-known that the [B.sub.n,k,k_1]- arrangement is the orbit of two subspaces given by [x.sub.1] = ... = [x.sub.k] and [x.sub.1] = ... = [x.sub.k-1] = 0, under the action of [B.sub.n]. Clearly the Galois groups of these two spaces are given by < [s.sub.1],..., [s.sub.k-1] > and < [s.sub.0],..., [s.sub.k-2] >. These are both irreducible parabolic subgroups of rank k - 1, so every subspace of the [B.sub.n,k,k-1]-arrangement corresponds to an irreducible parabolic subgroup of rank k - 1. Similarly, given an irreducible parabolic subgroup of rank k - 1, it is not hard to show that this subgroup corresponds to a subspace in the [B.sub.n,k,k-1] -arrangement. The argument is similar to the case for type A, and we omit the details.

3 Discrete Homotopy Theory

To facilitate the proofs of our algebraic description for [pi].sub.1](M([W.sub.n,k])), first we give a combinatorial description of [[pi].sub.1](M([W.sub.n,k])) in terms of discrete homotopy theory of the Coxeter complex for W. As motivation, we mention the following result:

Theorem 3.1 Let M([A.sub.n-k]) be the complement of the k-equal arrangement [A.sub.n-k]. Let C([A.sub.n]) be the order complex of the Boolean lattice.

Then [[pi].sub.1] (M([A.sub.n,k]) [congruent to] [A.sup.n-k+1.sub.1](C([A.sub.n])), where [A.sup.q.sub.1] is a discrete homotopy group, to be defined below.

This result was shown independently by Bjorner [5] and Babson (appears in [3]) in 2001). It turns out that the order complex of the Boolean lattice is the Coxeter complex of type A, which explains our choice of notation.

One of the original motivations for discrete homotopy theory was to create a sequence of groups for studying social networks being modeled as simplicial complexes. However, as Theorem 3.1 shows, discrete homotopy theory has applications in other areas of mathematics. We will show that there is an isomorphism between [[pi].sub.1] (M([W.sub.n,k])) and the discrete fundamental group, [A.sup.n-k+1.sub.1], of the Coxeter complex, a combinatorial structure associated to the Coxeter arrangement. Essentially, we are replacing a topologically defined group with a combinatorially defined group. First, however, we give an overview of some of the needed basic definitions and results from discrete homotopy theory. Many details and background history of discrete homotopy theory can be found in [2].

Fix a positive integer d. Let [DELTA] be a simplicial complex of dimension d, fix 0 [less than or equal to] q [less than or equal to] d, and let [[sigma].sub.0] [member of] [DELTA] be maximal with dimension [greater than or equal to] q. Two simplicies [sigma] and [tau] are q-near if they share q +1 elements. A q-chain is a sequence [[sigma].sub.1],..., [[sigma].sub.k], such that [[sigma].sub.i], [[sigma].sub.i+1] are q-near for all i. A q-loop based at [[sigma].sub.0] is a q-chain with [[sigma].sub.1] = [[sigma].sub.k] = [[sigma].sub.0].

Definition 3.2 We define an equivalence relation, [??] on q-loops with the following conditions:

1. The q-loop

([sigma]) = ([sigma].sub.0], [sigma].sub.1],..., [sigma].sub.i], [sigma].sub.i+1],..., [sigma].sub.n], [sigma].sub.0])

is equivalent to the q-loop

([sigma])' = ([sigma].sub.0], [sigma].sub.1],..., [sigma].sub.i], [[sigma].sub.i][sigma].sub.i+1],..., [sigma].sub.n], [sigma].sub.0])

which we refer to as stretching.

[FIGURE 1 OMITTED]

2. If ([alpha]) and ([tau]) are two q-loops that have the same length then they are equivalent if there is a diagram as in figure 1. The vertices represent simplices, and two vertices are connected by an edge if and only if the corresponding simplices are q-near. Thus, every row is a q-loop based at [[sigma].sub.0], and every column is a q-chain. Such a diagram is called a (discrete) homotopy between ([sigma]) and ([tau]).

Define [A.sup.q.sub.1] ([DELTA], [[sigma].sub.0]) to be the collection of equivalence classes of q-loops based at [[sigma].sub.0]. Then the operation of concatenation of q-loops gives agroup operation on [A.sup.q.sub.1] ([DELTA], [[sigma].sub.0]), the discrete homotopy group of [DELTA]. The identity is the equivalence class containing the trivial loop ([[sigma].sub.0]), and given an equivalence class [[sigma]] for the q-loop ([sigma]) = ([[sigma].sub.0], [[sigma].sub.1],..., [[sigma].sub.k], [[sigma].sub.0]), the inverse [[[sigma]].sup.-1] is the equivalence class of ([[sigma].sub.0], [[sigma].sub.k], [[sigma].sub.k-1],..., [[sigma].sub.2], [[sigma].sub.1], [[sigma].sub.0]). As in classical topology, if a pair of maximal simplices [sigma], [tau] of dimension at least q in [DELTA] are q-connected, then [A.sup.q.sub.1] ([DELTA], [sigma]) = [congruent to] ([DELTA], [tau]). Thus, in the case [DELTA] is q-connected, we will set [A.sup.q.sub.1]([DELTA]) = [A.sup.q.sub.1] ([DELTA], [[sigma].sub.0]) for any maximal simplex [[sigma].sub.0] [member of] [DELTA] of dimension at least q.

Before we use discrete homotopy theory, we need a result from [2] that relates discrete homotopy theory of a simplicial complex to classical homotopy theory of a related space. Given 0 [less than or equal to] q [less than or equal to] d, let [[GAMMA].sup.q]([DELTA]) be a graph whose vertices are maximal simplices of [DELTA] of size at least q, and with edges between two simplices [sigma], [tau], if and only if [sigma] and [tau] are q-near. Then the following result relates [A.sup.q.sub.1 ([DELTA], [[sigma].sub.0]) in terms of a cell complex related to [[GAMMA].sup.q]([DELTA]).

Proposition 3.3 (Proposition 5.12 in [2])

[A.sup.q.sub.1 ([DELTA], [[sigma].sub.0]) [congruent to] [[pi].sub.1] ([X.sub.[GAMMA],[[sigma].sub.0])

where [X.sub.[GAMMA]] is a cell complex obtained by gluing a 2-cell on each 3- and 4-cycle of [GAMMA] = [[GAMMA].sup.q]([DELTA]).

Let W, H(W), [PHI], n, S be as in section 2. As mentioned previously, we study the discrete homotopy groups of the Coxeter complex associated to W, and relate them to [[pi].sub.1](M([W.sub.n,k])). The majority of these details can be found in Section 1.14 in Humphrey's book on Coxeter groups [15]. The concepts regarding fans and zonotopes can be found in Chapter 7 of Zeigler's book on polytopes [18].

For a given set I [subset or equal to] S, let [W.sub.I] =< I >, and [[PI].sub.I] = {[alpha] [member of] [PI] : [s.sub.[alpha]] [member of] I}. We can associate to [W.sub.I] the set of points [C.sub.I] = {x [member of] [R.sup.n] : (x, [alpha]) = 0, [for all][alpha] [member of] [[PI].sub.I], and (x, [alpha]) > 0, [for all][alpha][member of] [PI] - [[PI].sub.I]}. The set [C.sub.I] is the intersection of hyperplanes [H.sub.[alpha]] for [alpha] [member of] [[PI].sub.I] with certain open half-spaces. We see that [C.sub.[phi]] corresponds to the interior of a fundamental region, and [C.sub.S] is the origin.

For a given coset w[W.sub.I], we can associate the set of points w[C.sub.I]. The collection C(W) of w[C.sub.I] for all w [member of] W, and all I [[0subset].bar] S partitions [R.sup.n], and is called the Coxeter complex of W. The face poset of the Coxeter complex can be viewed as the collection of cosets w[W.sub.I] for any w [member of] W, I [subset or equal to] S, ordered by reverse inclusion. We note that this poset is not L(H(W)). For W = [A.sub.n], we have already mentioned that L(H(W)) is isomorphic to the partition lattice. The face poset of the braid arrangement, however, is isomorphic to the order complex of the boolean lattice. Since chains in the boolean lattice are in one-to-one correspondence with ordered set partitions, these two posets are related, but are very different.

[FIGURE 2 OMITTED]

For a given w, I, the closure of w[C.sub.I] is a convex polyhedral cone. In fact, the collection of all w[bar.C].sub.I] forms a fan of [R.sup.n], which is the fan associated to H(W). Under this view, the sets w[bar.C].sub.I] are the faces of the arrangement.

Recall that we can associate a zonotope to a hyperplane arrangement. That is, given line segments of unit length normal to the hyperplanes, one can form a polytope by taking the Minkowski sum of these line segments. For a Coxeter arrangement of type W this zonotope is called the W-Permutahedron. Also, the fan of the arrangement is the normal fan of the zonotope. Thus, we can label the faces of the W-Permutahedron by cosets w[W.sub.I], where a face F gets the label w[W.sub.I] if the normal cone for F is w[bar.C].sub.j]. Under this labeling, the face poset of the W-Permutahedron is indexed by cosets w[W.sub.I] for all w [member of] W, I [subset or equal to] S, ordered by inclusion.

We observe that in the W-Permutahedron, the vertices correspond to elements of W, and two vertices share an edge if and only if the corresponding regions share an (n - 1)-dimensional boundary, that is if and only if the corresponding elements of W differ by multiplication on the right by a simple reflection. From this it follows that the graph (one-skeleton) of the W-Permutahedron is the graph [[GAMMA].sup.n-2](C(W)) defined before Proposition 3.3.

We also characterize the cycles that are boundaries of 2-faces in the W-Permutahedron. Given a 2-dimensional face F and a vertex w in F, we see that one edge adjacent to w in F is of the form w, ws for some s [member of] S. Likewise, one of the two edges of F incident to the edge w, ws is the edge ws, wst, where t [member of] S - s. Thus we see that the coset associated to the normal cone of F contains both w[W.sub.s] and ws[W.sub.t]. Likewise, it is the smallest coset to contain these two cosets, so the corresponding coset is given by w[W.sub.{s,t}]. The cycle that is the boundary of F is seen to have length 2m(s, t). This means that the graph has no 3-cycles, and 4-cycles are boundaries of faces which correspond to a coset of [W.sub.{st}], where s, t [member of] S and m(s, t) = 2. The fact that the graph has no 3-cycles will turn out to be useful in section 4.

Now we turn to the main result of this section.

Theorem 3.4 Let M([W.sub.n,k]) be the complement of the k-parabolic arrangement [W.sub.n,k]. Then [[pi].sub.1](M([W.sub.n,k])) [congruent to] [A.sup.n-k+1.sub.1]C(W)).

The proof is given in the full version of the paper [4].

4 An algebraic description of [[phi].sub.1](M([W.sub.n,3]))

In this section, we give a description of [[phi].sub.1](M([W.sub.n,3])) that is similar to the idea of a pure Artin group. In our case, the group we consider is a (possibly infinite) Coxeter group. Recall that W affords the following presentation: W is generated by S subject to the relations:

1. [s.sup.2] = 1, [for all]s [member of] S

2. st = ts, [for all]s, t [member of] S such that m(s, t) = 2

3. sts = tst, [for all]s, t [member of] S, such that m(s, t) = 3

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

where of course we have no relation of the form st ... = ts .... if m(s,t) = [infinity].

If G is a group generated by S subject to every relation except relations of type 1, then G is an Artin group. There is a surjective homomorphism [phi] : G [right arrow] W given by [phi](s) = s for all s [member of] S. The kernel of [phi] is the pure Artin group. As stated in the introduction, the pure Artin group is isomorphic to the fundamental group of the complement of the complexification of the Coxeter arrangement for W. The goal of this section is to give a real analogue of this result for the [W.sub.n,3] -arrangements.

In our case, let W' be a group on S subject to only the relations of type 1 and 2. Equivalently, W' is subject to [s.sup.2] = 1 for all s [member of] S, and two elements s, t [member of] S commute in W' if and only if they commute in W. In essence, given the Dynkin diagram D for W, W' is obtained by replacing all the edge labels in D with the edge label [infinity], and letting W' be the resulting Coxeter group.

Consider the surjective homomorphism [phi]' : W' [right arrow] W given by [phi]'(s) = s for all s [member of] S. Then the following result holds:

[FIGURE 3 OMITTED]

Theorem 4.1 [[pi].sub.1] (M([W.sub.n,3] )) [congruent to] ker [phi]'.

When W is of type A or B, Theorem 4.1 was shown by Khovanov [16], where the arrangements are referred to using different terminology. However, we give a proof for any finite real reflection group.

As a result of Theorem 3.4, we know that we can study [[pi].sub.1](M (W.sub.n,k])) using discrete homotopy theory of C(W). Before we prove Theorem 4.1 we first investigate the structure of (n - 2)-loops in C(W) in more detail. For the duration of the section we will use the term loop to mean (n - 2)-loop. To any such loop ([sigma]) = ([[sigma].sub.0],..., [[sigma].sub.l] [[sigma].sub.0]) in C(W) we associate a sequence of elements of S [union] {1} of length I in the following way: For any i [member of] [l], if [[sigma].sub.i] = [[sigma].sub.i-1], let [s.sub.i] = 1. Otherwise let s4 be the unique element s of S for which [[sigma].sub.i-1]s = [[sigma].sub.i]. Thus we associate a word f ([sigma]) in [S.sup.*] to ([sigma]): the product of the elements of the corresponding sequence in order.

We note that if ([sigma]) is a loop, then f ([sigma]) = 1 in W. This implies that when viewing f ([sigma]) as a product in W', f ([sigma]) [member of] ker [phi]'. We also note that to any element w = [s.sub.1] ... [s.sub.k] in [S.sup.*] we can associate a chain g(w) = (<[[sigma].sub.0], [[sigma].sub.0] [[sigma].sub.1], ..., [[sigma].sub.0] [[sigma].sub.1] ... [s.sub.k]), where the elements [s.sub.1] ... [s.sub.4] are being viewed as elements of W. If w = 1 when viewed as an element of W, then g(w) is actually a loop. It is easy to see that for two loops ([sigma]), ([tau]), f (([sigma]) * ([tau])) = f (a[sigma])f (t[tau]), and if u, v [member of] [S.sup.*], u = v = 1 in W, then g(uv) = g(u) *

Suppose there is a homotopy between two loops ([sigma]) and ([tau]) of the same length. Since [[GAMMA].sup.n-2](C(W)) does not have any 3-cycles, it turns out that there is a (discrete) homotopy between them where adjacent rows in the grid follow one of the three following discrete homotopy operations. In each case, we also show how the associated words differ between the adjacent rows. Finally, e refers to the identity element of W.

(T1) Repeating simplices. A simplex a is repeated consecutively on the top row, and a different simplex [beta] is repeated consecutively on the bottom row. Note that this results in no change in the associated words.

[ILLUSTRATION OMITTED]

(T2) Inserting or removing a simplex. On one row there are three adjacent identical simplices a, and on the bottom row the middle simplex of this triple is replaced with a new simplex [beta] that is (n-2)-near [alpha]. Note that the corresponding words differ by an involution relation.

[ILLUSTRATION OMITTED]

(T3) Exchanging pairs that are (n - 2)-near. We happen to know that ([alpha], [beta], [tau], [gamma]) is a loop of distinct simplices. We construct a discrete homotopy as shown in the figure. We note that the resulting words differ by an application of a commutative relation. It is also worth noting this operation can only be performed when s, t commute.

[ILLUSTRATION OMITTED]

Thus for any discrete homotopy operation, the corresponding words are either equal, or differ by one of the generating relations of W'. In the full paper [4], we use this observation to prove the following lemma.

Lemma 4.2 1. Let ([sigma]), ([tau]) be loops. If ([sigma]) [equivalent] ([tau]) then f ([sigma]) = f ([tau]) in W'.

2. Let w [member of] [S.sup.*]. If w = 1 in W', then g(w) is contractible.

3. Let w, v [member of] S*. If w = v in W then g(w) [equivalent] g(v).

Proof of Theorem 4.1:

The isomorphism is given by sending the equivalence class with representative ([sigma]) to f ([sigma]), and the inverse is given by sending an element w [member of] W', expressed as [s.sub.1][s.sub.2] ... [s.sub.k], k [member of] N, [s.sub.1],..., [s.sub.k] [member of] S, to g([s.sub.1] ... [s.sub.k]). The details that these functions are well-defined isomorphisms is given in the full paper [4].

5 Conclusion and Open Problems

It follows as a result of Corollary 5 in [8] that for k > 3, the k-parabolic arrangements are not K([pi], 1). However, the [W.sub.n,3] -arrangement is a K([tau], 1)-arrangement. As a result of Davis, Januszkiewicz and Scott, if A is any collection of codimension 2 subspaces of H (W) that are invariant under the action of W , then A is a K([pi], 1)-arrangement (Theorem 0.1.9 in [10]).

Currently there is no presentation for the fundamental groups of the complement of such W-invariant arrangements. Motivated by our results, and the work of Khovanov [16], we give the following conjectured presentation.

Conjecture 5.1 Let P be a collection of rank 2 parabolic subgroups of a finite real reflection group W such that P is closed under conjugation, and let W = {Fix(G) : G [member of] P} Define a new Coxeter group W' with the same generating set S as W, and subject to:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

In [2], a definition is given for higher discrete homotopy groups, which are denote [A.sup.q.sub.m]([DELTA], [[sigma].sub.0]). A natural question is whether or not these groups are related to the higher homotopy groups of M(W.sub.n,k]).

Conjecture 5.2 Let M([W.sub.n,k]) be the complement of the k-parabolic arrangement [W.sub.n,k].

Then [[pi].sub.m](M([W.sub.n,k])) [congruent to] [A.sup.n-k+1.sub.m]C(W)).

For m < k, it would suffice to show that [A.sup.n-k+1.sub.m]C(W)) is trivial. The conjecture becomes interesting for k > 3, m = k, because in this case the k-th homology group of M([W.sub.n,k]) is isomorphic to the k-th homotopy group. Thus, one could find the formulas for the first non-zero Betti numbers using discrete homotopy theory. Determining the Betti numbers for the k-parabolic arrangements is also an open problem, in the case that W is an exceptional groups.

Finally, one may if it is possible to generalize Theorem 3.4 to other hyperplane arrangements. That is, given a hyperplane arrangement H, let C(H) be the face complex of H. Is there a subspace arrangement A for which [[pi].sub.1](M(A)) [congruent to] [A.sup.n-2.sub.1](C(H))? This would be an example of using discrete homotopy theory of a complex that arises from geometry to study a topological space related to the original complex.

References

[1] Helene Barcelo and Edwin Ihrig, Lattices of parabolic subgroups in connection with hyperplane arrangements, J. Algebraic Combin. 9 (1999), no. 1, 5-24. MR MR1676736 (2000g:52023)

[2] Helene Barcelo, Xenia Kramer, Reinhard Laubenbacher, and Christopher Weaver, Foundations of a connectivity theory for simplicial complexes, Adv. in Appl. Math. 26 (2001), no. 2, 97-128. MR MR1808443 (2001k:57029)

[3] Helene Barcelo and Reinhard Laubenbacher, Perspectives on A-homotopy theory and its applications, Discrete Math. 298 (2005), no. 1-3, 39-61. MR MR2163440 (2006f:52017)

[4] Helene Barcelo, Christopher Severs, and Jacob White, k-parabolic subspace arrangements, 2009.

[5] Anders Bjorner, Personal communication, 1999.

[6] Anders Bjorner and Laszlo Lovasz, Linear decision trees, subspace arrangements and Mobius functions, J. Amer. Math. Soc. 7 (1994), no. 3, 677-706. MR MR1243770 (95e:52024)

[7] Anders Bjorner and Bruce E. Sagan, Subspace arrangements of type Bn and Dn, J. Algebraic Combin. 5 (1996), no. 4, 291-314. MR MR1406454 (97g:52028)

[8] Anders Bjorner and Volkmar Welker, The homology of "k-equal" manifolds and related partition lattices, Adv. Math. 110 (1995), no. 2, 277-313. MR MR1317619 (95m:52029)

[9] E. Brieskorn, Die Fundamentalgruppe des Raumes der regularen Orbits einer endlichen komplexen Spiegelungsgruppe, Invent. Math. 12 (1971), 57-61. MR MR0293615 (45 #2692)

[10] M. Davis, T. Januszkiewicz, and R. Scott, Nonpositive curvature of blow-ups, Selecta Math. (N.S.) 4 (1998), no. 4, 491-547. MR MR1668119 (2001f:53078)

[11] Pierre Deligne, Les immeubles des groupes de tresses generalises, Invent. Math. 17 (1972), 273-302. MR MR0422673 (54 #10659)

[12] Edward Fadell and Lee Neuwirth, Configuration spaces, Math. Scand. 10 (1962), 111-118. MR MR0141126 (25 #4537)

[13] Eva Maria Feichtner and Dmitry N. Kozlov, On subspace arrangements of type D, Discrete Math. 210 (2000), no. 1-3, 27-54, Formal power series and algebraic combinatorics (Minneapolis, MN, 1996). MR MR1731606 (2001k:52039)

[14] R. Fox and L. Neuwirth, The braid groups, Math. Scand. 10 (1962), 119-126. MR MR0150755 (27 #742)

[15] James E. Humphreys, Reflection groups and Coxeter groups, Cambridge Studies in Advanced Mathematics, vol. 29, Cambridge University Press, Cambridge, 1990. MR MR1066460 (92h:20002)

[16] Mikhail Khovanov, Real K (n, 1) arrangements from finite root systems, Math. Res. Lett. 3 (1996), no. 2, 261-274. MR MR1386845 (97d:52023)

[17] Peter Orlik and Hiroaki Terao, Arrangements of hyperplanes, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 300, Springer-Verlag, Berlin, 1992. MR MR1217488 (94e:52014)

[18] Gunter M. Ziegler, Lectures onpolytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York, 1995. MR MR1311028 (96a:52011)

Christopher Severs and Jacob White

School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ 85287-1804