Home Mathematics The excess zero graph of a Coxeter group
Article Publicly Available

The excess zero graph of a Coxeter group

  • EMAIL logo , and ORCID logo
Published/Copyright: August 15, 2025

Abstract

For a Coxeter group π‘Š with length function β„“, the excess zero graph E 0 ⁒ ( W ) has vertex set the non-identity involutions of π‘Š, with two involutions π‘₯ and 𝑦 adjacent whenever β„“ ⁒ ( x ⁒ y ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) . Properties of this graph such as connectivity, diameter and valencies of certain vertices of E 0 ⁒ ( W ) are explored.

1 Introduction

The study of Coxeter groups goes hand in hand with the study of their length functions. Indeed, a group generated by involutions with an associated length function is a Coxeter group precisely when it satisfies the Exchange Condition (see Lemma 2.3). Many results about Coxeter groups involve the interplay between the group multiplication and the length function. In this paper, we study an aspect of this interplay in the case of involutions.

Let π‘Š be a Coxeter group with 𝑅 its set of fundamental (or simple) reflections, and let w ∈ W . The length functionβ„“ on π‘Š is defined by β„“ ⁒ ( w ) = 0 if w = 1 , and for w β‰  1 ,

β„“ ⁒ ( w ) = min ⁑ { k ∈ N ∣ w = r 1 ⁒ r 2 ⁒ β‹― ⁒ r k , where ⁒ r i ∈ R } .

The nature of the relationship between

β„“ ⁒ ( w 1 ⁒ w 2 ) and β„“ ⁒ ( w 1 ) + β„“ ⁒ ( w 2 ) , where ⁒ w 1 , w 2 ∈ W ,

arises in many situations. Generally, it is not the case that

β„“ ⁒ ( w 1 ⁒ w 2 ) = β„“ ⁒ ( w 1 ) + β„“ ⁒ ( w 2 ) ,

though there are a number of instances where this does occur. For example, if W J is a standard parabolic subgroup, then there is a set X J referred to as the set of distinguished right coset representatives of W J in π‘Š for which β„“ ⁒ ( w ⁒ x ) = β„“ ⁒ ( w ) + β„“ ⁒ ( x ) for all w ∈ W J , x ∈ X J (see Lemma 2.4).

The involutions in a group are often important in highlighting certain properties of the group. This is especially true for Coxeter groups, particularly because of the fundamental reflections. For a Coxeter group π‘Š, put

W = { w ∈ W ∣ x , y ∈ W , w = x ⁒ y , x 2 = 1 = y 2 } .

By [2], if π‘Š is a finite Coxeter group, then W = W , but in general, 𝒲 may be a proper subset of π‘Š. For w ∈ W , the excess of 𝑀, denoted e ⁒ ( w ) , was introduced in [5] and is defined by

e ⁒ ( w ) = min ⁑ { β„“ ⁒ ( x ) + β„“ ⁒ ( y ) βˆ’ β„“ ⁒ ( w ) ∣ x , y ∈ W , w = x ⁒ y , x 2 = y 2 = 1 } .

Evidently, e ⁒ ( w ) = 0 if and only if there exist x , y ∈ W with w = x ⁒ y such that x 2 = y 2 = 1 and β„“ ⁒ ( w ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) . Note that, as π‘₯ or 𝑦 could be the identity, e ⁒ ( w ) = 0 for all involutions in π‘Š.

In a series of papers [5, 7, 8, 9], properties of excess are explored. In [5], it is shown that, for any finite rank Coxeter group π‘Š and w ∈ W , there exists w βˆ— ∈ W which is π‘Š-conjugate to 𝑀 and has e ⁒ ( w βˆ— ) = 0 . In a similar vein, in [7], it is proved that, for finite Coxeter groups, such a w βˆ— may be found with the property that it has minimal length in its π‘Š-conjugacy class. An analogous result for maximal length in π‘Š-conjugacy classes is obtained in [9]. These investigations into elements of π‘Š with zero excess have to some extent pushed involutions into the background. In this paper, we put the spotlight on involutions and their impact on zero excess.

Definition 1.1

Let π‘Š be a Coxeter group with length function β„“ and set of non-identity involutions I ⁒ ( W ) . The excess zero graph E 0 ⁒ ( W ) has vertex set I ⁒ ( W ) with x , y ∈ I ⁒ ( W ) adjacent whenever β„“ ⁒ ( x ⁒ y ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) .

The definition of this graph first arose in the study of prefixes in Coxeter groups; see [6]. For w ∈ W , we say that u ∈ I ⁒ ( W ) is an involution prefix of 𝑀 if there exists v ∈ W such that w = u ⁒ v with β„“ ⁒ ( w ) = β„“ ⁒ ( u ) + β„“ ⁒ ( v ) . An element 𝑀 has the ancestor property if the set of all involution prefixes for 𝑀 contains a unique involution of maximal length. It is conjectured in [6] that the ancestor property holds for all non-identity elements in finite Coxeter group. A result of this conjecture would be a canonical way to write each non-identity element 𝑀 of π‘Š as w = x 1 ⁒ x 2 ⁒ β‹― ⁒ x k with x i ∈ I ⁒ ( W ) and β„“ ⁒ ( w ) = β„“ ⁒ ( x 1 ) + β‹― + β„“ ⁒ ( x k ) . In the language of the excess zero graph, this means that x 1 , x 2 , … , x k is a path in E 0 ⁒ ( W ) . It was this observation that first motivated the study of the excess zero graph as a potential tool for proving the ancestor conjecture.

We briefly justify our choice of vertex set. In its current form, the excess zero graph has no loops. If the identity element were included in the vertex set, then it would be adjacent to all other vertices, including itself. In addition to the observation above on ancestors, by considering only involutions as vertices, the excess zero graph is undirected.

As an indicative example, in Table 1, we take a glance at E 0 ⁒ ( W ) when

W = W ⁒ ( A n ) and n ∈ { 3 , 4 , 5 , 6 } .

The entries of the table were calculated with the aid of Magma [1]. By i k , we mean that there are π‘˜ involutions in E 0 ⁒ ( W ) which have valency 𝑖.

Table 1

Valency distribution for small groups of type A n

Group Valency distribution
W ⁒ ( A 3 ) 0 1 ⁒ .1 3 ⁒ .2 1 ⁒ .3 1 ⁒ .4 3
W ⁒ ( A 4 ) 0 1 ⁒ .1 4 ⁒ .2 2 ⁒ .3 6 ⁒ .4 3 ⁒ .6 3 ⁒ .7 2 ⁒ .12 4
W ⁒ ( A 5 ) 0 1 ⁒ .1 5 ⁒ .2 3 ⁒ .3 13 ⁒ .4 7 ⁒ .5 2 ⁒ .7 15 ⁒ .8 1 ⁒ .9 8 ⁒ .10 1 ⁒ .13 4 ⁒ .15 1 ⁒ .19 9 ⁒ .37 5
W ⁒ ( A 6 ) 0 1 ⁒ .1 6 ⁒ .2 4 ⁒ .3 23 ⁒ .4 9 ⁒ .5 6 ⁒ .6 9 ⁒ .7 22 ⁒ .8 4 ⁒ .9 27 ⁒ .10 4 ⁒ .11 10 ⁒ .12 7 ⁒ .13 8 ⁒ .14 2 ⁒ .15 10 ⁒ .16 3 .
19 12 ⁒ .21 4 ⁒ .22 12 ⁒ .24 2 ⁒ .25 5 ⁒ .27 8 ⁒ .29 2 ⁒ .31 4 ⁒ .39 2 ⁒ .41 5 ⁒ .55 4 ⁒ .59 10 ⁒ 115 6

At first sight, the data in Table 1 looks to be very haphazard, but this is not totally unexpected. Of course, π‘Š acts upon I ⁒ ( W ) by conjugation, but conjugation severely damages the excess zero property. As a result, π‘Š does not induce graph automorphisms on E 0 ⁒ ( W ) . We do however observe some structure. For example, for n = 3 , 4 , 5 , 6 , compare the final term of the valency distribution in W ⁒ ( A n ) (respectively, 4, 12, 37 and 115) with | I ⁒ ( W ⁒ ( A n ) ) | , which is, respectively, 9, 25, 75 and 231. This is part of a general pattern between the highest valency and the number of vertices of this graph which we see in Corollary 1.4. The one isolated vertex of E 0 ⁒ ( W ) in Table 1 (indicated by 0 1 ) is w 0 , the longest element of π‘Š (and only defined when π‘Š is finite).

The main topics to be explored in this paper are the possible diameters of E 0 ⁒ ( W ) and the distribution of the valencies of its vertices. We outline our results below, beginning with a theorem concerned with the first of these topics.

Theorem 1.2

Let π‘Š be a Coxeter group of rank at least 2.

  1. If π‘Š is finite, then E 0 ⁒ ( W ) has two connected components: I ⁒ ( W ) βˆ– { w 0 } and { w 0 } . If π‘Š is infinite, then E 0 ⁒ ( W ) is connected.

  2. Let E Μ‚ 0 ⁒ ( W ) be the connected component of E 0 ⁒ ( W ) not containing w 0 . Then the diameter of E Μ‚ 0 ⁒ ( W ) is at most 3.

The requirement of rank being at least 2 is to omit W = A 1 , since in this case I ⁒ ( W ) = { w 0 } and so E Μ‚ 0 ⁒ ( W ) is the empty graph, whose diameter is undefined.

We now consider the valencies of vertices. For x ∈ I ⁒ ( W ) , let Ξ” 1 ⁒ ( x ) be the set of vertices adjacent to π‘₯ in E 0 ⁒ ( W ) . Hence the valency of π‘₯ is the cardinality of Ξ” 1 ⁒ ( x ) . We have the following result for finite rank Coxeter groups.

Theorem 1.3

Suppose that π‘Š is a Coxeter group of finite rank and let π‘Ÿ be a fundamental reflection of π‘Š. Then the sets Ξ” 1 ⁒ ( r ) and I ⁒ ( W ) βˆ– ( { r } βˆͺ Ξ” 1 ⁒ ( r ) ) have the same cardinality.

A corollary of Theorem 1.3, hinted at in Table 1, is as follows.

Corollary 1.4

For a finite Coxeter group π‘Š and π‘Ÿ a fundamental reflection,

| Ξ” 1 ⁒ ( r ) | = | I ⁒ ( W ) | βˆ’ 1 2 .

Moreover, for x ∈ I ⁒ ( W ) βˆ– R ,

| Ξ” 1 ⁒ ( x ) | < | I ⁒ ( W ) | βˆ’ 1 2 .

Corollary 1.4 is only the tip of the iceberg for finite irreducible Coxeter groups π‘Š, as we see with our next theorem. For positive integers π‘š and 𝑛, and

x ∈ I ⁒ ( W ⁒ ( A n βˆ’ 1 ) ) = I ⁒ ( Sym ⁒ ( n ) )

a product of π‘š distinct mutually commuting fundamental reflections, write Ξ΄ ⁒ ( m , n ) for | Ξ” 1 ⁒ ( x ) | . We shall prove that this is well-defined in Lemma 4.5. Even though 1 βˆ‰ I ⁒ ( W ) , it is useful to define Ξ΄ ⁒ ( 0 , n ) = | I ⁒ ( Sym ⁒ ( n ) ) | ; we also set Ξ΄ ⁒ ( m , 0 ) = 0 .

Theorem 1.5

Let m β‰₯ 2 and n β‰₯ 2 ⁒ m . Then

Ξ΄ ⁒ ( m , n ) = 1 2 ⁒ ( Ξ΄ ⁒ ( m βˆ’ 1 , n ) + ( m βˆ’ 1 ) ⁒ Ξ΄ ⁒ ( m βˆ’ 2 , n βˆ’ 4 ) + m βˆ’ 2 ) .

At the opposite end of the spectrum to Corollary 1.4, we have those w ∈ W for which | Ξ” 1 ⁒ ( w ) | = 1 . We call such 𝑀pendant elements. Let P ⁒ ( W ) denote the set of pendant elements of π‘Š. Our next theorem classifies the pendant elements of finite irreducible Coxeter groups. For the notation employed in this theorem and the labelling of the relevant Dynkin diagrams, see Section 2.

Theorem 1.6

Let π‘Š be a finite irreducible Coxeter group of rank n β‰₯ 2 with R = { r 1 , r 2 , … , r n } .

  1. Suppose w 0 ∈ Z ⁒ ( W ) . (This occurs if and only if π‘Š is of type B n , type D n with 𝑛 even, type F 4 , H 3 , H 4 , E 7 or E 8 , or type I 2 ⁒ ( m ) with π‘š even.) Then P ⁒ ( W ) = { w 0 ⁒ r ∣ r ∈ R } .

  2. If π‘Š is of type A n and n β‰₯ 2 , setting J = { 1 , 2 , … , ⌈ n 2 βŒ‰ } , we have

    P ⁒ ( W ) = { w 0 ⁒ [ i β†— ( n + 1 βˆ’ i ) ] , w 0 ⁒ [ ( n + 1 βˆ’ i ) β†˜ i ] ∣ i ∈ J } .

  3. If π‘Š is of type D n , where 𝑛 is odd, then

    P ⁒ ( W ) = { w 0 ⁒ r i , w 0 ⁒ r n ⁒ r n βˆ’ 2 ⁒ r n βˆ’ 1 , w 0 ⁒ r n βˆ’ 1 ⁒ r n βˆ’ 2 ⁒ r n ∣ i ∈ { 1 , … , n βˆ’ 2 } } .

  4. If π‘Š is of type E 6 , then

    P ⁒ ( W ) = { w 0 ⁒ r 2 , w 0 ⁒ r 4 , w 0 ⁒ r 5 ⁒ r 4 ⁒ r 3 , w 0 ⁒ r 3 ⁒ r 4 ⁒ r 5 , w 0 ⁒ r 6 ⁒ r 5 ⁒ r 4 ⁒ r 3 ⁒ r 1 , w 0 ⁒ r 1 ⁒ r 3 ⁒ r 4 ⁒ r 5 ⁒ r 6 } .

  5. If π‘Š is of type I 2 ⁒ ( m ) , with π‘š odd and m β‰₯ 5 , then

    P ⁒ ( W ) = { w 0 ⁒ r 1 ⁒ r 2 , w 0 ⁒ r 2 ⁒ r 1 } .

Corollary 1.7

If π‘Š is a finite irreducible Coxeter group of rank 𝑛, then

| P ⁒ ( W ) | = n .

Observe that the pendant elements in Theorem 1.6 have the form w 0 ⁒ x , where x w 0 = x βˆ’ 1 . These elements are examples of twisted involutions. In general, for w ↦ w βˆ— a self-inverse automorphism on π‘Š preserving 𝑅, we can form a twisted Coxeter system ( W , R , βˆ— ) with a set of twisted involutions

I βˆ— = { w ∈ W ∣ w βˆ— = w βˆ’ 1 } .

These twisted systems have many interesting properties; see e.g. [4, 10, 12].

We end this section with an overview of this paper. Section 2 sets up notation for the paper, and also reviews some well-known results that we will employ. Not surprisingly, these results focus on properties of the length function.

Section 3 looks at the connectedness of E 0 ⁒ ( W ) , first proving Theorem 1.2, and then determining the various possible diameters of E Μ‚ 0 ⁒ ( W ) . For example, in Theorem 3.4, we see that the diameter is 3 in the case when either π‘Š is a compact hyperbolic Coxeter group or an affine Coxeter group (other than W ⁒ ( A Μƒ 1 ) ), while Lemmas 3.5 and 3.6 examine some classes of infinite Coxeter groups which have diameter 2.

Valencies of particular elements of a Coxeter group are the subject of Section 4. The proof of Theorem 1.3 is relatively quick, in contrast to the proof of Theorem 1.5, which determines | Ξ” 1 ⁒ ( x ) | , where π‘₯ is a product of commuting fundamental reflections, and π‘Š is a Coxeter group of type A n . First, in Lemma 4.5, we show that (perhaps surprisingly) two conjugate involutions of Sym ⁒ ( n ) which have minimal length in their conjugacy class also have the same valency. Then the recursive formula displayed in Theorem 1.5 is established.

Pendant elements in finite irreducible Coxeter groups π‘Š are classified in Section 5, when the proofs of Theorem 1.6 and Corollary 1.7 are given. The pendant elements are quickly located when w 0 ∈ Z ⁒ ( W ) (see Lemma 5.3). The case of w 0 βˆ‰ Z ⁒ ( W ) requires a more involved analysis. Lemma 5.6 settles the case when π‘Š is of type A n , while Section 5.2 is devoted to dealing with π‘Š of type D n with 𝑛 odd.

Our last section gives the valency distribution for four of the small exceptional finite Coxeter groups.

2 Background material

Here we take a quick trip through some basic material and notation relating to Coxeter groups which will be needed later. A good general reference for these and other results is [11]. Recall that π‘Š being a Coxeter group of finite rank 𝑛 means that it has a finite set R = { r 1 , … , r n } of fundamental (or simple) reflections such that

W = ⟨ R ∣ ( r i ⁒ r j ) m i ⁒ j = 1 ⁒ for all ⁒ r i , r j ∈ R ⟩

is a presentation for π‘Š with m i ⁒ i = 1 and m i ⁒ j β‰₯ 2 for i β‰  j . As noted in Section 1, we have the length function β„“. There is an alternative description of β„“ ⁒ ( w ) which we now review. Letting 𝑉 be a vector space over ℝ with basis

Π = { α r ∣ r ∈ R } ,

we define the following bilinear form on 𝑉:

⟨ Ξ± r , Ξ± s ⟩ = { βˆ’ cos ⁒ ( Ο€ / m r ⁒ s ) if ⁒ m r ⁒ s < ∞ , βˆ’ 1 if ⁒ m r ⁒ s = ∞ .

We can now define a faithful action of π‘Š on 𝑉 which preserves the bilinear form. For r ∈ R and v ∈ V , let

r β‹… v = v βˆ’ 2 ⁒ ⟨ v , Ξ± r ⟩ ⁒ Ξ± r .

The root system of π‘Š is Ξ¦ = { w β‹… Ξ± r ∣ w ∈ W , r ∈ R } . The positive roots are

Ξ¦ + = { βˆ‘ r ∈ R Ξ» r ⁒ Ξ± r ∈ Ξ¦ | Ξ» r β‰₯ 0 ⁒ for all ⁒ r ∈ R } ,

and the negative roots are Ξ¦ βˆ’ = βˆ’ Ξ¦ + . Thus Ξ¦ = Ξ¦ + βˆͺ Μ‡ Ξ¦ βˆ’ . We define some important subsets of Ξ¦ + . For w ∈ W , let

N ⁒ ( w ) = { Ξ± ∈ Ξ¦ + ∣ w β‹… Ξ± ∈ Ξ¦ βˆ’ } ,

and so | N ⁒ ( w ) | is the number of positive roots taken negative by 𝑀. A key result on the length function in a Coxeter group is our first lemma.

Lemma 2.1

Lemma 2.1 ([11, Β§5.2])

For w ∈ W and r ∈ R , either

β„“ ⁒ ( w ⁒ r ) = β„“ ⁒ ( w ) βˆ’ 1 or β„“ ⁒ ( w ⁒ r ) = β„“ ⁒ ( w ) + 1 .

The close relationship between β„“ ⁒ ( w ) and N ⁒ ( w ) is apparent in the next result.

Lemma 2.2

Suppose that π‘Š is a Coxeter group with x , y ∈ W . Then the following hold:

  1. β„“ ⁒ ( x ) = | N ⁒ ( x ) | ,

  2. N ⁒ ( x ⁒ y ) = [ N ⁒ ( y ) βˆ– ( βˆ’ y βˆ’ 1 ⁒ N ⁒ ( x ) ) ] βˆͺ Μ‡ y βˆ’ 1 ⁒ ( N ⁒ ( x ) βˆ– N ⁒ ( y βˆ’ 1 ) ) ,

  3. β„“ ⁒ ( x ⁒ y ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) βˆ’ 2 ⁒ | N ⁒ ( x ) ∩ N ⁒ ( y βˆ’ 1 ) | .

Proof

For (i) and (ii), see [11, §5.6 Proposition (b)] and [5, Lemma 2.2] respectively. Part (iii) follows from (ii). ∎

Next we have the so-called Exchange Condition. Recall that an expression for 𝑀 of the form w = r 1 ⁒ r 2 ⁒ β‹― ⁒ r k with r i ∈ R is called reduced if k = β„“ ⁒ ( w ) .

Lemma 2.3

Lemma 2.3 ([11, Β§5.8])

Let w = r 1 ⁒ β‹― ⁒ r k (not necessarily reduced), where each r i is a simple reflection. If β„“ ⁒ ( w ⁒ r ) < β„“ ⁒ ( w ) for some simple reflection π‘Ÿ, then there exists an index 𝑖 for which w ⁒ r = r 1 ⁒ β‹― ⁒ r Μ‚ i ⁒ β‹― ⁒ r k (and thus w = r 1 ⁒ β‹― ⁒ r Μ‚ i ⁒ β‹― ⁒ r k ⁒ r , with a factor π‘Ÿ exchanged for a factor r i ). In particular, 𝑀 has a reduced expression ending in π‘Ÿ if and only if β„“ ⁒ ( w ⁒ r ) < β„“ ⁒ ( w ) .

As a consequence of the above, when π‘Š is finite, w 0 has a reduced expression ending in π‘Ÿ for all r ∈ R .

For J βŠ† R , we define the corresponding standard parabolic subgroup to be W J = ⟨ J ⟩ . Then W J is a Coxeter group with root system

Ξ¦ J = { w β‹… Ξ± r ∣ r ∈ J , w ∈ W J } .

Suppose J βŠ† K βŠ† R . Adapting the notation from [3, Β§2.1], we define the following sets:

X J K = { w ∈ W K ∣ β„“ ⁒ ( s ⁒ w ) > β„“ ⁒ ( w ) ⁒ for all ⁒ s ∈ J } , X J K = { w ∈ W K ∣ β„“ ⁒ ( w ⁒ s ) > β„“ ⁒ ( w ) ⁒ for all ⁒ s ∈ J } .

We write X J for X J R and X J for X J R . Our next result was alluded to in Section 1.

Lemma 2.4

Lemma 2.4 ([3, Propostion 2.1.1])

Suppose that π‘Š is a Coxeter group and J βŠ† R . Then the following hold.

  1. For each w ∈ W , there is a unique pair y ∈ W J and x ∈ X J such that w = y ⁒ x . Furthermore, β„“ ⁒ ( y ⁒ x ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) . In particular, X J is a complete set of right coset representatives of W J in π‘Š.

  2. The set { x βˆ’ 1 ∣ x ∈ X J } is equal to X J , and X J is a complete set of left coset representatives of W J in π‘Š.

We call X J the set of distinguished right coset representatives, and X J the set of distinguished left coset representatives, of W J in π‘Š.

When investigating finite Coxeter groups of types A n , D n and E 6 in Section 5, we assume their Dynkin diagrams are labelled as in Figure 1.

Figure 1 
               Labelling of Dynkin diagrams
Figure 1

Labelling of Dynkin diagrams

Sometimes, we shall write [ i 1 , i 2 , … , i j βˆ’ 1 , i j ] to stand for the product

r i 1 ⁒ r i 2 ⁒ β‹― ⁒ r i j βˆ’ 1 ⁒ r i j ,

where r i 1 , ⁒ r i 2 , … , r i j βˆ’ 1 , r i j ∈ R . In some circumstances, we compress this notation yet further: when i ≀ j , we let

[ i β†— j ] = r i ⁒ r i + 1 ⁒ β‹― ⁒ r j βˆ’ 1 ⁒ r j and [ j β†˜ i ] = r j ⁒ r j βˆ’ 1 ⁒ β‹― ⁒ r i + 1 ⁒ r i .

Our next theorem is used when pinning down the pendant elements in Coxeter groups of type D n . We use the labelling convention as in Figure 1.

Theorem 2.5

Suppose that π‘Š is a Coxeter group of type D n . Let J : = R βˆ– { [ n ] } and let x ∈ X J be a non-identity element. Then π‘₯ has a reduced expression x = a ⁒ b , where either

  1. a ∈ { [ n ] , [ n , n βˆ’ 2 , n βˆ’ 1 ] } and b ∈ W { 1 , … , n βˆ’ 2 } ; or

  2. a = [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 1 , n βˆ’ 2 , n ] .

Proof

We argue by induction on 𝑛, starting with n = 4 . Employing [3, Algorithm B, Β§2.1] gives

X J = { 1 , [ 4 ] , [ 4 , 2 ] , [ 4 , 2 , 1 ] , [ 4 , 2 , 3 ] , [ 4 , 2 , 1 , 3 ] , [ 4 , 2 , 1 , 3 , 2 ] , [ 4 , 2 , 1 , 3 , 2 , 4 ] } .

Bearing in mind that [ 1 ] and [ 3 ] commute, we see that either alternative (i) holds or x = [ 4 , 2 , 1 , 3 , 2 , 4 ] , which gives (ii). Now assume that n β‰₯ 5 . Set K = R βˆ– { [ 1 ] } and L = R βˆ– { [ 1 ] , [ n βˆ’ 1 ] } . Then W K is of type D n βˆ’ 1 , with W L a standard parabolic subgroup of W K of type A n βˆ’ 2 . Let x ∈ X J .

Appealing to the Mackey decomposition [3, Lemma 2.1.9],

X J = ⋃ d ∈ X J ∩ ( X K ) βˆ’ 1 d ⁒ X J d ∩ K K .

Again using [3, Algorithm B, Β§2.1]

X K = { 1 , [ 1 ] , [ 1 β†— 2 ] , … , [ 1 β†— n ] , [ 1 β†— n βˆ’ 2 , n ] , [ 1 β†— n , n βˆ’ 2 ] , … , [ 1 β†— n , n βˆ’ 2 β†˜ 1 ] }

and hence

X J ∩ ( X K ) βˆ’ 1 = { d 1 = 1 , d 2 = [ n , n βˆ’ 2 β†˜ 1 ] } .

Then we see that J d 2 ∩ K = L and hence

X J = X J ∩ K K βˆͺ d 2 ⁒ X L K .

If x ∈ X J ∩ K K , then, as W K is of type D n βˆ’ 1 (with [ n βˆ’ 1 ] , [ n ] in X J ∩ K K ), induction yields that either (i) or (ii) hold. Now suppose that x ∈ d 2 ⁒ X L K . Therefore, x = d 2 ⁒ e for some e ∈ X L K . Again applying induction, this time to X L K , we deduce that we have a reduced expression e = a ⁒ b , where either a ∈ { [ n βˆ’ 1 ] , [ n βˆ’ 1 , n βˆ’ 2 , n ] } with 𝑏 having neither appearances of [ n βˆ’ 1 ] nor [ n ] , or

a = [ n βˆ’ 1 , n βˆ’ 2 , n , n βˆ’ 3 , n βˆ’ 2 , n βˆ’ 1 ] .

Assume the first possibility holds, so a ∈ { [ n βˆ’ 1 ] , [ n βˆ’ 1 , n βˆ’ 2 , n ] } . If a = [ n βˆ’ 1 ] , then

x = [ n , n βˆ’ 2 β†˜ 1 , n βˆ’ 1 ] b = [ n , n βˆ’ 2 , n βˆ’ 1 ] [ n βˆ’ 3 β†˜ 1 ] b ,

which is of the desired form. Meanwhile, if a = [ n βˆ’ 1 , n βˆ’ 2 , n ] , then

x = [ n , n βˆ’ 2 β†˜ 1 , n βˆ’ 1 , n βˆ’ 2 , n ] b = [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 1 , n βˆ’ 2 , n ] ⁒ [ n βˆ’ 4 β†˜ 1 ] ⁒ b ,

which is alternative (ii). In the remaining case, we have

x = [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 4 β†˜ 1 , n βˆ’ 1 , n βˆ’ 2 , n , n βˆ’ 3 , n βˆ’ 2 , n βˆ’ 1 ] b = [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 1 , n βˆ’ 2 , n ] ⁒ [ n βˆ’ 4 β†˜ 1 , n βˆ’ 3 , n βˆ’ 2 , n βˆ’ 1 ] ⁒ b ,

again yielding alternative (ii), and this completes the proof of the theorem. ∎

3 Diameter of E Μ‚ 0 ⁒ ( W )

Recall that π‘Š is a Coxeter group with set of fundamental reflections 𝑅, and non-identity involution set I ⁒ ( W ) . The subgraph E Μ‚ 0 ⁒ ( W ) of the excess graph E 0 ⁒ ( W ) is defined by taking the connected component which does not contain w 0 . We use Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) to denote the diameter of E Μ‚ 0 ⁒ ( W ) .

Lemma 3.1

Let x ∈ I ⁒ ( W ) . Either π‘₯ is adjacent in E 0 ⁒ ( W ) to some r ∈ R , or π‘Š is finite and x = w 0 .

Proof

Assume, for a contradiction, that π‘₯ is not adjacent to any π‘Ÿ in 𝑅. Then β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( x ) βˆ’ 1 , and so Ξ± r ∈ N ⁒ ( x ) for all r ∈ R . Since

Ξ¦ + = { βˆ‘ r ∈ R Ξ» r ⁒ Ξ± r ∈ Ξ¦ | Ξ» r β‰₯ 0 ⁒ for all ⁒ r ⁒ in ⁒ R } ,

it follows that Ξ¦ + βŠ† N ⁒ ( x ) . If π‘Š is infinite, then Ξ¦ + is infinite, whereas N ⁒ ( x ) is finite, a contradiction. Therefore, it follows that π‘Š is finite, and now Ξ¦ + βŠ† N ⁒ ( x ) forces Ξ¦ + = N ⁒ ( x ) , which implies x = w 0 . ∎

Proof of Theorem 1.2

If π‘Š has a longest element w 0 (that is, if π‘Š is finite), observe that β„“ ⁒ ( x ⁒ w 0 ) = β„“ ⁒ ( x ) + β„“ ⁒ ( w 0 ) only when x = 1 , and so { w 0 } is a connected component of E 0 ⁒ ( W ) . Let π‘₯ be any element of I ⁒ ( W ) other than (where it exists) w 0 . By Lemma 3.1, π‘₯ is adjacent to some r ∈ R . If π‘Ÿ and 𝑠 are distinct elements of 𝑅, then β„“ ⁒ ( r ⁒ s ) = 2 = β„“ ⁒ ( r ) + β„“ ⁒ ( s ) and so π‘Ÿ and 𝑠 are adjacent. Hence E Μ‚ 0 ⁒ ( W ) is connected with diameter at most 3. ∎

The next results allow us to determine the diameter of E Μ‚ 0 ⁒ ( W ) for several classes of Coxeter groups, including finite and affine Coxeter groups.

Lemma 3.2

Let π‘Š be a Coxeter group of finite rank at least 3. If there exist distinct fundamental reflections π‘Ÿ and 𝑠 such that W R βˆ– { r } and W R βˆ– { s } are both finite, then the diameter of E Μ‚ 0 ⁒ ( W ) is 3.

Proof

Let X = W R βˆ– { r } and Y = W R βˆ– { s } with longest elements π‘₯ and 𝑦 respectively. Then x , y ∈ I ⁒ ( W ) . For all t ∈ R βˆ– { r } , it follows from the maximal length of π‘₯ that β„“ ⁒ ( x ⁒ t ) < β„“ ⁒ ( x ) . Hence if 𝑧 is adjacent to π‘₯ in E Μ‚ 0 ⁒ ( W ) , then every reduced expression for 𝑧 starts with π‘Ÿ. Similarly, if 𝑧 is adjacent to 𝑦 in E Μ‚ 0 ⁒ ( W ) , every reduced expression for 𝑧 starts with 𝑠. It follows that π‘₯ and 𝑦 have no common neighbours. Finally, let t ∈ R βˆ– { r , s } . By the Exchange Condition, there exists a reduced expression for 𝑦 starting in 𝑑, and so π‘₯ and 𝑦 are not adjacent. Hence the diameter of E Μ‚ 0 ⁒ ( W ) is 3. ∎

Lemma 3.3

Let π‘Š be an infinite Coxeter group. Then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) ∈ { 2 , 3 } . If there exists r ∈ R such that m r ⁒ s = ∞ for all s ∈ R βˆ– { r } , or if π‘Š has infinite rank, then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 2 .

Proof

Since π‘Š is infinite, π‘Š has rank at least 2, and so there exist distinct r , s in 𝑅. By Theorem 1.2, E Μ‚ 0 ⁒ ( W ) is connected with diameter at most 3. If π‘Ÿ commutes with 𝑠, then r ⁒ s is an involution in E Μ‚ 0 ⁒ ( W ) which is not adjacent to π‘Ÿ. Otherwise, r ⁒ s ⁒ r is an involution in E Μ‚ 0 ⁒ ( W ) which is not adjacent to π‘Ÿ. Therefore, Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) β‰₯ 2 . Hence Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) ∈ { 2 , 3 } .

Now, suppose there exists r ∈ R such that m r ⁒ s = ∞ for all s ∈ R βˆ– { r } . For any element 𝑀 of π‘Š, if 𝑀 has a reduced expression ending in π‘Ÿ, then all reduced expressions for 𝑀 end in π‘Ÿ. To see this, recall that any reduced expression for 𝑀 can be obtained from any other by use of braid relations, and there are no braid relations involving π‘Ÿ, so there is no braid relation that will replace the π‘Ÿ at the end of 𝑀 with a different fundamental reflection. Moreover, if 𝑀 is an involution with a reduced expression ending in π‘Ÿ, then since w βˆ’ 1 = w , every reduced expression for 𝑀 also begins with π‘Ÿ. Let π‘₯ and 𝑦 be involutions and let s ∈ R βˆ– { r } . If both π‘₯ and 𝑦 have reduced expressions ending with π‘Ÿ, then these reduced expressions also begin with π‘Ÿ, and all reduced expressions for π‘₯ and for 𝑦 both begin and end with π‘Ÿ. Therefore, both π‘₯ and 𝑦 are adjacent to 𝑠 and are thus distance at most 2 apart. Meanwhile, if neither π‘₯ nor 𝑦 have a reduced expression beginning with π‘Ÿ, then both π‘₯ and 𝑦 are adjacent to π‘Ÿ. If π‘₯ has a reduced expression ending in π‘Ÿ and 𝑦 does not (or vice versa), then β„“ ⁒ ( x ⁒ y ) = β„“ ⁒ ( x ) + β„“ ⁒ ( y ) , because in order for any cancellation to occur, at least one braid relation involving π‘Ÿ would have to be used, in order to juxtapose and cancel any pairs of fundamental reflections from the expressions for π‘₯ and 𝑦. Therefore, π‘₯ and 𝑦 are adjacent. Hence Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 2 .

The final case to consider is where π‘Š has infinite rank. Since any element of π‘Š has finite length, any reduced expression involves at most finitely many fundamental reflections. Thus, for any involutions π‘₯ and 𝑦, there is a fundamental reflection π‘Ÿ that does not appear in any reduced expression for π‘₯ or 𝑦. Clearly, π‘₯ and 𝑦 are both adjacent to π‘Ÿ in E Μ‚ 0 ⁒ ( W ) , and so, again, Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 2 . ∎

Recall that an irreducible Coxeter group π‘Š is compact hyperbolic if it is neither finite nor affine, but all proper parabolic subgroups of π‘Š are finite.

Theorem 3.4

Let π‘Š be a Coxeter group of rank at least 2.

  1. If π‘Š is a finite Coxeter group, then

    Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = { 1 if ⁒ W = W ⁒ ( A 2 ) ⁒ or ⁒ W ⁒ ( A 1 Γ— A 1 ) , 3 otherwise .

  2. If π‘Š is an affine Coxeter group, then

    Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = { 2 if ⁒ W = W ⁒ ( A Μƒ 1 ) , 3 otherwise .

  3. If π‘Š is compact hyperbolic, then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 .

Proof

Suppose that π‘Š is finite, affine or compact hyperbolic. If rank ⁒ ( W ) β‰₯ 3 , then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 by Lemma 3.2. Hence we may assume that rank ⁒ ( W ) = 2 .

(i) Let π‘Š be finite of rank 2 with generators π‘Ÿ and 𝑠 such that o ⁒ ( r ⁒ s ) = m . If m = 2 , then π‘Š is of type A 1 Γ— A 1 , and if m = 3 , then π‘Š is of type A 2 . In both cases, I ⁒ ( W ) βˆ– { w 0 } = { r , s } , and π‘Ÿ is adjacent to 𝑠 in E Μ‚ 0 ⁒ ( W ) . Thus the diameter is 1.

Suppose m > 3 . If π‘š is even, then w 0 is central and so w 0 ⁒ r is an involution. Since N ⁒ ( w 0 ⁒ r ) = Ξ¦ + βˆ– { Ξ± r } , it follows that w 0 ⁒ r is adjacent only to π‘Ÿ in E Μ‚ 0 ⁒ ( W ) . Similarly, w 0 ⁒ s is adjacent only to 𝑠. Therefore, w 0 ⁒ r and w 0 ⁒ s share no common neighbours and Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 . If π‘š is odd, then every involution in π‘Š is a reflection. Since β„“ ⁒ ( ( r ⁒ s ) ( m βˆ’ 3 ) / 2 ⁒ r ) = m βˆ’ 2 , any involution adjacent to ( r ⁒ s ) ( m βˆ’ 3 ) / 2 ⁒ r in E Μ‚ 0 ⁒ ( W ) has length at most 2. But all reflections have odd length. Thus ( r ⁒ s ) ( m βˆ’ 3 ) / 2 ⁒ r is adjacent only to 𝑠, and similarly ( s ⁒ r ) ( m βˆ’ 3 ) / 2 ⁒ s is adjacent only to π‘Ÿ. As before, this implies that Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 .

(ii) The only affine Coxeter group with rank less than 3 is W ⁒ ( A Μƒ 1 ) , which has Dynkin diagram . By Lemma 3.3, Diam ⁒ ( E 0 ⁒ ( W ⁒ ( A Μƒ 1 ) ) ) = 2 .

(iii) All compact hyperbolic Coxeter groups have rank at least 3. ∎

Lemma 3.5

Suppose that π‘Š is infinite and reducible with W = W 1 Γ— β‹― Γ— W m , where each W i is irreducible and m > 1 .

  1. If Diam ⁒ ( E Μ‚ 0 ⁒ ( W i ) ) = 2 for all i ∈ { 1 , … , m } , then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 2 .

  2. If Diam ⁒ ( E Μ‚ 0 ⁒ ( W i ) ) = 3 for all i ∈ { 1 , … , m } , then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 .

Proof

(i) By Theorem 3.4 (i), each W i is infinite, and so E Μ‚ 0 ⁒ ( W i ) = E 0 ⁒ ( W i ) by Theorem 1.2. Let x = ( x 1 , … , x m ) , y = ( y 1 , … , y m ) ∈ I ⁒ ( W ) . If x i is adjacent to y i in E 0 ⁒ ( W i ) for all i ∈ { 1 , … , m } , then π‘₯ is adjacent to 𝑦 in E 0 ⁒ ( W ) . Hence assume that there exists i ∈ { 1 , … , m } such that x i and y i are not adjacent in E 0 ⁒ ( W i ) . Since Diam ⁒ ( E 0 ⁒ ( W i ) ) = 2 , there exists z i ∈ I ⁒ ( W i ) such that x i and y i are both adjacent to z i . Hence π‘₯ and 𝑦 are both adjacent to the element of I ⁒ ( W ) with z i in its 𝑖-th position and the identity elsewhere.

(ii) For all i ∈ { 1 , … , m } , there exist x i , y i ∈ I ⁒ ( W i ) such that d ⁒ ( x i , y i ) = 3 . Let x : = ( x 1 , … , x m ) , y : = ( y 1 , … , y m ) ∈ I ( W ) . Then clearly π‘₯ and 𝑦 are not adjacent. Suppose there exists z = ( z 1 , … , z m ) ∈ I ⁒ ( W ) adjacent to both π‘₯ and 𝑦. Since β„“ ⁒ ( x i ⁒ z i ) ≀ β„“ ⁒ ( x i ) + β„“ ⁒ ( z i ) , it follows that β„“ ⁒ ( x ⁒ z ) = β„“ ⁒ ( x ) + β„“ ⁒ ( z ) if and only if β„“ ⁒ ( x i ⁒ z i ) = β„“ ⁒ ( x i ) + β„“ ⁒ ( z i ) for all i ∈ { 1 , … , m } . In order for 𝑧 to be an involution, either z i ∈ I ⁒ ( W i ) or z i = 1 . The first is impossible because d ⁒ ( x i , y i ) = 3 . Therefore, we have z i = 1 for all 𝑖, and so z = 1 βˆ‰ I ⁒ ( W ) , a contradiction. Thus Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 3 . ∎

We note that Lemma 3.5 is best possible without knowing more about the irreducible components than just their diameters. For example, suppose there exists i ∈ { 1 , … , m } with Diam ⁒ ( E Μ‚ 0 ⁒ ( W i ) ) = 3 . Then Diam ⁒ ( E Μ‚ 0 ⁒ ( W ) ) = 2 if and only if there exists j ∈ { 1 , … , m } with both Diam ⁒ ( E Μ‚ 0 ⁒ ( W j ) ) = 2 and the additional property that every pair of adjacent involutions in E Μ‚ 0 ⁒ ( W j ) has at least one neighbour in common. As the final lemma in this section shows, this additional property cannot be guaranteed for all W j with Diam ⁒ ( E Μ‚ 0 ⁒ ( W j ) ) = 2 .

Lemma 3.6

For n β‰₯ 2 , let W n be the Coxeter group given by

W n = ⟨ r 1 , … , r n ∣ r 1 2 = β‹― = r n 2 = 1 ⟩ .

Then Diam ⁒ ( E Μ‚ 0 ⁒ ( W n ) ) = 2 . Furthermore, if n = 2 , then no pair of adjacent involutions in E Μ‚ 0 ⁒ ( W n ) has a neighbour in common. If n > 2 , then every pair of adjacent involutions has a neighbour in common.

Proof

Every element in W n has a unique reduced expression, as there are no braid relations. For each 𝑖, let X i be the set of involutions in W n whose reduced expression ends in r i . Then I ⁒ ( W n ) is the disjoint union X 1 βˆͺ β‹― βˆͺ X n , and for all π‘₯ in X i , we have Ξ” 1 ⁒ ( x ) = I ⁒ ( W n ) βˆ– X i . Thus involutions π‘₯ and 𝑦 are adjacent if and only if x ∈ X i and y ∈ X j for some i β‰  j , and the set of mutual neighbours of π‘₯ and 𝑦 is I ⁒ ( W n ) βˆ– ( X i βˆͺ X j ) . The result now follows immediately. ∎

4 Valencies in E 0 ⁒ ( W )

We begin with the following well-known result.

Lemma 4.1

Suppose that π‘Š is a finite rank Coxeter group. Let π‘Ÿ be a fundamental reflection and π‘₯ an involution of π‘Š, and assume that π‘Ÿ and π‘₯ do not commute. If x β‹… Ξ± r ∈ Ξ¦ βˆ’ , then β„“ ⁒ ( r ⁒ x ) = β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( x ) βˆ’ 1 and β„“ ⁒ ( r ⁒ x ⁒ r ) = β„“ ⁒ ( x ) βˆ’ 2 . If x β‹… Ξ± r ∈ Ξ¦ + , then β„“ ⁒ ( r ⁒ x ) = β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( x ) + 1 and β„“ ⁒ ( r ⁒ x ⁒ r ) = β„“ ⁒ ( x ) + 2 .

Proof

Note that ( x ⁒ r ) βˆ’ 1 = r βˆ’ 1 ⁒ x βˆ’ 1 = r ⁒ x , and so β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( r ⁒ x ) . Assume that x β‹… Ξ± r ∈ Ξ¦ βˆ’ . Then

β„“ ⁒ ( r ⁒ x ) = β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( x ) βˆ’ 1

by Lemma 2.1. Now, β„“ ⁒ ( r ⁒ x ⁒ r ) = β„“ ⁒ ( r ⁒ x ) βˆ’ 1 if and only if r ⁒ x β‹… Ξ± r ∈ Ξ¦ βˆ’ . But

r ⁒ x β‹… Ξ± r = r β‹… ( x β‹… Ξ± r ) .

Since β„“ ⁒ ( x ⁒ r ) < β„“ ⁒ ( x ) , we have x β‹… Ξ± r ∈ Ξ¦ βˆ’ , so the only way that r β‹… ( x β‹… Ξ± r ) ∈ Ξ¦ + is if x β‹… Ξ± r = βˆ’ Ξ± r . But if that happens, then π‘₯ commutes with π‘Ÿ, contrary to our hypothesis. Hence β„“ ⁒ ( r ⁒ x ⁒ r ) = β„“ ⁒ ( x ) βˆ’ 2 . Similarly, if x β‹… Ξ± r ∈ Ξ¦ + , then the only way that r β‹… ( x β‹… Ξ± r ) ∈ Ξ¦ βˆ’ is if x β‹… Ξ± r = Ξ± r , which again implies that π‘₯ commutes with π‘Ÿ. So β„“ ⁒ ( r ⁒ x ⁒ r ) = β„“ ⁒ ( x ) + 2 . ∎

Lemma 4.2

Suppose that π‘Š is a Coxeter group of finite rank, let π‘Ÿ be a fundamental reflection of π‘Š and write I ⁒ ( W ) Μ„ = I ⁒ ( W ) βˆ– { r } . Then

| Ξ” 1 ⁒ ( r ) | = | I ⁒ ( W ) Μ„ βˆ– Ξ” 1 ⁒ ( r ) | .

In particular, if π‘Š is finite, then | Ξ” 1 ⁒ ( r ) | = 1 2 ⁒ ( | I ⁒ ( W ) | βˆ’ 1 ) .

Proof

Let π‘Ÿ be a fundamental reflection of π‘Š. Then I ⁒ ( W ) Μ„ is the disjoint union of two sets: X = { x ∈ I ⁒ ( W ) Μ„ ∣ x ⁒ r = r ⁒ x } and Y = { y ∈ I ⁒ ( W ) Μ„ ∣ y ⁒ r β‰  r ⁒ y } . Now, x ∈ X if and only if x ⁒ r ∈ X , and β„“ ⁒ ( x ⁒ r ) = β„“ ⁒ ( x ) + 1 if and only if

β„“ ⁒ ( ( x ⁒ r ) ⁒ r ) = β„“ ⁒ ( x ) = β„“ ⁒ ( x ⁒ r ) βˆ’ 1 .

Therefore, X ∩ Ξ” 1 ⁒ ( r ) and X ∩ ( I ⁒ ( W ) Μ„ βˆ– Ξ” 1 ⁒ ( r ) ) have the same cardinalities. Similarly, y ∈ Y if and only if r ⁒ y ⁒ r ∈ Y . Moreover, if β„“ ⁒ ( y ⁒ r ) = β„“ ⁒ ( y ) + 1 , then we have β„“ ⁒ ( r ⁒ y ⁒ r ) = β„“ ⁒ ( y ) + 2 by Lemma 4.1. So β„“ ⁒ ( r ⁒ ( r ⁒ y ⁒ r ) ) = β„“ ⁒ ( y ⁒ r ) = β„“ ⁒ ( r ⁒ y ⁒ r ) βˆ’ 1 . On the other hand, if β„“ ⁒ ( y ⁒ r ) = β„“ ⁒ ( y ) βˆ’ 1 , then, again by Lemma 4.1, β„“ ⁒ ( r ⁒ y ⁒ r ) = β„“ ⁒ ( y ) βˆ’ 2 and so β„“ ⁒ ( r ⁒ ( r ⁒ y ⁒ r ) ) = β„“ ⁒ ( r ⁒ y ⁒ r ) + 1 . Thus Y ∩ Ξ” 1 ⁒ ( r ) and Y ∩ ( I ⁒ ( W ) Μ„ βˆ– Ξ” 1 ⁒ ( r ) ) also have the same cardinality, so proving the lemma. ∎

Our next result and its corollary show that, when π‘Š is finite, no involution can have more neighbours than a fundamental reflection.

Lemma 4.3

Let π‘₯ be a vertex of E Μ‚ 0 ⁒ ( W ) and suppose r ∈ R with l ⁒ ( x ⁒ r ) < l ⁒ ( x ) . Then Ξ” 1 ⁒ ( x ) βŠ† Ξ” 1 ⁒ ( r ) . If π‘Š is finite, then Ξ” 1 ⁒ ( x ) = Ξ” 1 ⁒ ( r ) if and only if x = r .

Proof

Let y ∈ Ξ” 1 ⁒ ( x ) . Then N ⁒ ( y ) ∩ N ⁒ ( x ) = βˆ… . But N ⁒ ( r ) = { Ξ± r } βŠ† N ⁒ ( x ) , and hence N ⁒ ( y ) ∩ N ⁒ ( r ) = βˆ… . Therefore, Ξ” 1 ⁒ ( x ) βŠ† Ξ” 1 ⁒ ( r ) . Now, suppose π‘Š is finite. If π‘Ÿ commutes with w 0 , then r ⁒ w 0 ∈ Ξ” 1 ⁒ ( r ) . But N ⁒ ( r ⁒ w 0 ) = Ξ¦ + βˆ– { Ξ± r } . Thus the only way for N ⁒ ( x ) ∩ N ⁒ ( r ⁒ w 0 ) = βˆ… is for x = r . Hence Ξ” 1 ⁒ ( x ) = Ξ” 1 ⁒ ( r ) implies x = r . If π‘Ÿ does not commute with w 0 , then r ⁒ w 0 ⁒ r ∈ Ξ” 1 ⁒ ( r ) , and by Lemma 4.1, β„“ ⁒ ( r ⁒ w 0 ⁒ r ) = β„“ ⁒ ( w 0 ) βˆ’ 2 . Hence if r ⁒ w 0 ⁒ r ∈ Ξ” 1 ⁒ ( x ) , we have β„“ ⁒ ( x ) ≀ 2 . If β„“ ⁒ ( x ) = 1 , then we clearly have x = r . If β„“ ⁒ ( x ) = 2 , then (since π‘₯ is an involution) x = r ⁒ s , where s ∈ R and s ⁒ r = r ⁒ s . But then s ∈ Ξ” 1 ⁒ ( r ) βˆ– Ξ” 1 ⁒ ( x ) . In all cases, we see that Ξ” 1 ⁒ ( x ) = Ξ” 1 ⁒ ( r ) if and only if x = r . ∎

Corollary 4.4

If π‘Š is finite and x ∈ E 0 ⁒ ( W ) , then | Ξ” 1 ⁒ ( x ) | ≀ 1 2 ⁒ ( | I ⁒ ( W ) | βˆ’ 1 ) , with equality if and only if x ∈ R .

We note that, when π‘Š is infinite, it is possible for Ξ” 1 ⁒ ( x ) = Ξ” 1 ⁒ ( r ) when x β‰  r . For example, in the infinite dihedral group W = W ⁒ ( A Μƒ 1 ) , generated by π‘Ÿ and 𝑠 with m r ⁒ s = ∞ , let

X = { r , r ⁒ s ⁒ r , r ⁒ s ⁒ r ⁒ s ⁒ r , … } and Y = { s , s ⁒ r ⁒ s , s ⁒ r ⁒ s ⁒ r ⁒ s ⁒ … } .

Then I ⁒ ( W ) = X βˆͺ Y . For all x ∈ X , we have Ξ” 1 ⁒ ( x ) = Y = Ξ” 1 ⁒ ( s ) , and for all y ∈ Y , we have Ξ” 1 ⁒ ( y ) = X = Ξ” 1 ⁒ ( r ) .

We next restrict our attention to Sym ⁒ ( n ) and determine formulae for the number of neighbours of minimal length involutions in their conjugacy classes. The conjugacy classes of involutions in Sym ⁒ ( n ) are parametrized by the number of transpositions in the involution when written as a product of disjoint cycles.

Lemma 4.5

Suppose π‘₯ and 𝑦 are conjugate involutions both of minimal length in their conjugacy class in Sym ⁒ ( n ) . Then | Ξ” 1 ⁒ ( x ) | = | Ξ” 1 ⁒ ( y ) | .

Proof

It is sufficient to prove that, whenever π‘₯ is a product of π‘š mutually commuting distinct fundamental reflections (transpositions of the form ( a i , a i + 1 ) ) in Sym ⁒ ( n ) , then

| Ξ” 1 ⁒ ( x ) | = | Ξ” 1 ⁒ ( ( 12 ) ⁒ ( 34 ) ⁒ β‹― ⁒ ( 2 ⁒ m βˆ’ 1 , 2 ⁒ m ) ) | .

Suppose that x β‰  ( 12 ) ⁒ ( 34 ) ⁒ β‹― ⁒ ( 2 ⁒ m βˆ’ 1 , 2 ⁒ m ) . Then there is some π‘Ž with 1 < a < n such that π‘₯ contains the transposition r = ( a , a + 1 ) and fixes a βˆ’ 1 . Let 𝑦 be π‘₯ with π‘Ÿ replaced by s = ( a βˆ’ 1 , a ) . We will show that | Ξ” 1 ⁒ ( y ) | = | Ξ” 1 ⁒ ( x ) | . First, note that Ξ” 1 ⁒ ( x ) is the disjoint union of the following three sets:

U 1 = { z ∈ Ξ” 1 ⁒ ( x ) ∣ z ⁒ fixes ⁒ a βˆ’ 1 , a , and ⁒ a + 1 } , U 2 = { z ∈ Ξ” 1 ⁒ ( x ) ∣ z ⁒ contains ⁒ ( a βˆ’ 1 , a ) ⁒ and fixes ⁒ a + 1 } , U 3 = Ξ” 1 ⁒ ( x ) βˆ– ( U 1 βˆͺ U 2 ) .

Meanwhile, Ξ” 1 ⁒ ( y ) is the disjoint union of the following sets:

V 1 = { z ∈ Ξ” 1 ⁒ ( y ) ∣ z ⁒ fixes ⁒ a βˆ’ 1 , a , and ⁒ a + 1 } , V 2 = { z ∈ Ξ” 1 ⁒ ( y ) ∣ z ⁒ contains ⁒ ( a , a + 1 ) ⁒ and fixes ⁒ a βˆ’ 1 } , V 3 = Ξ” 1 ⁒ ( y ) βˆ– ( V 1 βˆͺ V 2 ) .

Clearly, r ⁒ U 1 = V 2 and s ⁒ U 2 = V 1 . We claim that r ⁒ s ⁒ U 3 ⁒ s ⁒ r = V 3 . Suppose z ∈ U 3 . Then z β‹… Ξ± r ∈ Ξ¦ + . We have r ⁒ s ⁒ z ⁒ s ⁒ r β‹… Ξ± s = r ⁒ s ⁒ z β‹… Ξ± r . Since z β‹… Ξ± r ∈ Ξ¦ + , r ⁒ s ⁒ z β‹… Ξ± r ∈ Ξ¦ βˆ’ if and only if z β‹… Ξ± r = Ξ± s or z β‹… Ξ± r = Ξ± r + Ξ± s . In the first case, since Ξ± r = e a βˆ’ e a + 1 and Ξ± s = e a βˆ’ 1 βˆ’ e a , we would have z ⁒ ( a + 1 ) = a and z ⁒ ( a ) = a βˆ’ 1 , contradicting the fact that 𝑧 is an involution. In the second case, since Ξ± r + Ξ± s = e a βˆ’ 1 βˆ’ e a + 1 , we have that 𝑧 contains ( a βˆ’ 1 , a ) and fixes a + 1 , contradicting the fact that z ∈ U 3 . Therefore, r ⁒ s ⁒ z ⁒ s ⁒ r β‹… Ξ± s ∈ Ξ¦ + , which implies r ⁒ s ⁒ z ⁒ s ⁒ r ∈ Ξ” 1 ⁒ ( y ) . If r ⁒ s ⁒ z ⁒ s ⁒ r ∈ V 1 , then 𝑧 commutes with both π‘Ÿ and 𝑠, meaning r ⁒ s ⁒ z ⁒ s ⁒ r = z , and thus z ∈ U 1 , a contradiction. If r ⁒ s ⁒ z ⁒ s ⁒ r ∈ V 2 , then 𝑧 contains ( a βˆ’ 1 , a + 1 ) and fixes π‘Ž. But then z β‹… Ξ± r ∈ Ξ¦ βˆ’ , contradicting the fact that z ∈ Ξ” 1 ⁒ ( x ) . Hence r ⁒ s ⁒ z ⁒ s ⁒ r ∈ V 3 . Thus we have | Ξ” 1 ⁒ ( x ) | = | Ξ” 1 ⁒ ( y ) | . We may repeat this process until we obtain an element with no further fixed points in the set { 1 , 2 , … , 2 ⁒ m } . Hence

| Ξ” 1 ⁒ ( x ) | = | Ξ” 1 ⁒ ( ( 12 ) ⁒ ( 34 ) ⁒ β‹― ⁒ ( 2 ⁒ m βˆ’ 1 , 2 ⁒ m ) ) | . ∎

Lemma 4.5 proves that Ξ΄ ⁒ ( m , n ) , as described in Section 1, is well-defined. We now prove Theorem 1.5, which states that if m β‰₯ 2 and n β‰₯ 2 ⁒ m , then

Ξ΄ ⁒ ( m , n ) = 1 2 ⁒ ( Ξ΄ ⁒ ( m βˆ’ 1 , n ) + ( m βˆ’ 1 ) ⁒ Ξ΄ ⁒ ( m βˆ’ 2 , n βˆ’ 4 ) + m βˆ’ 2 ) .

Proof of Theorem 1.5.

Given an involution π‘₯, we find π‘₯ as a vertex of E Μ‚ 0 ⁒ ( Sym ⁒ ( n ) ) whenever the support of π‘₯ is contained in { 1 , … , n } . We write Ξ” ⁒ ( x , n ) for Ξ” 1 ⁒ ( x ) in E Μ‚ 0 ⁒ ( Sym ⁒ ( n ) ) . Let y = ( 12 ) ⁒ ( 34 ) ⁒ β‹― ⁒ ( 2 ⁒ m βˆ’ 3 , 2 ⁒ m βˆ’ 2 ) and let x = y ⁒ ( n βˆ’ 1 , n ) . Then Ξ΄ ⁒ ( m , n ) = | Ξ” ⁒ ( x , n ) | . Observe that

Ξ” ⁒ ( x , n ) = Ξ” ⁒ ( y , n ) ∩ Ξ” ⁒ ( ( n βˆ’ 1 , n ) , n ) = { z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ ( n βˆ’ 1 ) < z ⁒ ( n ) } .

Now, Ξ” ⁒ ( y , n ) is the disjoint union of the following sets:

U 1 = { z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ fixes ⁒ n ⁒ and ⁒ n βˆ’ 1 } , U 2 = { z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ contains ⁒ ( n βˆ’ 1 , n ) } , U 3 = { z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ fixes exactly one of ⁒ n ⁒ and ⁒ n βˆ’ 1 } , U 4 = { z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ contains ⁒ ( a , n βˆ’ 1 ) ⁒ ( b , n ) ⁒ for some ⁒ a , b < n βˆ’ 1 } .

Clearly, we have | U 1 | = Ξ΄ ⁒ ( m βˆ’ 1 , n βˆ’ 2 ) , | U 2 | = Ξ΄ ⁒ ( m βˆ’ 1 , n βˆ’ 2 ) + 1 = | U 1 | + 1 , and U 1 βŠ† Ξ” ⁒ ( x , n ) , while U 2 ∩ Ξ” ⁒ ( x , n ) = βˆ… . In U 3 , we can pair the elements into those with cycles ( a , n βˆ’ 1 ) ⁒ ( n ) for some a < n βˆ’ 1 (and these elements are contained in Ξ” ⁒ ( x , n ) ), and those with cycles ( a , n ) ⁒ ( n βˆ’ 1 ) (and these elements are not contained in Ξ” ⁒ ( x , n ) ). Therefore, | U 3 ∩ Ξ” ⁒ ( x , n ) | = 1 2 ⁒ | U 3 | . Finally, consider 𝑧 in U 4 , so that 𝑧 contains ( a , n βˆ’ 1 ) ⁒ ( b , n ) for some a , b < n βˆ’ 1 . In all cases except where a = 2 ⁒ i βˆ’ 1 and b = 2 ⁒ i , for some 1 ≀ i < m , both 𝑧 and z ( n βˆ’ 1 , n ) , which is 𝑧 with ( a , n βˆ’ 1 ) ⁒ ( b , n ) replaced with ( b , n βˆ’ 1 ) ⁒ ( a , n ) , are contained in U 4 . Moreover, exactly one of 𝑧 and z ( n βˆ’ 1 , n ) lies in Ξ” ⁒ ( x , n ) . Let

U 5 = { z ∈ Ξ” ( y , n ) ∣ z ⁒ contains ⁒ ( 2 ⁒ i βˆ’ 1 , n βˆ’ 1 ) ⁒ ( 2 ⁒ i , n ) for some i ∈ { 1 , … , m βˆ’ 1 } } βŠ† U 4 .

Then U 5 βŠ† Ξ” ⁒ ( x , n ) and exactly half the elements of U 4 βˆ– U 5 lie in Ξ” ⁒ ( x , n ) . Moreover, for each 𝑖 in { 1 , … , m βˆ’ 1 } , there is a bijection between

{ z ∈ Ξ” ⁒ ( y , n ) ∣ z ⁒ contains ⁒ ( 2 ⁒ i βˆ’ 1 , n βˆ’ 1 ) ⁒ ( 2 ⁒ i , n ) }

and Ξ” ⁒ ( ( 12 ) ⁒ ( 34 ) ⁒ β‹― ⁒ ( 2 ⁒ m βˆ’ 5 , 2 ⁒ m βˆ’ 4 ) , n βˆ’ 4 ) . Thus

| U 5 | = ( m βˆ’ 1 ) ⁒ ( Ξ΄ ⁒ ( m βˆ’ 2 , n βˆ’ 4 ) + 1 ) .

Gathering all these observations together, we see that

Ξ΄ ⁒ ( m , n ) = | Ξ” ⁒ ( x , n ) | = | U 1 | + 1 2 ⁒ | U 3 | + 1 2 ⁒ | U 4 βˆ– U 5 | + | U 5 | = 1 2 ⁒ ( | U 1 | + ( | U 2 | βˆ’ 1 ) + | U 3 | + | U 4 | βˆ’ | U 5 | + 2 ⁒ | U 5 | ) = 1 2 ⁒ ( Ξ΄ ⁒ ( y , n ) + | U 5 | βˆ’ 1 ) = 1 2 ⁒ ( Ξ΄ ⁒ ( m βˆ’ 1 , n ) + ( m βˆ’ 1 ) ⁒ Ξ΄ ⁒ ( m βˆ’ 2 , n βˆ’ 4 ) + m βˆ’ 2 ) . ∎

By repeated use of Theorem 1.5 and Lemma 4.2, we obtain the following corollary.

Corollary 4.6

Let n β‰₯ 2 . Then

Ξ΄ ⁒ ( 1 , n ) = 1 2 ⁒ ( | I ⁒ ( Sym ⁒ ( n ) ) | βˆ’ 1 ) ,
Ξ΄ ⁒ ( 2 , n ) = 1 4 ⁒ ( | I ⁒ ( Sym ⁒ ( n ) ) | + 2 ⁒ | I ⁒ ( Sym ⁒ ( n βˆ’ 4 ) ) | βˆ’ 1 ) ( n β‰₯ 4 ) ,
Ξ΄ ⁒ ( 3 , n ) = 1 8 ⁒ ( | I ⁒ ( Sym ⁒ ( n ) ) | + 6 ⁒ | I ⁒ ( Sym ⁒ ( n βˆ’ 4 ) ) | βˆ’ 1 ) ( n β‰₯ 6 ) ,
Ξ΄ ( 4 , n ) = 1 16 ( | I ( Sym ( n ) ) | + 12 | I ( Sym ( n βˆ’ 4 ) ) |
+ 12 | I ( Sym ( n βˆ’ 8 ) ) | + 9 ) ( n β‰₯ 8 ) .

5 Pendant elements

In this section, we determine the elements of I ⁒ ( W ) with minimal valency in E Μ‚ 0 ⁒ ( W ) . From now on, π‘Š is assumed to be a finite irreducible Coxeter group of rank n β‰₯ 2 , with R = { r 1 , … , r n } its set of fundamental reflections and, where relevant, has Dynkin diagrams as given in Section 2.

As we have seen in Theorem 1.2, if w ∈ I ⁒ ( W ) βˆ– { w 0 } , then | Ξ” 1 ⁒ ( w ) | β‰₯ 1 . Hence we are interested in those w ∈ I ⁒ ( W ) βˆ– { w 0 } with | Ξ” 1 ⁒ ( w ) | = 1 . We call such elements pendant elements and denote the set of such elements by P ⁒ ( W ) . For x ∈ W , we observe that w 0 ⁒ x ∈ I ⁒ ( W ) if and only if x w 0 = x βˆ’ 1 . For ease, we shall often work with elements of the form w 0 ⁒ x , and begin with a preliminary lemma for elements of this form.

Lemma 5.1

Suppose that x ∈ W is such that w 0 ⁒ x ∈ I ⁒ ( W ) . Let w ∈ I ⁒ ( W ) . Then w ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) if and only if β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( w ) .

Proof

Firstly, as w 0 is the longest element, we have β„“ ⁒ ( w 0 ⁒ x ⁒ w ) = β„“ ⁒ ( w 0 ) βˆ’ β„“ ⁒ ( x ⁒ w ) . If w ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) , then, in addition,

β„“ ⁒ ( w 0 ⁒ x ⁒ w ) = β„“ ⁒ ( w 0 ⁒ x ) + β„“ ⁒ ( w ) = β„“ ⁒ ( w 0 ) βˆ’ β„“ ⁒ ( x ) + β„“ ⁒ ( w ) .

Hence β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( w ) .

On the other hand, if β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( w ) , then

β„“ ⁒ ( w 0 ⁒ x ) + β„“ ⁒ ( w ) = β„“ ⁒ ( w 0 ) βˆ’ β„“ ⁒ ( x ) + β„“ ⁒ ( w ) = β„“ ⁒ ( w 0 ) βˆ’ β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( w 0 ⁒ x ⁒ w ) ,

and hence w ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . ∎

An immediate consequence of Lemma 5.1 is our next result.

Lemma 5.2

Let r ∈ R . If w 0 ⁒ r ∈ I ⁒ ( W ) , then Ξ” 1 ⁒ ( w 0 ⁒ r ) = { r } .

Lemma 5.3

Suppose that w 0 ∈ Z ⁒ ( W ) . (This occurs when π‘Š is of type B n , type D n with 𝑛 even, type F 4 , H 3 , H 4 , E 7 or E 8 , or type I 2 ⁒ ( m ) with π‘š even.) Then P ⁒ ( W ) = { w 0 ⁒ r ∣ r ∈ R } , with Ξ” 1 ⁒ ( w 0 ⁒ r ) = { r } for all r ∈ R .

Proof

Since w 0 ∈ Z ⁒ ( W ) , we have w 0 ⁒ r ∈ I ⁒ ( W ) . By Lemma 5.2, Ξ” 1 ⁒ ( w 0 ⁒ r ) = { r } and so w 0 ⁒ r ∈ P ⁒ ( W ) . Let w ∈ I ⁒ ( W ) βˆ– ( { w 0 } βˆͺ w 0 ⁒ R ) . Then w ⁒ w 0 ∈ I ⁒ ( W ) βˆ– R . From

β„“ ⁒ ( w ) + β„“ ⁒ ( w ⁒ w 0 ) = β„“ ⁒ ( w ) + β„“ ⁒ ( w 0 ) βˆ’ β„“ ⁒ ( w ) = β„“ ⁒ ( w 0 ) = β„“ ⁒ ( w ⁒ w ⁒ w 0 ) ,

it follows using Lemma 5.1 that w ⁒ w 0 ∈ Ξ” 1 ⁒ ( w ) . By Lemma 3.1, 𝑀 has a neighbour in 𝑅 and so | Ξ” 1 ⁒ ( w ) | β‰₯ 2 . Hence w βˆ‰ P ⁒ ( W ) and the lemma holds. ∎

The remaining finite irreducible Coxeter groups to consider are those for which w 0 is non-central. These are type A n with n β‰₯ 2 , type D n with 𝑛 odd, type E 6 , and type I 2 ⁒ ( m ) for π‘š odd and m β‰₯ 5 . The next lemma covers this last case (as well as giving greater detail about I 2 ⁒ ( m ) for arbitrary π‘š).

Lemma 5.4

Let W = I 2 ⁒ ( m ) , with m β‰₯ 5 . The valency distribution of E 0 ⁒ ( W ) is

0 1 β‹… 1 2 β‹… 2 2 ⁒ β‹― ⁒ ⌊ m 2 βŒ‹ 2 .

If π‘š is even, then

P ⁒ ( W ) = { w 0 ⁒ r 1 , w 0 ⁒ r 2 } ,

with Ξ” 1 ⁒ ( w 0 ⁒ r 1 ) = { r 2 } and Ξ” 1 ⁒ ( w 0 ⁒ r 2 ) = { r 1 } . If π‘š is odd, then

P ⁒ ( W ) = { w 0 ⁒ r 1 ⁒ r 2 , w 0 ⁒ r 2 ⁒ r 1 } ,

with Ξ” 1 ⁒ ( w 0 ⁒ r 1 ⁒ r 2 ) = { r 2 } and Ξ” 1 ⁒ ( w 0 ⁒ r 2 ⁒ r 1 ) = { r 1 } .

Proof

The non-central involutions in π‘Š are

( r 1 ⁒ r 2 ) i ⁒ r 1 and ( r 2 ⁒ r 1 ) i ⁒ r 2 for ⁒ 0 ≀ i ≀ ⌊ m βˆ’ 2 2 βŒ‹ .

We have Ξ” 1 ⁒ ( ( r 1 ⁒ r 2 ) i ⁒ r 1 ) = { ( r 2 ⁒ r 1 ) j ⁒ r 2 ∣ i + j ≀ ⌊ m βˆ’ 2 2 βŒ‹ } and hence

| Ξ” 1 ⁒ ( ( r 1 ⁒ r 2 ) i ⁒ r 1 ) | = ⌊ m 2 βŒ‹ βˆ’ i .

Similarly, Ξ” 1 ⁒ ( ( r 2 ⁒ r 1 ) i ⁒ r 2 ) = { ( r 1 ⁒ r 2 ) j ⁒ r 1 ∣ i + j ≀ ⌊ m βˆ’ 2 2 βŒ‹ } , and hence

| Ξ” 1 ⁒ ( ( r 2 ⁒ r 1 ) i ⁒ r 2 ) | = ⌊ m 2 βŒ‹ βˆ’ i .

Noting that w 0 = ( r 1 ⁒ r 2 ) m / 2 when π‘š is even and

w 0 = ( r 1 ⁒ r 2 ) ( m βˆ’ 1 ) / 2 ⁒ r 1 = ( r 2 ⁒ r 1 ) ( m βˆ’ 1 ) / 2 ⁒ r 2

when π‘š is odd, the result now follows. ∎

The following may be verified using Magma[1].

Lemma 5.5

If π‘Š is of type E 6 , then

P ⁒ ( W ) = { w 0 ⁒ r 2 , w 0 ⁒ r 4 , w 0 ⁒ r 5 ⁒ r 4 ⁒ r 3 , w 0 ⁒ r 3 ⁒ r 4 ⁒ r 5 , w 0 ⁒ r 6 ⁒ r 5 ⁒ r 4 ⁒ r 3 ⁒ r 1 , w 0 ⁒ r 1 ⁒ r 3 ⁒ r 4 ⁒ r 5 ⁒ r 6 }

with Ξ” 1 ⁒ ( w 0 ⁒ β‹― ⁒ r i ) = { r i } .

5.1 π‘Š of type A n

In this subsection, we assume that π‘Š is of type A n and n β‰₯ 2 . Recall that

R = { r 1 , … , r n } .

Using the notation defined in Section 2, we write [ i 1 , i 2 , … , i j βˆ’ 1 , i j ] for

r i 1 ⁒ r i 2 ⁒ β‹― ⁒ r i j βˆ’ 1 ⁒ r i j ,

where { i 1 , … , i j } βŠ† { 1 , … , n } , and when i ≀ j , we set

[ i β†— j ] : = r i r i + 1 β‹― r j βˆ’ 1 r j and [ j β†˜ i ] : = r j r j βˆ’ 1 β‹― r i + 1 r i .

Let

X = { [ i β†— ( n + 1 βˆ’ i ) ] , [ ( n + 1 βˆ’ i ) β†˜ i ] | i ∈ { 1 , … , ⌈ n 2 βŒ‰ } } .

The following is the main result of this subsection.

Lemma 5.6

The pendant elements in E 0 ⁒ ( W ) are w 0 ⁒ x for x ∈ X , with

Ξ” 1 ⁒ ( w 0 ⁒ [ i β†— ( n + 1 βˆ’ i ) ] ) = { r n + 1 βˆ’ i } and Ξ” 1 ⁒ ( w 0 ⁒ [ ( n + 1 βˆ’ i ) β†˜ i ] ) = { r i }

for i ∈ { 1 , 2 , … , ⌈ n 2 βŒ‰ } .

The proof of Lemma 5.6 requires two preparatory lemmas about sequential elements. We call an element π‘₯ of π‘Š a sequential element if, for some r a ∈ R and Ξ» , ΞΌ β‰₯ 0 , it has a reduced expression of the form

x = [ a βˆ’ ΞΌ β†— a βˆ’ 1 , a + Ξ» β†˜ a ] .

Because πœ† and πœ‡ can both be zero, it is clear that every reduced expression for any non-identity element of π‘Š ends with a sequential element.

Lemma 5.7

Let x ∈ W . Then either

  1. π‘₯ is a sequential element of π‘Š; or

  2. there exist distinct y 1 , y 2 ∈ I ⁒ ( W ) with β„“ ⁒ ( x ⁒ y j ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( y j ) for j ∈ { 1 , 2 } .

Proof

Suppose that π‘₯ is not a sequential element of π‘Š. Fix a reduced expression for π‘₯ and let r a = [ a ] be the final fundamental reflection in the expression. Since [ a + i ] and [ a βˆ’ j ] commute for i , j β‰₯ 1 , it follows that there exist integers ΞΌ , Ξ» β‰₯ 0 and b βˆ‰ { a + Ξ» + 1 , a βˆ’ ΞΌ βˆ’ 1 } such that π‘₯ has a reduced expression of the following form:

x = [ … , b , a βˆ’ ΞΌ β†— a βˆ’ 1 , a + Ξ» β†˜ a ] .

We now construct y 1 and y 2 based on the possibilities for 𝑏. Since this is a reduced expression for π‘₯, it follows that the cases of b = a βˆ’ ΞΌ < a and b = a + Ξ» > a do not occur.

If b > a + Ξ» + 1 or b < a βˆ’ ΞΌ βˆ’ 1 , then the result follows with y 1 = [ a ] and y 2 = [ b ] . Meanwhile, if b = a + i with i ∈ { 1 , … , Ξ» βˆ’ 1 } , then take y 1 = [ a ] and y 2 = [ a + i + 1 ] . If b = a βˆ’ j with j ∈ { 1 , … , ΞΌ βˆ’ 1 } , then let y 1 = [ a ] and y 2 = [ a βˆ’ j βˆ’ 1 ] .

Finally, assume that b = a . Since the expression for π‘₯ is reduced, it follows that either ΞΌ β‰  0 or Ξ» β‰  0 . Hence there exists a reduced expression for π‘₯ ending in

y 2 = { [ a , a βˆ’ 1 , a + 1 , a ] if ⁒ Ξ» , ΞΌ β‰  0 , [ a , a βˆ’ 1 , a ] if ⁒ Ξ» = 0 , [ a , a + 1 , a ] if ⁒ ΞΌ = 0 .

The result then follows with y 1 = [ a ] and y 2 as above. ∎

Now, for π‘₯ a sequential element, we determine when w 0 ⁒ x ∈ I ⁒ ( W ) .

Lemma 5.8

Let x ∈ W be a sequential element. Then w 0 ⁒ x ∈ I ⁒ ( W ) if and only if x ∈ X .

Proof

Recall that, for π‘Š of type A n , conjugation by w 0 interchanges r i and r n + 1 βˆ’ i for i ∈ { 1 , … , ⌊ n 2 βŒ‹ } . Consequently, for x ∈ X , we have x w 0 = x βˆ’ 1 , and so w 0 ⁒ x ∈ I ⁒ ( W ) .

Let x ∈ W be a sequential element such that w 0 ⁒ x ∈ I ⁒ ( W ) . Then there exist a ∈ { 1 , … , n } and ΞΌ , Ξ» β‰₯ 0 such that x = [ a βˆ’ ΞΌ β†— a βˆ’ 1 , a + Ξ» β†˜ a ] . We calculate the possibilities for πœ‡ and πœ†. For w ∈ W , let J ⁒ ( w ) be the set containing i ∈ { 1 , … , n } exactly when [ i ] is in a reduced expression for 𝑀. Then

J ⁒ ( x ) = J ⁒ ( x βˆ’ 1 ) = J ⁒ ( x w 0 ) .

From max ⁑ J ⁒ ( x ) = a + Ξ» and max ⁑ J ⁒ ( x w 0 ) = n + 1 βˆ’ a + ΞΌ , we deduce that

Ξ» βˆ’ ΞΌ = n + 1 βˆ’ 2 ⁒ a .

Every reduced expression for π‘₯ begins with either [ a + Ξ» ] or [ a βˆ’ ΞΌ ] , so every reduced expression for x w 0 begins with either [ n + 1 βˆ’ a βˆ’ Ξ» ] or [ n + 1 βˆ’ a + ΞΌ ] . Also, every reduced expression for π‘₯ ends in [ a ] , and so a reduced expression for x βˆ’ 1 begins with [ a ] . Hence n + 1 βˆ’ 2 ⁒ a ∈ { Ξ» , βˆ’ ΞΌ } . If n + 1 βˆ’ 2 ⁒ a = Ξ» , then ΞΌ = 0 and so x = [ ( n + 1 βˆ’ a ) β†˜ a ] . If n + 1 βˆ’ 2 ⁒ a = βˆ’ ΞΌ , then Ξ» = 0 and so x = [ ( a βˆ’ ΞΌ ) β†— ( n + 1 βˆ’ ( a βˆ’ ΞΌ ) ) ] . Therefore, x ∈ X , proving the lemma. ∎

We can now prove the main result of this subsection.

Proof of Lemma 5.6

Let x ∈ W with w 0 ⁒ x ∈ I ⁒ ( W ) . By Lemmas 5.7 and 5.8, either x ∈ X or there exist distinct elements y 1 , y 2 ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . Therefore, if x βˆ‰ X , then w 0 ⁒ x is not pendant.

Let x = [ ( n + 1 βˆ’ i ) β†˜ i ] and w ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . Then β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( w ) by Lemma 5.1. Therefore, w ∈ { 1 , [ i ] , [ i , ( i + 1 ) ] , … , [ i β†— ( n + 1 βˆ’ i ) ] } , and since w ∈ I ⁒ ( W ) , it follows that w = [ i ] . The argument for x = [ i β†— ( n + 1 βˆ’ i ) ] is similar. ∎

5.2 π‘Š of type D n with 𝑛 odd

In this subsection, we suppose that π‘Š is of type D n with 𝑛 odd, and fix the following set of elements of π‘Š:

L = { [ 1 ] , [ 2 ] , … , [ n βˆ’ 2 ] , [ n , n βˆ’ 2 , n βˆ’ 1 ] , [ n βˆ’ 1 , n βˆ’ 2 , n ] } .

The next lemma is the main result of this subsection.

Lemma 5.9

Let n β‰₯ 5 . Then the pendant elements in E 0 ⁒ ( W ) are w 0 ⁒ y for y ∈ L , with Ξ” 1 ⁒ ( w 0 ⁒ [ i ] ) = { [ i ] } ,

Ξ” 1 ⁒ ( w 0 ⁒ [ n , n βˆ’ 2 , n βˆ’ 1 ] ) = { [ n βˆ’ 1 ] } , Ξ” 1 ⁒ ( w 0 ⁒ [ n βˆ’ 1 , n βˆ’ 2 , n ] ) = { [ n ] }

for i ∈ { 1 , … , n βˆ’ 2 } .

Recall that conjugating by w 0 interchanges [ n βˆ’ 1 ] and [ n ] , and fixes all the other [ i ] . Let J = { 1 , … , n βˆ’ 1 } . Then W J is a parabolic subgroup of π‘Š of type A n βˆ’ 1 . For the remainder of this section, fix x ∈ W βˆ– L such that w 0 ⁒ x ∈ I ⁒ ( W ) . By Lemma 2.4, there exist u ∈ X J and v ∈ W J such that

x = u ⁒ v with ⁒ β„“ ⁒ ( x ) = β„“ ⁒ ( u ) + β„“ ⁒ ( v ) .

We begin with a preliminary lemma. We will use the shorthand [ … , i 1 , i 2 , … , i j ] to mean a reduced expression ending with r i 1 ⁒ r i 2 ⁒ β‹― ⁒ r i j .

Lemma 5.10

The following statements hold.

  1. If β„“ ⁒ ( u ) β‰₯ 1 , then u = [ … , n ] . If β„“ ⁒ ( u ) β‰₯ 2 , then u = [ … , n βˆ’ 2 , n ] .

  2. Suppose that x = [ r ] ⁒ z with r ∈ R and z ∈ W is a reduced expression for π‘₯. Then π‘₯ also has a reduced expression ( z w 0 ) βˆ’ 1 ⁒ [ r w 0 ] .

  3. If v ∈ W J βˆ– { n βˆ’ 1 } , then u β‰  [ n ] .

  4. If u = 1 , then x = v ∈ I ⁒ ( W J βˆ– { n βˆ’ 1 } ) .

Proof

Part (i) follows from [3, Algorithm B, Β§2.1]. For (ii), we have

[ r w 0 ] ⁒ z w 0 = x w 0 = x βˆ’ 1

and so x = ( z w 0 ) βˆ’ 1 ⁒ [ r w 0 ] .

Suppose that u = [ n ] , and so x = [ n ] ⁒ v . Then, as v ∈ W J βˆ– { n βˆ’ 1 } , by (ii), we have x = v βˆ’ 1 ⁒ [ n βˆ’ 1 ] ∈ W J , forcing [ n ] ∈ W J , a contradiction. So (iii) holds.

Assume that x = v βˆ‰ W J βˆ– { n βˆ’ 1 } . Then we may write

x = c ⁒ [ n βˆ’ 1 ] ⁒ e , where ⁒ c , e ∈ W J βˆ– { n βˆ’ 1 }

(see [3, Example 2.2.4]). Now x βˆ’ 1 = x w 0 = c ⁒ [ n ] ⁒ e , whence, as x βˆ’ 1 ∈ W J , we get [ n ] ∈ W J , a contradiction. Thus x = v ∈ W J βˆ– { n βˆ’ 1 } and then x βˆ’ 1 = x w 0 = x means x ∈ I ⁒ ( W J βˆ– { n βˆ’ 1 } ) . ∎

Lemma 5.11

Suppose that v = 1 (so x = u ). Then π‘₯ has a reduced expression of the form b ⁒ [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 1 , n βˆ’ 2 , n ] for some b ∈ W . In particular,

[ n ] , [ n βˆ’ 3 , n βˆ’ 1 ] [ n βˆ’ 2 , n ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) .

Proof

The analogue of Theorem 2.5 for distinguished left coset representatives gives that x = b ⁒ a , where either (i) a ∈ { [ n ] , [ n βˆ’ 1 , n βˆ’ 2 , n ] } and b ∈ W { 1 , … , n βˆ’ 2 } ; or (ii) a = [ n , n βˆ’ 2 , n βˆ’ 3 , n βˆ’ 1 , n βˆ’ 2 , n ] . Suppose for a contradiction that (i) holds.

By assumption, x βˆ‰ L βŠ‡ { [ n ] , [ n βˆ’ 1 , n βˆ’ 2 , n ] } , so b β‰  1 . From w 0 ⁒ x ∈ I ⁒ ( W ) , it follows that x w 0 = x βˆ’ 1 , and consequently, by Lemma 2.4 (ii), x w 0 is a distinguished right coset representative for W J in π‘Š. However, b ∈ W R βˆ– { n βˆ’ 1 , n } , and so x w 0 = b w 0 ⁒ a w 0 = b ⁒ a w 0 cannot be such a distinguished right coset representative. Therefore, alternative (ii) must hold, which proves the lemma. ∎

Lemma 5.12

Either we have | Ξ” 1 ⁒ ( w 0 ⁒ x ) | β‰₯ 2 or 𝑣 is a sequential element of W J and β„“ ⁒ ( u ) β‰₯ 1 (so u = [ … , n ] ).

Proof

If v = 1 , then we have | Ξ” 1 ⁒ ( w 0 ⁒ x ) | β‰₯ 2 by Lemma 5.11. If u = 1 , then v ∈ I ⁒ ( W J βˆ– { n βˆ’ 1 } ) by Lemma 5.10 (iv). In particular, v β‰  [ n βˆ’ 1 ] , [ n ] , which combined with v = x βˆ‰ L implies that v ∈ I ⁒ ( W ) βˆ– R . By Lemma 2.3, there exists r ∈ R such that β„“ ⁒ ( v ⁒ r ) = β„“ ⁒ ( v ) βˆ’ 1 . Thus, by Lemma 5.1, 𝑣 and π‘Ÿ are distinct elements of Ξ” 1 ⁒ ( w 0 ⁒ x ) . Hence we may assume that u , v β‰  1 , and so the result follows by Lemmas 5.1 and 5.7. ∎

Lemma 5.13

If x βˆ‰ L and w 0 ⁒ x ∈ I ⁒ ( W ) , then | Ξ” 1 ⁒ ( w 0 ⁒ x ) | β‰₯ 2 .

Proof

By Lemma 5.12, we may assume that 𝑣 is a sequential element of W J and u = [ … , n ] . So, for some a ∈ { 1 , … , n βˆ’ 1 } and Ξ» , ΞΌ β‰₯ 0 , we have

x = [ … , n , a βˆ’ ΞΌ β†— a βˆ’ 1 , a + Ξ» β†˜ a ] .

We split into four cases: (i) v ∈ W R βˆ– { n βˆ’ 1 } ; (ii) a = n βˆ’ 2 ; (iii) a = n βˆ’ 1 and ΞΌ β‰₯ 1 ; and (iv) a ≀ n βˆ’ 3 and a + Ξ» ∈ { n βˆ’ 1 , n βˆ’ 2 } .

In case (i), the elements 𝑣 and [ n ] commute, and hence [ a ] , [ n ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) .

Suppose (ii) holds. Then Ξ» ∈ { 0 , 1 } . If Ξ» = 0 , then u β‰  [ n ] by Lemma 5.10 (iii). If Ξ» = 1 , then u β‰  [ n ] since it can be checked that [ n ] ⁒ v ⁒ ( [ n ] ⁒ v ) w 0 β‰  1 . Therefore, u = [ … , n βˆ’ 2 , n ] by Lemma 5.10 (i). The result then follows with Ξ” 1 ⁒ ( w 0 ⁒ x ) containing [ n βˆ’ 2 ] and one of the following:

{ [ n ] [ n βˆ’ 2 ] if ⁒ Ξ» = 0 , ΞΌ = 0 , [ n , n βˆ’ 3 ] [ n βˆ’ 2 ] if ⁒ Ξ» = 0 , ΞΌ β‰₯ 1 , [ n , n βˆ’ 1 ] [ n βˆ’ 2 ] if ⁒ Ξ» = 1 , ΞΌ = 0 , [ n , n βˆ’ 3 , n βˆ’ 1 ] [ n βˆ’ 2 ] if ⁒ Ξ» = 1 , ΞΌ β‰₯ 1 .

Next assume that (iii) holds. If ΞΌ = 1 , then v = [ n βˆ’ 2 , n βˆ’ 1 ] . Since

x βˆ‰ L βŠ‡ { [ n , n βˆ’ 2 , n βˆ’ 1 ] } ,

Lemma 5.10 (i) implies that

x = [ … , n βˆ’ 2 , n ] ⁒ [ n βˆ’ 2 , n βˆ’ 1 ] = [ … , n , n βˆ’ 2 , n , n βˆ’ 1 ] .

Hence [ n βˆ’ 1 ] , [ n ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . If ΞΌ β‰₯ 2 , then by Lemma 2.5 applied to u βˆ’ 1 , either u = [ … , n βˆ’ 1 , n βˆ’ 2 , n ] or u = b ⁒ [ n ] with b ∈ W { 1 , … , n βˆ’ 2 } . In the first case,

x = [ … , n βˆ’ 1 , n βˆ’ 2 , n , n βˆ’ 1 βˆ’ ΞΌ β†— n βˆ’ 1 ] = [ … , n βˆ’ ΞΌ βˆ’ 1 β†— n βˆ’ 4 , n βˆ’ 1 , n βˆ’ 2 , n , n βˆ’ 3 , n βˆ’ 2 , n βˆ’ 1 ] ,

and so [ n βˆ’ 1 ] , [ n βˆ’ 3 , n ] [ n βˆ’ 2 , n βˆ’ 1 ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . In the second, either b = 1 or there exists k ∈ { 1 , … , n βˆ’ 2 } such that β„“ ⁒ ( [ k ] ⁒ b ) = β„“ ⁒ ( b ) βˆ’ 1 . Thus, by Lemma 5.10 (ii), Ξ” 1 ⁒ ( w 0 ⁒ x ) contains [ n βˆ’ 1 ] , [ n βˆ’ ΞΌ βˆ’ 1 ] if b = 1 , and [ n βˆ’ 1 ] , [ k ] otherwise.

Finally, assume that (iv) holds. If we have a + Ξ» = n βˆ’ 2 or a + Ξ» = n βˆ’ 1 and u = [ … , n βˆ’ 1 , n βˆ’ 2 , n ] , then it can be checked that [ n ] , [ a ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . Hence we may assume that a + Ξ» = n βˆ’ 1 and by applying Lemma 2.5 to u βˆ’ 1 that u = b ⁒ [ n ] for some b ∈ W { 1 , … , n βˆ’ 2 } . Therefore, there exists k ∈ { 1 , … , n βˆ’ 2 , n } such that β„“ ⁒ ( [ k ] ⁒ u ) = β„“ ⁒ ( u ) βˆ’ 1 . By Lemma 5.10 (ii), [ k ] , [ a ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) . Thus if k β‰  a , then the result follows. Hence assume that k = a and, by [3, Algorithm B], u = [ … , a β†— n βˆ’ 2 , n ] . Hence

x = [ … , a β†— n βˆ’ 2 , n , a βˆ’ ΞΌ β†— a βˆ’ 1 , n βˆ’ 1 β†˜ a ] = [ … , a βˆ’ ΞΌ β†— a βˆ’ 2 , a β†— n βˆ’ 2 , n , a βˆ’ 1 , n βˆ’ 1 β†˜ a ] = [ … , a βˆ’ ΞΌ β†— a βˆ’ 2 ] ⁒ [ n , a βˆ’ 1 , n βˆ’ 1 ] [ n βˆ’ 1 β†˜ a ] .

Thus [ a ] , [ n , a βˆ’ 1 , n βˆ’ 1 ] [ n βˆ’ 1 β†˜ a ] ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) , completing the result. ∎

Proof of Lemma 5.9

Let x ∈ W be such that w 0 ⁒ x ∈ I ⁒ ( W ) . If x βˆ‰ L , then it follows by Lemmas 5.12 and 5.13 that | Ξ” 1 ⁒ ( w 0 ⁒ x ) | β‰₯ 2 .

For w 0 ⁒ x with x ∈ { [ 1 ] , … , [ n βˆ’ 2 ] } , the result follows by Lemma 5.2. Let

x = [ n , n βˆ’ 2 , n βˆ’ 1 ] and w ∈ Ξ” 1 ⁒ ( w 0 ⁒ x ) .

By Lemma 5.1, β„“ ⁒ ( x ⁒ w ) = β„“ ⁒ ( x ) βˆ’ β„“ ⁒ ( w ) , and so

w ∈ I ⁒ ( ⟨ [ n βˆ’ 2 ] , [ n βˆ’ 1 ] , [ n ] ⟩ ) = { [ n βˆ’ 2 ] , [ n βˆ’ 1 ] , [ n ] , [ n βˆ’ 2 , n βˆ’ 1 , n βˆ’ 2 ] , [ n βˆ’ 2 , n , n βˆ’ 2 ] } .

It is easily checked that [ n βˆ’ 1 ] is the only possibility for 𝑀. For [ n βˆ’ 1 , n βˆ’ 2 , n ] , the result follows similarly, and so the lemma holds. ∎

Proofs of Theorem 1.6 and Corollary 1.7

Finite irreducible Coxeter groups with non-trivial centre are covered by Lemma 5.3. The remaining cases are type A n , type D n with 𝑛 odd, type E 6 and type I 2 ⁒ ( m ) with π‘š odd. These are resolved, respectively, by Lemmas 5.6, 5.9, 5.4 and 5.5. ∎

6 Exceptional finite Coxeter groups

Many of the results in this paper had their origins in extensive Magma calculations which revealed unexpected patterns in the structure of their excess zero graphs. In order to facilitate future research on these graphs, we have included in Table 2 the valency data for four of the small exceptional finite Coxeter groups.

Table 2

Valency distribution for small exceptional groups

Group Valency distribution
W ⁒ ( H 3 ) 0 1 ⁒ .1 3 ⁒ .2 4 ⁒ .3 5 ⁒ .4 4 ⁒ .5 5 ⁒ .7 2 ⁒ .8 2 ⁒ .9 2 ⁒ .15 3

W ⁒ ( H 4 ) 0 1 ⁒ .1 4 ⁒ .2 8 ⁒ .3 12 ⁒ .4 23 ⁒ .5 23 ⁒ .6 27 ⁒ .7 26 ⁒ .8 38 ⁒ .9 24 ⁒ .10 19 ⁒ .11 23 ⁒ .12 25 ⁒ .13 22 ⁒ .14 30 .
15 30 ⁒ .16 16 ⁒ .17 14 ⁒ .18 18 ⁒ .19 12 ⁒ .20 7 ⁒ .21 15 ⁒ .22 10 ⁒ .23 5 ⁒ .24 11 ⁒ .25 8 ⁒ .26 5 ⁒ .27 8 .
28 7 ⁒ .29 3 ⁒ .30 5 ⁒ .31 6 ⁒ .32 4 ⁒ .33 5 ⁒ .34 3 ⁒ .35 2 ⁒ .36 3 ⁒ .37 1 ⁒ .38 2 ⁒ .39 3 ⁒ .40 1 ⁒ .42 3 ⁒ .43 4 .
44 1 ⁒ .45 2 ⁒ .46 2 ⁒ .47 2 ⁒ .48 2 ⁒ .49 1 ⁒ .50 5 ⁒ .51 1 ⁒ .54 3 ⁒ .55 1 ⁒ .59 1 ⁒ .61 2 ⁒ .62 3 ⁒ .63 1 ⁒ .65 2 .
70 1 ⁒ .71 1 ⁒ .79 1 ⁒ .81 1 ⁒ .82 1 ⁒ .83 1 ⁒ .87 2 ⁒ .89 2 ⁒ .97 2 ⁒ .99 1 ⁒ .119 1 ⁒ .122 1 ⁒ .137 2 ⁒ .143 3 .
173 2 ⁒ .285 4

W ⁒ ( F 4 ) 0 1 ⁒ .1 4 ⁒ .2 8 ⁒ .3 9 ⁒ .4 17 ⁒ .5 11 ⁒ .6 9 ⁒ .7 9 ⁒ .8 10 ⁒ .9 13 ⁒ .10 2 ⁒ .11 6 ⁒ .12 4 ⁒ .13 4 ⁒ .14 4 ⁒ .15 2 ⁒ .17 4 .
18 1 ⁒ .19 2 ⁒ .21 2 ⁒ .23 2 ⁒ .25 2 ⁒ .29 2 ⁒ .30 2 ⁒ .34 3 ⁒ .37 2 ⁒ .69 4

W ⁒ ( E 6 ) 0 1 ⁒ .1 6 ⁒ .2 14 ⁒ .3 34 ⁒ .4 35 ⁒ .5 33 ⁒ .6 15 ⁒ .7 56 ⁒ .8 30 ⁒ .9 58 ⁒ .10 25 ⁒ .11 52 ⁒ .12 17 ⁒ .13 28 ⁒ .14 19 .
15 25 ⁒ .16 25 ⁒ .17 24 ⁒ .18 11 ⁒ .19 40 ⁒ .20 15 ⁒ .21 16 ⁒ .22 5 ⁒ .23 9 ⁒ .24 12 ⁒ .25 13 ⁒ .26 13 ⁒ .27 18 .
28 14 ⁒ .29 7 ⁒ .30 11 ⁒ .31 6 ⁒ .32 4 ⁒ .33 14 ⁒ .35 3 ⁒ .36 2 ⁒ .37 11 ⁒ .38 12 ⁒ .39 6 ⁒ .40 2 ⁒ .41 6 ⁒ .43 13 .
44 9 ⁒ .45 5 ⁒ .46 7 ⁒ .47 7 ⁒ .49 1 ⁒ .50 2 ⁒ .51 2 ⁒ .53 2 ⁒ .54 4 ⁒ .56 2 ⁒ .58 2 ⁒ .59 4 ⁒ .62 2 ⁒ .68 3 ⁒ .69 1 .
70 2 ⁒ .71 2 ⁒ .72 4 ⁒ .73 2 ⁒ .74 2 ⁒ .75 1 ⁒ .77 4 ⁒ .80 2 ⁒ .82 10 ⁒ .89 9 ⁒ .91 1 ⁒ .95 2 ⁒ .118 6 ⁒ .137 1 .
141 2 ⁒ .155 7 ⁒ .171 5 ⁒ .227 10 ⁒ .445 6

Acknowledgements

This work was begun during a visit to the Mathematisches Forschungsinstitut Oberwolfach, as part of their Oberwolfach Research Fellows program, and completed with funding from the Manchester Institute of Mathematical Sciences. The second author was funded by the Heilbronn Institute for Mathematical Research.

  1. Communicated by: Andrea Lucchini

References

[1] W. Bosma, J. Cannon and C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), 235–265. 10.1006/jsco.1996.0125Search in Google Scholar

[2] R. W. Carter, Conjugacy classes in the Weyl group, Compos. Math. 25 (1972), 1–59. Search in Google Scholar

[3] M. Geck and G. Pfeiffer, Characters of Finite Coxeter Groups and Iwahori–Hecke algebras, London Math. Soc. Monogr. (N. S.) 21, Oxford University, New York, 2000. 10.1093/oso/9780198502500.001.0001Search in Google Scholar

[4] M. Hansson and A. Hultman, A word property for twisted involutions in Coxeter groups, J. Combin. Theory Ser. A 161 (2019), 220–235. 10.1016/j.jcta.2018.07.006Search in Google Scholar

[5] S. B. Hart and P. J. Rowley, Involution products in Coxeter groups, J. Group Theory 14 (2011), no. 2, 251–259. 10.1515/jgt.2010.053Search in Google Scholar

[6] S. B. Hart and P. J. Rowley, On cosets in Coxeter groups, Turkish J. Math. 36 (2012), no. 1, 77–93. 10.3906/mat-0909-65Search in Google Scholar

[7] S. B. Hart and P. J. Rowley, Zero excess and minimal length in finite Coxeter groups, J. Group Theory 15 (2012), no. 4, 497–512. 10.1515/jgt-2011-0115Search in Google Scholar

[8] S. B. Hart and P. J. Rowley, On excess in finite Coxeter groups, J. Pure Appl. Algebra 219 (2015), no. 5, 1657–1669. 10.1016/j.jpaa.2014.07.004Search in Google Scholar

[9] S. B. Hart and P. J. Rowley, Maximal length elements of excess zero in finite Coxeter groups, J. Group Theory 21 (2018), no. 5, 817–837. 10.1515/jgth-2018-0016Search in Google Scholar

[10] A. Hultman, The combinatorics of twisted involutions in Coxeter groups, Trans. Amer. Math. Soc. 359 (2007), no. 6, 2787–2798. 10.1090/S0002-9947-07-04070-6Search in Google Scholar

[11] J. E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge Stud. Adv. Math. 29, Cambridge University, Cambridge, 1990. 10.1017/CBO9780511623646Search in Google Scholar

[12] E. Marberg, Extending a word property for twisted Coxeter systems, Adv. Appl. Math. 145 (2023), Article ID 102477. 10.1016/j.aam.2022.102477Search in Google Scholar

Received: 2024-08-23
Revised: 2025-06-30
Published Online: 2025-08-15
Published in Print: 2026-01-01

Β© 2025 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 25.3.2026 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2024-0175/html
Scroll to top button