text:
# K(𝜋,1)’s for Artin Groups of Finite Type

## 1. Introduction.

This paper is a continuation of a programme to construct new K$`(\pi ,1)`$’s for Artin groups of finite type which began in  with Artin groups on $`2`$ and $`3`$ generators and was extended to braid groups in . These K$`(\pi ,1)`$’s differ from those in  in that their universal covers are simplicial complexes. In  a complex is constructed whose top-dimensional cells correspond to minimal factorizations of a Coxeter element as a product of reflections in a finite Coxeter group. Asphericity is established in low dimensions using a metric of non-positive curvature. Since the non-positive curvature condition is difficult to check in higher dimensions a combinatorial approach is used in  in the case of the braid groups. It is clear from  that the techniques used can be applied to any finite Coxeter group $`W`$. When $`W`$ is equipped with the partial order given by reflection length and $`\gamma `$ is a Coxeter element in $`W`$, the construction of the K$`(\pi ,1)`$’s is exactly analogous provided that the interval $`[I,\gamma ]`$ forms a lattice. In dimension $`3`$, see , establishing this condition amounts to observing that two planes through the origin meet in a unique line. In the braid group case, see , where the reflections are transpositions and the Coxeter element is an $`n`$-cycle this lattice property is established by identifying $`[I,\gamma ]`$ with the lattice of non-crossing partitions of $`\{1,2,\mathrm{},n\}`$. In this paper, we consider the Artin groups of type $`C_n`$ and $`D_n`$. Thus, for each finite reflection group $`W`$ of type $`C_n`$ or $`D_n`$, partially ordered by reflection length, we identify a lattice inside $`W`$ and use it to construct a finite aspherical complex $`K(W)`$. In the $`C_n`$ case this lattice coincides with the lattice of noncrossing partitions of $`\{1,2,\mathrm{},n,1,\mathrm{},n\}`$ studied in . The final ingredient is to prove that $`\pi _1(K(W))`$ is isomorphic to $`A(W)`$, the associated finite type Artin group. As in  and  this involves a lengthy check that the obvious maps between the two presentations are well-defined. David Bessis has independently obtained similar results which can be seen at . His approach exploits in a clever way the extra structure given by viewing these groups as complex reflection groups. In addition, he has verified that in the exceptional cases that the interval $`[I,\gamma ]`$ forms a lattice and that the corresponding poset groups are isomorphic to the respective Artin groups of finite type. Combined with the results of our section $`5`$ below this provides the new K$`(\pi ,1)`$’s in these cases and we thank him for drawing our attention to this fact.

In section 2 we collect some general facts about the reflection length function on finite reflection groups and the induced partial order. In section 3 we study the cube group $`C_n`$ and its index two subgroup $`D_n`$. In section 4 we identify the subposets of interest in $`C_n`$ and $`D_n`$ and show that they are lattices. In section 5 we define the poset group $`\mathrm{\Gamma }(W,\alpha )`$ associated to the interval $`[I,\alpha ]`$ for $`\alpha W`$. In the case where $`[I,\alpha ]`$ is a lattice we construct the complexes $`K(W,\alpha )`$ and show that they are K$`(\pi ,1)`$’s. Section 6 shows that the groups $`\mathrm{\Gamma }(C_n,\gamma _C)`$ and $`\mathrm{\Gamma }(D_n,\gamma _D)`$ are indeed the Artin groups of the appropriate type when $`\gamma _C`$ and $`\gamma _D`$ are the respective Coxeter elements.

## 2. A partial order on finite reflection groups.

Let $`W`$ be a finite reflection group with reflection set $``$ and identity element $`I`$. We let $`d:W\times W𝐙`$ be the distance function in the Cayley graph of $`W`$ with generating set $``$ and define the *reflection length function* $`l:W𝐙`$ by $`l(w)=d(I,w)`$. So $`l(w)`$ is the length of the shortest product of reflections yielding the element $`w`$. It follows from the triangle inequality for $`d`$ that $`l(w)l(u)+l(u^1w)`$ for any $`u,wW`$.

###### Definition 2.1.

We introduce the relation $``$ on $`W`$ by declaring

$$uwl(w)=l(u)+l(u^1w).$$

Thus $`uw`$ if and only if there is a geodesic in the Cayley graph from $`I`$ to $`w`$ which passes through $`u`$. Alternatively, equality occurs if and only if there is a shortest factorisation of $`u`$ as a product of reflections which is a prefix of a shortest factorisation of $`w`$. It is readily shown that $``$ is reflexive, antisymmetric and transitive so that $`(W,)`$ becomes a partially ordered set. Since $`(u^1w)^1w=w^1uw`$ is conjugate to $`u`$ it follows that $`u^1ww`$ whenever $`uw`$. Furthermore, whenever $`\alpha \beta \gamma `$ we have

$$l(\gamma )=l(\alpha )+(l(\alpha ^1\beta )+l(\beta ^1\gamma )),$$

so that $`\alpha ^1\beta \alpha ^1\gamma `$. We recall some general facts about orthogonal transformations from . If $`AO(n)`$, we associate to $`A`$ two subspaces of $`𝐑^n`$ , namely

$$M(A)=\text{im}(AI)\text{ and }F(A)=\text{ker}(AI).$$

We recall that $`M(A)^{}=F(A)`$. We use the notation $`|V|`$ for $`dim(V)`$ when $`V`$ is a subspace of $`𝐑^n`$. It is shown in  that

$$|M(AC)||M(A)|+|M(C)|$$

We define a partial order on $`O(n)`$ by

$$A_oB|M(B)|=|M(A)|+|M(A^1B)|$$

and we note that $`A_oB`$ if and only if $`M(B)=M(A)M(A^1B)`$. In particular $`A_oB`$ implies that $`M(A)M(B)`$ or equivalently $`F(B)F(A)`$. The main result we will use from  is that for each $`AO(n)`$ and each subspace $`V`$ of $`M(A)`$ there exists a unique $`BO(n)`$ with $`B_oA`$ and $`M(B)=V`$. Our finite reflection group $`W`$ is a subgroup of $`O(n)`$, so the results of  can be applied to the elements of $`W`$. We begin with a geometric interpretation of the length function $`l`$ on $`W`$.

###### Proposition 2.2.

$`l(\alpha )=|M(\alpha )|=n|F(\alpha )|`$, for $`\alpha W`$.

Proof. First note that the proposition holds when $`\alpha =I`$ so we will assume $`\alpha I`$ and let $`k=|M(\alpha )|>0`$. To establish the inequality $`l(\alpha )k`$ we show that $`\alpha `$ can be expressed as a product of $`k`$ reflections. We will use induction on $`k`$ noting that the case $`k=1`$ is immediate. Consider the subspace $`F(\alpha )^n`$. Recall from part (d) of Theorem 1.12 of  that the subgroup $`W^{}`$ of $`W`$ of elements which fix $`F(\alpha )`$ pointwise is generated by those reflections $`R`$ in $`W`$ satisfying $`F(\alpha )F(R)`$. Since $`\alpha I`$ there exists at least one such reflection $`R`$. Since $`M(A)=F(A)^{}`$ we have $`M(R)M(\alpha )`$. The unique orthogonal transformation induced on $`M(R)`$ by $`\alpha `$ must be $`R`$ by Corollary 3 of . Hence $`R_o\alpha `$ and

$$|M(R\alpha )|=|M(\alpha )||M(R)|=k1.$$

By induction $`R\alpha `$ can be expressed as a product of $`k1`$ reflections and hence there is an expression $`\alpha =R_1\mathrm{}R_k`$ for $`\alpha `$ as a product of $`k`$ reflections. We note that by construction each of these reflections $`R_i`$ satisfies $`M(R_i)M(\alpha )`$. To establish the other inequality suppose $`\alpha =S_1S_2\mathrm{}S_m`$ is an expression for $`\alpha `$ as a product of $`m`$ reflections realizing $`l(\alpha )=m`$. Repeated use of the identity $`|M(AC)||M(A)|+|M(C)|`$ gives

$$k=|M(\alpha )||M(S_1)|+\mathrm{}+|M(S_m)|=m=l(\alpha ).\text{q.e.d.}$$

In particular the partial order $``$ on $`W`$ is a restriction of the partial order $`_o`$ on $`O(n)`$ and we will drop the subscript from $`_o`$ from now on. The following lemma is immediate.

###### Lemma 2.3.

Let $`W`$ be a finite Coxeter group with reflection set $``$ and let $`W_1`$ be a subgroup generated by a subset $`_1`$ of $``$. Then the length function for $`W_1`$ is equal to the restriction to $`W_1`$ of the length function for $`W`$.

###### Definition 2.4.

For each $`\delta W`$ we define the reflection set of $`\delta `$, $`S_\delta `$, by $`S_\delta =\{Rr\delta \}`$.

Repeated application of $`AB|M(B)|=|M(A)|+|M(A^1B)|`$ gives $`M(\delta )=\text{Span}\{M(R)R\delta \}`$ so that $`S_\delta `$ determines $`M(\delta )`$. However, in the case where $`\delta \gamma `$, $`\delta `$ itself is determined by $`\gamma `$ and $`S_\delta `$ since $`\delta `$ is the unique orthogonal transformation induced on $`M(\delta )`$ by $`\gamma `$. The following results are consequences of this fact.

###### Lemma 2.5.

If $`\alpha ,\beta \gamma `$ in $`W`$ and $`S_\alpha S_\beta `$ then $`\alpha \beta `$.

Proof. $`M(\alpha )M(\beta )M(\gamma )`$ and by uniqueness the transformation induced on $`M(\alpha )`$ by $`\beta `$ is the same as the transformation induced by $`\gamma `$, namely $`\alpha `$. q.e.d.

###### Lemma 2.6.

Suppose $`\alpha ,\beta \gamma `$ in $`W`$. If there is an element $`\delta W`$ with $`\delta \gamma `$ and $`S_\delta =S_\alpha S_\beta `$ then $`\delta `$ is the greatest lower bound of $`\alpha `$ and $`\beta `$ in $`W`$, that is, if $`\tau W`$ satisfies $`\tau \alpha ,\beta `$ then $`\tau \delta `$.

## 3. The Cube groups $`C_n`$ and $`D_n`$.

For general facts about the groups $`C_n`$ and $`D_n`$ see  or . Let $`I=[1,1]`$ and let $`C_n`$ denote the group of isometries of the cube $`I^n`$ in $`^n`$. That is

$$C_n=\{\alpha O(n):\alpha (I^n)=I^n\}$$

Let $`e_1,\mathrm{},e_n`$ denote the standard basis for $`^n`$ and let $`x_1,\mathrm{},x_n`$ denote the corresponding coordinates. The set $`_c`$ of all reflections in $`C_n`$ consists of the following $`n^2`$ elements. For each $`i=1,\mathrm{},n`$, reflection in the hyperplane $`x_i=0`$ is denoted $`[i]`$ and also by $`[i]`$. For each $`ij`$, reflection in the hyperplane $`x_i=x_j`$ is denoted by any one of the four expressions $`((i,j))`$, $`((j,i))`$, $`((i,j))`$ and $`((j,i))`$, while reflection in the plane $`x_i=x_j`$ is denoted by any one of the four expressions $`((i,j))`$, $`((i,j))`$, $`((j,i))`$, and $`((j,i))`$. The set of these $`n(n1)`$ reflections, in hyperplanes of the form $`x_i=\pm x_j`$, is denoted $`_d`$ and the subgroup they generate, $`D_n`$, is well known to be an index two subgroup of $`C_n`$. The group $`C_n`$ acts on the set $`\{e_1,\mathrm{},e_n,e_1,\mathrm{},e_n\}`$ in the obvious manner and this action satisfies $`\alpha (e_i)=(\alpha e_i)`$ for each $`i`$ and each $`\alpha C_n`$. Thus we obtain an injective homomorphism $`p`$ from $`C_n`$ into the group $`\mathrm{\Sigma }_{2n}`$ of permutations of the set $`\{1,2,\mathrm{},n,1,2,\mathrm{},n\}`$. Note that for each $`i`$, $`p([i])`$ is a transposition in $`\mathrm{\Sigma }_{2n}`$, while each element of $`_d`$ is mapped to a product of two disjoint transpositions. Thus $`p(D_n)`$ is contained in the subgroup of even permutations.

For each cycle $`c=(i_1,\mathrm{},i_r)`$ in $`\mathrm{\Sigma }_{2n}`$, we define the cycle $`\overline{c}`$ by

$$\overline{c}=(i_1,\mathrm{},i_r)$$

Note that $`\overline{c}=z_0cz_0`$ where $`z_0=(1,1)(2,2)\mathrm{}(n,n)`$ has order two. Note also that $`z_0=p(\zeta _0)`$ where $`\zeta _0=[1][2]\mathrm{}[n]`$ is the nontrivial element in the centre of $`C_n`$.

###### Proposition 3.1.

The image $`p(C_n)`$ is the centraliser $`Z(z_0)`$ of $`z_0`$ in $`\mathrm{\Sigma }_{2n}`$. It consists of all products of disjoint cycles of the form

(1)
$$c_1\overline{c}_1\mathrm{}c_k\overline{c}_k\gamma _1\mathrm{}\gamma _r\text{ where }\gamma _j=\overline{\gamma }_jj=1,\mathrm{},r.$$

The image $`p(D_n)`$ consists of all elements of the form (1) with $`r`$ even.

Proof. Since $`z_0`$ has order $`2`$ and $`z_0c_1c_2\mathrm{}c_kz_0=\overline{c}_1\overline{c}_2\mathrm{}\overline{c}_k`$ for any product of cycles in $`\mathrm{\Sigma }_{2n}`$, it follows that the centraliser $`Z(z_0)`$ consists of those products of disjoint cycles $`c_1c_2\mathrm{}c_k`$ for which

$$c_1c_2\mathrm{}c_k=\overline{c}_1\overline{c}_2\mathrm{}\overline{c}_k$$

By uniqueness (up to reordering) of cycle decomposition in $`\mathrm{\Sigma }_{2n}`$, for each $`i`$ either $`c_i=\overline{c}_j`$ for some $`ji`$ or else $`c_i=\overline{c}_i`$. It follows that the centraliser of $`z_0`$ is precisely the set of elements in $`\mathrm{\Sigma }_{2n}`$ of the form (1).

For each $`\alpha C_n`$, the identity $`\zeta _0\alpha \zeta _0=\alpha `$ implies that $`p(\alpha )`$ lies in the centraliser of $`z_0`$. Thus $`p(C_n)Z(z_0)`$. In the reverse direction, if $`c=(i_1,\mathrm{},i_k)`$ is disjoint from $`\overline{c}`$, one may readily verify that

(2)
$$c\overline{c}=p\left(((i_1,i_2))((i_2,i_3))\mathrm{}((i_{q1},i_q))\right)$$

Likewise, if $`c=\overline{c}`$ then $`c`$ must be the form $`c=(i_1,\mathrm{},i_k,i_1,\mathrm{},i_k)`$ for some $`ni_1,i_2,\mathrm{},i_kn`$ and one may verify that

(3) $`c`$ $`=`$ $`(i_1,i_1)(i_1,i_2)(i_1,i_2)\mathrm{}(i_{k1},i_k)(i_{k1},i_k)`$
(4) $`=`$ $`p\left([i_1]((i_1,i_2))\mathrm{}((i_{k1},i_k))\right)`$
It follows that any element of the form (1) lies in $`p(C_n)`$ and hence $`p(C_n)=Z(z_0)`$.

Let $`\alpha D_n`$ and write $`p(\alpha )=c_1\overline{c}_1\mathrm{}c_a\overline{c}_a\gamma _1\mathrm{}\gamma _b`$. Since $`p(\alpha )`$ and each $`c_i\overline{c}_i`$ is an even permutation while each $`\gamma _j`$ is an odd permutation, $`r`$ must be even. To show that every element of the form (1) with $`r`$ even is in $`p(D_n)`$, we need only note the following facts.

* If the cycle $`c`$ is disjoint from $`\overline{c}`$ then equation (2) implies that $`c\overline{c}p(D_n)`$.
* If $`ij`$ then $`[i][j]=((i,j))((i,j))`$ and hence is an element of $`p(D_n)`$. It now follows from equation (3) that if $`c_1=\overline{c}_1`$ and $`c_2=\overline{c}_2`$ are disjoint cycles then $`c_1c_2p(D_n)`$. q.e.d.

#### Notation

From now on we will identify $`C_n`$ and $`D_n`$ with their respective images in $`\mathrm{\Sigma }_{2n}`$. If a cycle $`c=(i_1,\mathrm{},i_k)`$ is disjoint from $`\overline{c}`$ then we write

$$((i_1,\mathrm{},i_k))=c\overline{c}=(i_1,\mathrm{},i_k)(i_1,\mathrm{},i_k)$$

and we call $`c\overline{c}`$ a *paired cycle*. If $`k=1`$ then $`c=(i_1)`$ and the paired cycle $`c\overline{c}=((i_1))`$ fixes the vector $`e_{i_1}`$. If $`c=\overline{c}=(i_1,\mathrm{},i_r,i_1,\mathrm{},i_r)`$ then we say that $`c`$ is a balanced cycle and we write

$$c=[i_1,\mathrm{},i_k].$$

This notation is consistent with that introduced earlier for the elements of the generating set $`_c`$. With these conventions, proposition 3.1 states that each element of $`C_n`$ may be written as a product of disjoint paired cycles and balanced cycles. If $`\alpha C_n`$ fixes the standard basis vector $`e_i`$ then we will assume that the paired cycle $`((i))`$ appears in the corresponding expression (1) for $`\alpha `$. Denote the length function for $`C_n`$ with respect to the generating set $`_c`$ by $`l`$. Lemma 2.3 allows us to use the same symbol $`l`$ for the length function of $`D_n`$ with respect to the set $`_d`$. The length function for $`\mathrm{\Sigma }_{2n}`$ with respect to the set $`T`$ of all transpositions is denoted by $`L`$.

###### Lemma 3.2.

The fixed space $`F(((i_1,\mathrm{},i_k)))`$ has dimension $`nk+1`$ and is given by

$$\{x^n:x_{i_1}=x_{i_2}=\mathrm{}=x_{i_k}\}$$

where $`x_i`$ means $`x_{|i|}`$ for $`i<0`$. The fixed space $`F([i_1,\mathrm{},i_k])`$ has dimension $`nk`$ and is given by

$$\{x^n:x_{i_1}=x_{i_2}=\mathrm{}=x_{i_k}=0\}$$

Proof. By inspection. q.e.d.

###### Lemma 3.3.

The $`l`$-length of a paired cycle $`c\overline{c}=((i_1,\mathrm{},i_k))`$ is $`k1`$. Moreover, no minimal length factorisation of $`c\overline{c}`$ as a product of elements of $`_c`$ contains a generator of the form $`[i]`$.

Proof. The fixed space $`F(c\overline{c})`$ has dimension $`nk+1`$ by lemma 3.2 and thus $`l(c\overline{c})=n(nk+1)=k1`$.

If a minimal $`l`$-length factorisation of $`c\overline{c}`$ contained a term of the form $`[i]`$, we would obtain a factorisation of $`c\overline{c}`$ as a product of fewer than $`2(k2)+1=2k3`$ transpositions. As $`L(c\overline{c})=2k2`$ this is impossible. q.e.d.

###### Lemma 3.4.

The $`l`$-length of $`\gamma =[j_1,\mathrm{},j_r]`$ as a product of elements of $`_c`$ is $`r`$. Moreover any minimal length factorisation of $`\gamma `$ as a product of elements of $`_c`$ contains exactly one generator of the form $`[i]`$.

Proof. As the fixed space $`F(\gamma )`$ is $`(nr)`$-dimensional by lemma 3.2, we find $`l(\gamma )=n(nr)=r`$.

As $`L(\gamma )=2r1`$, any factorisation of $`\gamma `$ as a product of $`r`$ elements of $`_c`$ can contain at most one generator of the form $`[i]`$. If such a factorisation contained no element of this form, we would have an expression for $`\gamma `$ as a product of an even number of transpositions. But this contradicts the fact that the $`2r`$-cycle $`\gamma `$ has odd parity in $`\mathrm{\Sigma }_{2n}`$. q.e.d.

###### Proposition 3.5.

If $`\alpha =c_1\overline{c}_1\mathrm{}c_a\overline{c}_a\gamma _1\mathrm{}\gamma _bC_n`$ is a product of disjoint cycles then

$$l(\alpha )=\underset{i=1}{\overset{a}{}}l(c_i\overline{c}_i)+\underset{j=1}{\overset{b}{}}l(\gamma _j)$$

Proof. By choosing a new basis from $`\{e_1,\mathrm{},e_n,e_1,\mathrm{},e_n\}`$ if necessary, we may assume that $`c_i=(j_{i1}+1,j_{i1}+2,\mathrm{},j_i)`$ and $`\gamma _i=[k_{i1}+1,k_{i1}+2,\mathrm{},k_i]`$ where $`1=j_0<j_1<\mathrm{}<j_a<j_a+1=k_0<k_1<\mathrm{}<k_b=n`$. Then $`c_i\overline{c}_i`$ (resp. $`\gamma _j`$) maps $`U_i=\mathrm{span}(e_{j_{i1}+1},e_{j_{i1}+2},\mathrm{},e_{j_i})`$ (resp. $`V_i=\mathrm{span}(e_{k_{i1}+1},e_{k_{i1}+2},\mathrm{},e_{k_i})`$) to itself and leaves all the other $`U`$’s and $`V`$’s pointwise fixed. As $`c_i\overline{c}_i`$ (resp. $`\gamma _j`$) fixes a $`1`$ (resp. $`0`$) dimensional subspace of $`U_i`$ (resp. $`V_j`$), we see that $`\alpha `$ fixes an $`a`$-dimensional subspace of $`^n`$. Therefore $`l(\alpha )=na`$. Since $`(1+l(c_i\overline{c}_i))+l(\gamma _j)=n`$ by lemmas 3.3 and 3.4, the result follows. q.e.d.

Consider now the effect of multiplying $`\alpha C_n`$ on the right by a reflection $`R=((i,j))`$ or $`R=[i]`$. It is clear that only those cycles which contain an integer of $`R`$ will be affected. The following example lists the possibilities and the corresponding changes in lengths.

###### Example 3.6.

The following four identities can be verified directly.

$`[i_1,i_2,\mathrm{},i_k][i_k]`$ $`=`$ $`((i_1,i_2,\mathrm{},i_k))`$
$`[i_1,i_2,\mathrm{},i_k]((i_j,i_k))`$ $`=`$ $`[i_1,\mathrm{},i_j]((i_{j+1},i_{j+2},\mathrm{},i_k))`$
$`((i_1,i_2,\mathrm{},i_k))((i_j,i_k))`$ $`=`$ $`((i_1,\mathrm{},i_j))((i_{j+1},i_{j+2},\mathrm{},i_k))`$
$`[i_1,\mathrm{},i_j][i_{j+1},\mathrm{},i_k]((i_j,i_k))`$ $`=`$ $`((i_1,i_2,\mathrm{},i_k))`$
Since each reflection has order $`2`$, the following identities are immediate.

$`[i_1,i_2,\mathrm{},i_k]`$ $`=`$ $`((i_1,i_2,\mathrm{},i_k))[i_k]`$
$`[i_1,i_2,\mathrm{},i_k]`$ $`=`$ $`[i_1,\mathrm{},i_j]((i_{j+1},i_{j+2},\mathrm{},i_k))((i_j,i_k))`$
$`((i_1,i_2,\mathrm{},i_k))`$ $`=`$ $`((i_1,\mathrm{},i_j))((i_{j+1},i_{j+2},\mathrm{},i_k))((i_j,i_k))`$
$`[i_1,\mathrm{},i_j][i_{j+1},\mathrm{},i_k]`$ $`=`$ $`((i_1,i_2,\mathrm{},i_k))((i_j,i_k))`$
By proposition 3.5, we see that

$`l([i_1,i_2,\mathrm{},i_n])`$ $`=`$ $`l(((i_1,i_2,\mathrm{},i_n)))+1`$
$`l([i_1,i_2,\mathrm{},i_n])`$ $`=`$ $`l([i_1,\mathrm{},i_j]((i_{j+1},i_{j+2},\mathrm{},i_n)))+1`$
$`l(((i_1,i_2,\mathrm{},i_n)))`$ $`=`$ $`l(((i_1,\mathrm{},i_j))((i_{j+1},i_{j+2},\mathrm{},i_n)))+1`$
$`l([i_1,\mathrm{},i_j][i_{j+1},\mathrm{},i_k])`$ $`=`$ $`l(((i_1,i_2,\mathrm{},i_k)))+1`$
###### Definition 3.7.

Let $`\sigma =c_1c_2\mathrm{}c_k`$ and $`\tau =d_1d_2\mathrm{}d_l`$ be two products of disjoint cycles in $`\mathrm{\Sigma }_{2n}`$. We say that $`\sigma `$ is contained in $`\tau `$ (and write $`\sigma \tau `$) if for each $`i`$ we can find $`j`$ such that the set of integers in the cycle $`c_i`$ is a subset of the set of integers in the cycle $`d_j`$. This notion restricts to give a notion of containment for elements of $`C_n`$.

A reflection $`((i,j))`$ is s-contained in $`\alpha =c_1\overline{c}_1\mathrm{}c_a\overline{c}_a\gamma _1\mathrm{}\gamma _bC_n`$ (and we write $`((i,j))\alpha `$) if $`i`$ is contained in $`\gamma _k`$ and $`j`$ is contained in $`\gamma _l`$ for some $`kl`$.

###### Lemma 3.8.

Let $`\alpha C_n`$ and $`R_c`$. Then $`R\alpha `$ if and only if $`R\alpha `$ or $`R\alpha `$.

Proof. By proposition 3.5 and the calculations in example 3.6 we see that $`l(\alpha R)<l(\alpha )`$ if and only if $`R\alpha `$ or $`R\alpha `$. Since $`R\alpha `$ if and only if $`l(\alpha R)<l(\alpha )`$, the lemma follows. q.e.d.

## 4. The lattice property

In this section we show that the interval $`[1,\gamma ]`$ in $`(W)`$ is a lattice for $`W=C_n,D_n`$ and $`\gamma `$ a Coxeter element in $`W`$. Since all Coxeter elements in $`W`$ are conjugate we can choose our favourite one in each case.

###### Definition 4.1.

We choose the Coxeter elements $`\gamma _C`$ in $`C_n`$ and $`\gamma _D`$ in $`D_n`$ given by $`\gamma _C=[1,2,\mathrm{},n]`$ and $`\gamma _D=[1][2,3,\mathrm{},n]`$.

###### Proposition 4.2.

Write the Coxeter element $`\gamma _CC_n`$ (resp. $`\gamma _DD_n`$) as $`\gamma _C=R_1R_2\mathrm{}R_n`$ (resp. $`\gamma _D=R_1R_2\mathrm{}R_n`$) for reflections $`R_1,\mathrm{},R_n`$ in $`_c`$ (resp. $`_d`$) and let $`b_i`$ denote the number of balanced cycles in $`R_1R_2\mathrm{}R_i`$. Then there exists $`i_0`$ such that $`b_i=0`$ for $`i<i_0`$ and $`b_i=1`$ (resp. $`b_i=2`$) for $`ii_0`$. In the $`D_n`$ case, if $`b_i=2`$ then one of the balanced cycles in $`R_1\mathrm{}R_i`$ must be $`[1]`$.

Proof. By example 3.6, if the multiplication of $`\alpha C_n`$ by $`R_c`$ increases the number of balanced cycles then $`l(\alpha R)=l(\alpha )+1`$ and $`\alpha R`$ contains either $`1`$ or $`2`$ balanced cycles more than $`\alpha `$. Conversely, if multiplication of $`\alpha `$ by $`R`$ decreases either the number of balanced cycles or the size of a balanced cycle, then $`l(\alpha R)=l(\alpha )1`$. Since $`l(R_1\mathrm{}R_i)+1=l(R_1\mathrm{}R_{i+1})`$ it follows that $`b_{i+1}b_i\{0,1,2\}`$. As $`\gamma _C`$ consists of a single balanced cycle, the claim for $`C_n`$ is immediate. For $`\gamma _D`$, none of the $`R_i`$ can be of the form $`[j]`$ and hence $`b_{i+1}b_i`$ cannot be $`1`$. As the passage from $`R_1\mathrm{}R_i`$ to $`R_1\mathrm{}R_{i+1}`$ cannot decrease the size of any balanced cycle and as $`\gamma _D`$ contains the balanced cycle $`[1]`$, this cycle must be present in $`R_1\mathrm{}R_i`$ for each $`ii_0`$. q.e.d.

###### Corollary 4.3.

If $`\alpha \gamma _C`$ in $`C_n`$ then $`\alpha `$ has at most one balanced cycle. If $`\beta \gamma _D`$ in $`D_n`$ then $`\beta `$ has either no balanced cycles or two balanced cycles. In the latter case, one of these balanced cycles is $`[1]`$.

### 4.1. The $`C_n`$ lattice.

Set $`\gamma =\gamma _C=[1,2,\mathrm{},n]`$.

###### Definition 4.4.

The action of $`\gamma `$ defines a cyclic order on the set $`A=\{1,\mathrm{},n,1,\mathrm{},n\}`$ in which the successor of $`i`$ is $`\gamma (i)`$ (thus $`1`$ is the successor of $`n`$). An ordered set of elements $`i_1,i_2,\mathrm{},i_s`$ in $`A`$ is oriented consistently (with the cyclic order on $`A`$) if there exist integers $`0<r_2<\mathrm{}<r_s2n1`$ such that $`i_j=\gamma ^{r_j}(i_1)`$ for $`j=2,\mathrm{},s`$. A cycle $`((i_1,\mathrm{},i_s))`$ or $`[i_1,\mathrm{},i_s]`$ is oriented consistently if the ordered set $`i_1,\mathrm{},i_s,i_1,\mathrm{},i_s`$ in $`A`$ is oriented consistently.

###### Definition 4.5.

Two disjoint reflections $`R_1=((i,j))`$ and $`R_2=((k,l))`$ (resp. $`R_2=[k]`$) are said to cross if one of the following four ordered sets is oriented consistently in $`A`$: $`i,k,j,l`$ or $`i,k,j,l`$ or $`k,i,l,j`$ or $`k,i,l,j`$ (resp. $`i,k,j,k`$ or $`i,k,j,k`$ or $`k,i,k,j`$ or $`k,i,k,j`$). Two disjoint cycles $`\zeta _1`$ and $`\zeta _2`$ in $`C_n`$ are said to cross if there exist crossing reflections $`R_1`$ and $`R_2`$ which are contained in $`\zeta _1`$ and $`\zeta _2`$ respectively. An element $`\sigma C_n`$ is called *crossing* if some pair of disjoint cycles of $`\sigma `$ cross. Otherwise $`\sigma `$ is *non-crossing*.

###### Proposition 4.6.

If $`\sigma C_n`$ satisfies $`\sigma \gamma `$ then the cycles of $`\sigma `$ are oriented consistently and are noncrossing.

Proof. We will proceed by induction on $`nl(\sigma )`$. If $`l(\sigma )=n`$ then $`\sigma =\gamma `$ and the two conditions of the conclusion are satisfied.

We assume therefore that the proposition is true for $`\tau C_n`$ with $`nl(\tau )=0,1,\mathrm{},k1`$ and that $`\sigma \gamma `$ satisfies $`l(\sigma )=nk`$. By definition there is an expression for $`\gamma `$ as a product of $`n`$ reflections $`\gamma =R_1R_2\mathrm{}R_{nk}RR_{nk+2}\mathrm{}R_n`$ with $`\sigma =R_1R_2\mathrm{}R_{nk}`$. We define $`\tau =\sigma R`$ so that $`l(\tau )=l(\sigma )+1`$ and $`\tau \gamma `$. By induction, the cycles of $`\tau `$ are noncrossing and oriented consistently with $`\gamma `$.

We know that $`R`$ is either of the form $`((i,j))`$ or $`[i]`$ and that $`R\tau \gamma `$. Lemma 3.8 thus implies that $`R`$ is contained in some paired cycle or some balanced cycle of $`\tau `$. The effect of multiplying this cycle by $`R`$ is thus described by one of the first three equations in Example 3.6. Since the cycles of $`\tau `$ are noncrossing and oriented consistently with $`\gamma `$, we see that the same is true for $`\sigma `$. q.e.d.

###### Proposition 4.7.

Let $`\sigma C_n`$. If the cycles of $`\sigma `$ are oriented consistently and are noncrossing then $`\sigma \gamma `$.

Proof. Assume that $`\sigma C_n`$ satisfies the two hypotheses of the proposition. Write $`\sigma =c_1\overline{c}_1\mathrm{}c_a\overline{c}_a\gamma _1\mathrm{}\gamma _b`$ and set $`t(\sigma )=a+b`$. We proceed by induction on $`t(\sigma )`$. If $`t(\sigma )=1`$ then either $`\sigma `$ consists of a single balanced cycle or a single paired cycle. In the former case, consistent orientation implies that $`\sigma =\gamma `$. In the latter case, consistent orientation implies that $`\sigma =((i,i+1,\mathrm{},n,1,\mathrm{},i+1))`$ for some $`i`$. As $`l(\sigma )=n1`$ and $`\sigma [i1]=\gamma `$, we see that $`\sigma \gamma `$. Assume now that $`t(\sigma )2`$ and that the proposition is true for each element $`\theta C_n`$ with $`t(\theta )<t(\sigma )`$. If $`\sigma `$ contains a balanced cycle, the non-crossing hypothesis implies that there can be only one which we denote $`\tau =[i_1,\mathrm{},i_r]`$. Otherwise let $`\tau =((i_1,\mathrm{},i_r))`$ be some paired cycle of $`\sigma `$. As $`\sigma \tau `$, there exists an $`i_k`$ whose successor does not lie in $`\{\pm i_1,\mathrm{},\pm i_r\}`$. By choosing one of the other $`2r1`$ cycle expressions for $`\tau `$ if necessary, we may assume that the successor $`j_1`$ of $`i_r`$ does not lie in $`\{\pm i_1,\mathrm{},\pm i_r\}`$. Let $`\rho =((j_1,\mathrm{},j_s))`$ be the paired cycle of $`\sigma `$ which contains $`j_1`$ and let $`R=((i_r,j_s))`$. Then $`\sigma =\tau \rho \sigma _1\mathrm{}\sigma _k`$ for some disjoint paired cycles $`\sigma _1,\mathrm{},\sigma _k`$ (some $`k0`$) and

$$\sigma R=\{\begin{array}{cc}[i_1,\mathrm{},i_r,j_1,\mathrm{},j_s]\sigma _1\mathrm{}\sigma _k\hfill & \text{ or}\hfill \\ ((i_1,\mathrm{},i_r,j_1,\mathrm{},j_s))\sigma _1\mathrm{}\sigma _k.\hfill & \end{array}$$

Note that $`t(\sigma R)=t(\sigma )1`$. As the cycles $`\tau `$ and $`\rho `$ do not cross and each is oriented consistently, our choice of $`j_1`$ ensures that the ordered set $`i_1,\mathrm{},i_r,j_1,\mathrm{},j_s,i_1,\mathrm{},i_r,j_1,\mathrm{},j_s`$ is also oriented consistently.

Assume now that one of the cycles $`\sigma _e`$ crosses the cycle $`\tau \rho R`$ of $`\sigma R`$. Then there exist crossing reflections $`R_1`$ and $`R_2`$ contained in $`\tau \rho R`$ and $`\sigma _e`$ respectively. Since $`\sigma _e`$ is paired, $`R_2`$ is necessarily paired; $`R_2=((c,d))`$ say. Since $`\sigma `$ is non-crossing, $`R_1`$ cannot be contained in $`\tau `$ or in $`\rho `$. There are three cases to consider

1. $`R_1=((i_a,j_b))`$ for some $`1ar`$ and $`1bs`$.
2. $`R_1=((j_b,j_b))`$ for some $`1bs`$ ($`\tau `$ is necesarily balanced ).
3. $`R_1=((i_a,j_b))`$ for some $`1bs`$ ($`\tau `$ is necesarily balanced ).

By a suitable choice of the representative $`R=((c,d))=((d,c))=((c,d))=((d,c))`$, the first case splits into two essential subcases: (a) the ordered set $`i_a,c,j_b,d`$ is oriented consistently and (b) the ordered set $`c,i_a,d,j_b`$ is oriented consistently. We know that $`c`$ is not in $`\{\pm i_1,\mathrm{},\pm i_r,\pm j_1,\mathrm{},\pm j_s\}`$. In particular $`ci_r,j_1`$. In case $`(1a)`$, if $`c`$ precedes $`i_r`$, then $`S=((i_1,i_r))`$ is contained in $`\tau `$ and crosses $`R_2`$, contradicting the fact that $`\sigma `$ is noncrossing. Likewise, if $`c`$ follows $`i_r`$ then $`c`$ follows $`j_1`$ and $`S=((j_1,j_b))`$ is contained in $`\rho `$ and crosses $`R_2`$, again contradicting the fact that $`\sigma `$ is non-crossing. Thus case $`(1a)`$ is impossible. A similar argument shows that case $`(1b)`$ is also impossible.

As in case $`1`$, case $`2`$ splits into two subcases: (a) the ordered set $`j_b,c,j_b,d`$ is oriented consistently and (b) the ordered set $`c,j_b,d,j_b`$ is oriented consistently. In case $`(2a)`$, if $`c`$ precedes $`i_r`$ then the ordered set $`i_r,j_b,c,i_r,d`$ is oriented consistently and hence $`((c,d))`$ crosses $`[i_r]\tau `$. But this contradicts the fact that $`\sigma `$ is non-crossing. If $`c`$ follows $`i_r`$, then $`c`$ necessarily succeeds $`j_1`$ and we find that the ordered set $`j_1,c,j_b,d`$ is consistently oriented. Thus $`((c,d))`$ crosses $`((j_1,j_b))\rho `$, again contradicting the fact that $`\sigma `$ is non-crossing. Thus case $`(2a)`$ is impossible. A similar argument shows that case $`(2b)`$ is also impossible.

Finally, case 3 also splits into two subcases: (a) the ordered set $`i_a,c,j_b,d`$ is oriented consistently and (b) the ordered set $`c,i_a,d,j_b`$ is oriented consistently. We show that $`(3b)`$ is impossible (the proof that case $`(3a)`$ is impossible is similar). We are given that the ordered set $`c,i_a,d,j_b`$ is oriented consistently. If $`d`$ precedes $`i_a`$ then $`((c,d))`$ crosses $`[i_a]`$ in $`\sigma `$, a contradiction. Therefore $`d`$ follows $`i_a`$. If $`d`$ now precedes $`i_r`$, then the ordered set $`c,i_a,d,i_r`$ is oriented consistently. Hence $`((i_a,i_r))`$ crosses $`((c,d))`$ in $`\sigma `$, a contradiction. Therefore $`d`$ follows $`i_r`$ and hence $`j_1`$. But now $`((j_1,j_b))`$ crosses $`((c,d))`$ in $`\sigma `$, a contradiction. Thus case $`(3b)`$ is impossible.

We conclude that the cycles $`\tau \rho R`$ and $`\sigma _e`$ do not cross. Since no two distinct elements of $`\sigma _1,\mathrm{},\sigma _k`$ cross (because $`\sigma `$ is assumed non-crossing), it follows that $`\sigma R`$ is non-crossing. As $`t(\sigma R)=t(\sigma )1`$ and the cycles of $`\sigma R`$ are oriented consistently, it follows by induction that $`\sigma R\gamma `$. Thus there exist reflections $`R_1,\mathrm{},R_k`$ with $`k=nl(\sigma R)`$ and

(5)
$$\sigma RR_1\mathrm{}R_k=\gamma $$

As $`l(\sigma R)=l(\sigma )+1`$ by lemmas 3.3 and 3.4 and proposition 3.5, we see that $`k+1=nl(\sigma )`$. Hence equation (5) also implies that $`\sigma \gamma `$. q.e.d.

###### Lemma 4.8.

If $`\sigma \gamma `$ and $`\tau \gamma `$ then $`\sigma \tau `$ if and only if $`\sigma \tau `$.

Proof. Follows from Lemma 2.5 and lemma 3.8. q.e.d. Combining the previous three results yields the following Theorem.

###### Theorem 4.9.

Let $`NCP`$ denote Reiner’s non-crossing partition lattice for the $`C_n`$ group from . The mapping

$$:\{\alpha C_n:\alpha \gamma \}NCP$$

which takes $`\alpha `$ to the noncrossing partition defined by its cycle structure is a bijective poset map. In particular, $`\{\alpha C_n:\alpha \gamma \}`$ is a lattice.

### 4.2. The $`D_n`$ lattice.

Set $`\gamma =\gamma _D=[1][2,3,\mathrm{},n]`$ and suppose $`\alpha \gamma `$. Recall from Corollary 4.3 that for such an $`\alpha `$ either $`[1][k]\alpha `$ for some $`k\{2,3,\mathrm{},n\}`$ or $`l`$ and $`l`$ are in different $`\alpha `$ orbits for all $`l\{1,2,\mathrm{},n\}`$. In the former case we will call $`\alpha `$ balanced and in the latter case we will call $`\alpha `$ paired. We note that lattices are associated to the groups $`C_n`$ and $`D_n`$ in . We have shown the Reiner $`C_n`$ lattices are isomorphic to ours. However the Reiner $`D_n`$ lattices are not the same as the ones we consider. In particular, the Reiner $`D_n`$ lattices are subposets of the Reiner $`C_n`$ lattices. To show that the interval $`[I,\gamma ]`$ in $`D_n`$ is a lattice we will compute $`\alpha \beta `$ for $`\alpha ,\beta \gamma `$. Since the poset is finite the existence of least upper bounds follows. We will consider different cases depending on the types of $`\alpha `$ and $`\beta `$. In all cases we will construct a candidate $`\sigma `$ for $`\alpha \beta `$ and show that $`\sigma D_n`$, $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$. Since the reverse inclusion is immediate it follows from Lemma 2.6 that $`\sigma =\alpha \beta `$.

###### Note 4.10.

In this section we will frequently pass between the posets determined by $`C_n`$, $`D_n`$ and several other finite reflection subgroups of $`C_n`$. As the partial order on each of these groups is the restriction of the partial order on $`O(n)`$, we can use the same symbol $``$ to denote the partial order in each case. The reflection subgroup in question should be clear from the context.

Suppose first that both $`\alpha `$ and $`\beta `$ are balanced. Since $`D_nC_n`$ and $`C_{n1}`$ can be identified with the subgroup of $`C_n`$ which fixes $`1`$, each balanced element of $`D_n`$ can be used to define a balanced element of $`C_{n1}`$, that is, an element containing a balanced cycle. Thus we define the balanced $`C_{n1}`$ elements $`\alpha ^{}`$ and $`\beta ^{}`$ by

$$\alpha =[1]\alpha ^{}\text{ and }\beta =[1]\beta ^{}$$

and the $`C_{n1}`$ element $`\sigma ^{}=\alpha ^{}\beta ^{}`$, where the meet is taken in $`C_{n1}`$. Now $`\sigma ^{}`$ may or may not be balanced. If $`\sigma ^{}`$ is balanced define the $`C_n`$ element $`\sigma `$ by $`\sigma =[1]\sigma ^{}`$. If $`\sigma ^{}`$ is not balanced set $`\sigma =\sigma ^{}`$.

###### Proposition 4.11.

If $`\alpha `$ and $`\beta `$ are balanced and $`\sigma `$ is defined as above then $`\sigma D_n`$, $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$.

Proof. We show that $`\sigma D_n`$ and $`\sigma \alpha `$. The proof that $`\sigma \beta `$ is completely analogous. First consider the case where $`\sigma ^{}`$ is balanced. Thus $`[k]\sigma ^{}\alpha ^{}`$ in $`C_{n1}`$ for some $`k`$ satisfying $`2kn`$. So we can find reflections $`R_1,\mathrm{},R_s`$ in $`C_{n1}`$ with

$$\alpha ^{}=R_1R_2\mathrm{}R_s,\sigma ^{}=R_1R_2\mathrm{}R_t,R_1=[k],$$

where $`l(\alpha ^{})=st=l(\sigma ^{})`$. Since $`\alpha ^{}C_{n1}`$, Lemma 3.4 gives $`R_2,\mathrm{},R_s`$ all of the form $`((i,j))`$ or $`((i,j))`$ for $`2i<jn`$. In particular, these reflections lie in $`D_n`$. Now $`\alpha `$ is of length $`s+1`$ in $`C_n`$ and

$`\alpha `$ $`=`$ $`[1]R_1R_2\mathrm{}R_tR_{t+1}\mathrm{}R_s`$
$`=`$ $`[1][k]R_2\mathrm{}R_tR_{t+1}\mathrm{}R_s`$
$`=`$ $`((1,k))((1,k))R_2\mathrm{}R_tR_{t+1}\mathrm{}R_s.`$
This last expression only uses $`D_n`$ reflections so that

$$\sigma =((1,k))((1,k))R_2\mathrm{}R_t\alpha \text{ in }D_n.$$

Next we consider the case where $`\sigma ^{}`$ is paired. Here $`\sigma ^{}\alpha ^{}`$ and $`\alpha ^{}`$ is balanced so we can find reflections $`R_1,\mathrm{},R_s`$ in $`C_{n1}`$ with

$$\alpha ^{}=R_1R_2\mathrm{}R_s,\sigma ^{}=R_1R_2\mathrm{}R_t,$$

where $`l(\alpha ^{})=s>t=l(\sigma ^{})`$ and exactly one of $`R_{t+1},\mathrm{},R_s`$ is of form $`[k]`$. Since $`R[k]=[k]([k]R[k])`$, we can assume $`R_{t+1}=[k]`$. Note also that $`R_1,\mathrm{},R_t`$ are each of the form $`((i,j))`$ or $`((i,j))`$ for $`2i<jn`$ and hence commute with $`[1]`$ in $`C_n`$. Thus we can write the following identities in $`C_n`$.

$`\alpha `$ $`=`$ $`[1]R_1R_2\mathrm{}R_t[k]R_{t+2}\mathrm{}R_s`$
$`=`$ $`R_1\mathrm{}R_t[1][k]R_{t+2}\mathrm{}R_s`$
$`=`$ $`R_1\mathrm{}R_t((1,k))((1,k))R_{t+2}\mathrm{}R_s.`$
This last expression only uses $`D_n`$ reflections so that $`\sigma \alpha `$ in $`D_n`$. Finally we show that $`S_\alpha S_\beta S_\sigma `$. First suppose $`\sigma ^{}`$ is balanced and $`RS_\alpha S_\beta `$. Thus $`R`$ is a reflection satisfying $`R\alpha ,\beta `$. If $`R`$ is of the form $`((1,k))`$, then $`[1][k]\alpha ,\beta `$ since $`k`$ must belong to a balanced cycle of both $`\alpha `$ and $`\beta `$. Thus $`[k]\alpha ^{},\beta ^{}`$ so that $`[k]\sigma ^{}`$ and $`[1][k]\sigma `$, which gives $`((1,k))\sigma `$ as required. If $`R`$ is not of form $`((1,k))`$ then $`R\alpha ,\beta `$ implies $`R\alpha ^{},\beta ^{}`$ so that $`R\sigma ^{}`$ and $`R\sigma `$. In the case where $`\sigma ^{}`$ is paired, $`R\alpha ,\beta `$ implies $`R`$ must be of form $`((i,j))`$ or $`((i,j))`$ for $`2i<jn`$ so that $`R\alpha ^{},\beta ^{}`$ giving $`R\sigma ^{}=\sigma `$. q.e.d.Since we have completed the case where both $`\alpha `$ and $`\beta `$ are balanced we will assume from now on that $`\alpha `$ is paired. We note some consequences of this fact which will apply in the remaining cases. The fact that $`\alpha `$ is paired means that $`\alpha ((1,k))\gamma `$ or $`\alpha ((1,k))\gamma `$ for some $`k\{2,3,\mathrm{},n\}`$. Since conjugation by the $`C_{n1}`$ element $`[2,\mathrm{},n]`$ is a poset isomorphism of the interval $`[I,\gamma ]`$ in $`D_n`$, we may assume for convenience of notation that $`k=2`$ so that

$$\alpha ((1,2))[1][2,\mathrm{},n]=((1,2,\mathrm{},n)).$$

If we let $`\delta =((1,2,\mathrm{},n))`$ then a reflection $`R`$ in $`D_n`$ satisfies $`R\delta `$ if and only if $`R\delta `$. Thus we can identify the interval $`[I,\delta ]`$ in $`D_n`$ with the set of non-crossing partitions of $`\{1,2,\mathrm{},n\}`$. Recall that a non-crossing partition of the ordered set $`\{a_1,a_2,\mathrm{},a_n\}`$ is a partition with the property that whenever

$$1i<j<k<ln$$

with $`a_i,a_k`$ belonging to the same block $`B_1`$ and $`a_j,a_l`$ belonging to the same block $`B_2`$ we have $`B_1=B_2`$. If $`\alpha \beta `$ exists, it will satisfy

$$\alpha \beta \alpha ((1,2,\mathrm{},n))$$

and so will correspond to a noncrossing partition of $`\{1,2,\mathrm{},n\}`$. Accordingly, we define a reflexive, symmetric relation on $`\{1,2,\mathrm{},n\}`$ by

$$iji=j\text{ or }((i,j))\alpha ,\beta .$$

We need to show that $``$ is transitive and hence is an equivalence relation. We then show that the resulting partition of $`\{1,2,\mathrm{},n\}`$ is noncrossing and determines an element $`\sigma `$ of $`D_n`$ which satisfies $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$. Suppose that $`\alpha `$ is paired and $`\beta `$ is balanced. Recall that $`\beta `$ has two balanced cycles, one of which is $`[1]`$. For convenience of terminology we will call the other balanced cycle the second balanced cycle of $`\beta `$. As above we will have occasion to use the balanced element $`\beta ^{}[2,\mathrm{},n]`$ in $`C_{n1}`$ defined by $`\beta =[1]\beta ^{}`$.

###### Proposition 4.12.

If $`\alpha `$ is paired and $`\beta `$ is balanced then the relation $``$ above determines an element $`\sigma `$ of $`D_n`$ satisfying $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$.

Proof. First we establish the transitivity of the $``$ relation. Suppose $`i,j,k`$ are distinct elements of $`\{1,2,\mathrm{},n\}`$ with $`ij`$ and $`jk`$. Since $`((i,j)),((j,k))\alpha `$ we get $`((i,k))\alpha `$ since $`\alpha `$ corresponds to a partition of $`\{1,2,\mathrm{},n\}`$. If $`1\{i,j,k\}`$ then $`((i,j)),((j,k))\beta `$ (s-containment cannot arise) and it follows that $`((i,k))\beta `$. If $`i=1`$, then $`((i,j))\beta `$ means that $`((i,j))\beta `$ so that $`j`$ belongs to the second balanced cycle of $`\beta `$. Since $`jk1`$, $`k`$ also belongs to this second balanced cycle and $`((i,k))[1][j,k]\beta `$. If $`j=1`$, then both $`i`$ and $`k`$ belong to the second balanced cycle of $`\beta `$. Hence $`((i,k))\beta `$. The case $`k=1`$ is analogous to the case $`i=1`$. To show that the partition of $`\{1,\mathrm{},n\}`$ defined by $``$ is non-crossing suppose $`1i<j<k<ln`$ with

$$((i,k)),((j,l))\alpha ,\beta .$$

Since $`\alpha `$ corresponds to a noncrossing partition we have $`((i,j,k,l))\alpha `$. If $`i=1`$, then $`k`$ belongs to the second balanced cycle and $`[k]\beta ^{}`$ in $`C_{n1}`$. Since $`1<j<k<l`$, $`((j,l))\beta ^{}`$ and $`\beta ^{}[2,\mathrm{},n]`$ in $`C_{n1}`$, the crossing pair consisting of $`(j,l)`$ and $`(k,k)`$ must lie in the same $`\beta ^{}`$ cycle. Thus $`[j,k,l]\beta ^{}`$ and $`((1,j,k,l))[1][j,k,l]\beta `$. If $`i1`$, then $`((i,k)),((j,l))\beta ^{}`$ and since $`\beta ^{}[2,\mathrm{},n]`$ in $`C_{n1}`$, $`((i,j,k,l))\beta ^{}`$ by proposition 4.6, giving $`((i,j,k,l))\beta `$. Thus the relation $``$ defines a noncrossing partition of $`\{1,2,\mathrm{},n\}`$ and hence determines an element $`\sigma `$ of $`D_n`$. By the definition of $``$ the element $`\sigma `$ satisfies $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$. q.e.d.Finally we consider the case where both $`\alpha `$ and $`\beta `$ are paired.

###### Proposition 4.13.

If $`\alpha `$ and $`\beta `$ are paired then the relation $``$ above determines an element $`\sigma `$ of $`D_n`$ satisfying $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$.

Proof. To establish the transitivity of $``$ in this case let $`i,j,k`$ be distinct elements of $`\{1,2,\mathrm{},n\}`$ with $`ij`$ and $`jk`$. As in the previous proposition, $`((i,k))\alpha `$ follows immediately. Since $`\beta `$ is paired, $`ij`$ and $`jk`$ mean that $`i,j,k`$ belong to the same cycle of $`\beta `$ so that $`((i,k))\beta `$ also. To show that the partition of $`\{1,\mathrm{},n\}`$ defined by $``$ is noncrossing suppose $`1i<j<k<ln`$ with

$$((i,k)),((j,l))\alpha ,\beta .$$

Since $`\alpha `$ corresponds to a noncrossing partition we have $`((i,j,k,l))\alpha `$. The element $`\beta `$ is paired so we can assume $`\beta \tau =((1,m))\gamma `$ or $`\beta \tau =((1,m))\gamma `$, for some $`m\{2,3,\mathrm{},n\}`$. Looking at the case $`\tau =((1,m))\gamma `$ first we get

$$\tau =((1,m,m1,\mathrm{},n,2,3,\mathrm{},m1)).$$

Since $`\beta \tau `$ the element $`\beta `$ corresponds to a noncrossing partition of the ordered set $`\{1,m,m1,\mathrm{},n,2,3,\mathrm{},m1\}`$. Since $`1i<j<k<ln`$, we deduce that either

$$1i<j<k<lm1\text{ or }mi<j<k<ln.$$

Since $`\beta `$ corresponds to a noncrossing partition of the ordered set

$$\{1,m,m1,\mathrm{},n,2,3,\mathrm{},m1\}$$

and $`((i,k)),((j,l))\beta `$ it follows in either case that $`((i,j,k,l))\beta `$. The case $`\tau =((1,m))\gamma `$ is similar. Here

$$\tau =((1,m,m+1,\mathrm{},n,2,3,\mathrm{},m+1)),$$

and again we can deduce $`((i,j,k,l))\beta `$. Thus $``$ defines a noncrossing partition of $`\{1,2,\mathrm{},n\}`$ and hence an element $`\sigma `$ in $`D_n`$ satisfying $`\sigma \alpha ,\beta `$ and $`S_\alpha S_\beta S_\sigma `$ as in previous proposition. q.e.d.Combining the results of this subsection we obtain the following theorem.

###### Theorem 4.14.

The interval $`[I,\gamma ]`$ in $`D_n`$ is a lattice.

## 5.  Poset groups and K$`(\pi ,1)`$’s.

###### Definition 5.1.

If $`W`$ is a finite Coxeter group and $`\gamma W`$ we define the poset group $`\mathrm{\Gamma }=\mathrm{\Gamma }(W,\gamma )`$ to be the group with the following presentation. The generating set for $`\mathrm{\Gamma }`$ consists of a copy of the set of non-identity elements in $`[I,\gamma ]`$. We will denote by $`\{w\}`$ the generator of $`\mathrm{\Gamma }`$ corresponding the element $`w(I,\gamma ]`$. The relations in $`\mathrm{\Gamma }`$ are all identities of the form $`\{w_1\}\{w_2\}=\{w_3\}`$, where $`w_1,w_2`$ and $`w_3`$ lie in $`(I,\gamma ]`$ with $`w_1w_3`$ and $`w_2=w_1^1w_3`$.

Since none of the relations involve inverses of the generators, there is a semigroup, which we will denote by $`\mathrm{\Gamma }_+=\mathrm{\Gamma }_+(W,\gamma )`$, with the same presentation. As in section $`5`$ of , we define a *positive* word in $`\mathrm{\Gamma }`$ to be a word in the generators that does not involve the inverses of the generators. We say two positive words $`A`$ and $`B`$ are *positively equal*, and we write $`AB`$, if $`A`$ can be transformed to $`B`$ through a sequence of positive words, where each word in the sequence is obtained from the previous one by replacing one side of a defining relator by the other side. Since the interval $`(I,\gamma ]`$ inherits the reflection length from $`W`$ we use this to associate a *length* to each generator of $`\mathrm{\Gamma }(W,\gamma )`$ and hence a length $`l(A)`$ to each positive word $`A`$. It is immediate that positively equal words have the same length. From now on we only consider those pairs $`(W,\gamma )`$ with the property that  *the interval $`[I,\gamma ]`$ in $`W`$ forms a lattice*. It is clear that the results stated for the braid group in sections $`5`$ and $`6`$ of  apply to poset groups under this extra assumption. We will review them briefly below. In  it is shown that this lattice condition is satisfied when $`W`$ is a Coxeter group of type $`A_n`$ and $`\gamma `$ is a Coxeter element. In section 4 above we have shown that the lattice condition is satisfied when $`W`$ is a Coxeter group of type $`C_n`$ or $`D_n`$ and $`\gamma `$ is a Coxeter element. When the Coxeter group is generated by two reflections the lattice condition is automatic for any $`\gamma `$. When the Coxeter group is generated by three reflections the lattice condition reduces to checking the only case where

$$\alpha \beta \{\alpha ,\beta ,\gamma \}.$$

This occurs when $`\alpha `$ and $`\beta `$ are distinct reflections and have at least one common upper bound of length $`2`$. Any such length $`2`$ element $`\delta `$ must have $`F(\delta )`$ coinciding with the unique line of intersection of the two reflection planes. Hence $`\delta `$ is unique. This is precisely the ingredient which makes the metric constructed in  have non-positive curvature.

The following result is taken from . Its proof is the same.

###### Lemma 5.2.

Assume that the interval $`[I,\gamma ]`$ forms a lattice and suppose $`a,b,c\gamma `$. We define nine elements $`d`$, $`e`$, $`f`$, $`g`$, $`h`$, $`k`$, $`l`$, $`m`$ and $`n`$ in $`[I,\gamma ]`$ by the equations

$$ab=ad=be,bc=bf=cg,ca=ch=ak$$

and

$$abc=(ab)l=(bc)m=(ca)n.$$

Then we can deduce

$$ef=el=fm,dk=dl=kn,hg=hn=gm.$$

The statements and proofs of the results of section 5 and section 6 of  generalize in a straightforward manner to the current setting. In particular, we have the following definitions and results.

###### Lemma 5.3.

The semigroup associated to $`\mathrm{\Gamma }`$ has right and left cancellation properties.

###### Lemma 5.4.

Suppose $`a_1,a_2,\mathrm{},a_k\gamma `$ in $`W`$, $`P`$ is positive and

$$PX_1\{a_1\}\mathrm{}X_k\{a_k\}$$

with $`X_i`$ all positive. Then there is a positive word $`Z`$ satisfying

$$PZ\{a_1\mathrm{}a_k\}.$$

###### Theorem 5.5.

In $`\mathrm{\Gamma }`$, if two positive words are equal they are positively equal. In other words, the semigroup $`\mathrm{\Gamma }_+`$ embeds in $`\mathrm{\Gamma }`$.

As in  we define an abstract simplicial complex $`X(W,\gamma )`$ for each $`\mathrm{\Gamma }(W,\gamma )`$.

###### Definition 5.6.

We let $`X=X(W,\gamma )`$ be the abstract simplicial complex with vertex set $`\mathrm{\Gamma }`$, which has a $`k`$-simplex on the subset $`\{g_0,g_1,\mathrm{},g_k\}`$ if and only if $`g_i=g_0\{w_i\}`$ for $`i=1,2,\mathrm{},k`$ where

$$I<w_1<\mathrm{}<w_k\gamma \text{ in }W.$$

There is an obvious simplicial action of $`\mathrm{\Gamma }`$ on $`X`$ given by

$$g\{g_0,g_1,\mathrm{},g_k\}=\{gg_0,gg_1,\mathrm{},gg_k\}.$$

The main result of section $`6`$ of  also holds for these poset groups.

###### Theorem 5.7.

$`X(W,\gamma )`$ is contractible.

If we define $`K=K(W,\gamma )`$ to be the quotient space $`K=\mathrm{\Gamma }\backslash X`$, then $`K`$ is a $`K(\mathrm{\Gamma },1)`$. We finish this section with an example of a poset group $`\mathrm{\Gamma }(W,\gamma )`$, with $`[I,\gamma ]`$ a lattice but $`\gamma `$ not a Coxeter element in $`W`$.

###### Example 5.8.

Let $`W=C_2`$ and $`\gamma =[1][2]`$. The group $`\mathrm{\Gamma }(C_2,\gamma )`$ has presentation

$$a,b,c,d,xx=ab=ba=cd=dc$$

where $`a=\{[1]\}`$, $`b=\{[2]\}`$, $`c=\{((1,2))\}`$, $`d=\{((1,2))\}`$ and $`x=\{[1][2]\}`$. From the presentation we see that $`\mathrm{\Gamma }`$ is an amalgamated free product of a copy $`\times `$ generated by $`a`$ and $`b`$ with a copy $`\times `$ generated by $`c`$ and $`d`$ over the infinite cyclic subgroup generated by $`x`$. The above construction gives a two-dimensional contractible universal cover for the presentation $`2`$-complex which can be shown to be simplicially isomorphic to $`X(C_2,[1,2])`$.

## 6. Group Presentations.

In this section we prove that the poset groups $`\mathrm{\Gamma }(W,\gamma )`$ of section 5 are isomorphic to the Artin groups $`A(W)`$ for $`W`$ of type $`C_n`$ or $`D_n`$ and $`\gamma `$ the appropriate Coxeter element. The proof is based on the following surprising property that these Artin groups share with the braid group. If $`X=x_1x_2\mathrm{}x_n`$ is the product of the standard Artin generators then there is a finite set of elements in $`A(W)`$ which is invariant under conjugation by $`X`$. Moreover under the canonical surjection from $`A(W)`$ to $`W`$ this set is taken bijectively to the set of reflections in $`W`$. The following lemma is a straightforward generalisation of Lemma 4.5 of .

###### Lemma 6.1.

The poset group $`\mathrm{\Gamma }(W,\gamma )`$ is isomorphic to the abstract group generated by the set of all $`\{R\}`$, for $`R`$ a reflection in $`[I,\gamma ]`$, subject to the relations

$$\{R_1\}\{R_2\}\mathrm{}\{R_n\}=\{S_1\}\{S_2\}\mathrm{}\{S_n\},$$

for $`R_i,S_j`$ reflections satisfying

$$\gamma =R_1R_2\mathrm{}R_n\text{ and }\gamma =S_1S_2\mathrm{}S_n,$$

where $`n=l(\gamma )`$.

We will refer to $`\{w\}\mathrm{\Gamma }(W,\gamma )`$ as the lift of $`wW`$ whenever $`w\gamma `$. In particular, we will refer to $`\{w\}`$ as a reflection lift whenever $`w`$ is a reflection. Since the Artin groups of type $`C_n`$ and $`D_n`$ both contain copies of the $`n`$-strand braid group $`B_n`$ we collect here some facts about the braid group which will be useful. We recall that $`B_n`$ is the group with generating set $`x_2,x_3,\mathrm{}x_n`$ and defining relations

$$x_ix_{i+1}x_i=x_{i+1}x_ix_{i+1}\text{ for }2in1,$$

$$x_ix_j=x_jx_i\text{ for }|ji|2.$$

We define $`x_{i,j}`$ and $`Y_{i,j}`$, for $`1i<jn`$ by

$$Y_{i,j}=x_{i+1}\mathrm{}x_j,\text{ and }Y_{i,j}=Y_{i+1,j}x_{i,j}.$$

Then Lemma 4.2 of  gives, for $`1i<j<kn`$,

$$x_{i,j}x_{j,k}=x_{j,k}x_{i,k}=x_{i,k}x_{i,j}.$$

Since $`x_k=x_{k1,k}`$ it follows that $`x_{i,j}Y_{i,j1}=Y_{i,j}`$ and that

$$x_kY_{i,j}=Y_{i,j}x_{k1}\text{for}i+2kj.$$

When $`k=i+1`$ we have $`x_{i+1}Y_{i,j}=x_{i+1}Y_{i+1,j}x_{i,j}=Y_{i,j}x_{i,j}`$.

### 6.1. The $`C_n`$ case

The Artin group $`A(C_n)`$ has a presentation with generating set $`x_1,x_2,\mathrm{}x_n`$, subject to the relations

$$x_1x_2x_1x_2=x_2x_1x_2x_1$$

$$x_ix_{i+1}x_i=x_{i+1}x_ix_{i+1}$$

whenever $`1<i<n`$ and

$$x_ix_j=x_jx_i$$

whenever $`|ji|2`$.

###### Definition 6.2.

We define a function $`\varphi `$ from the generators of $`A(C_n)`$ to $`\mathrm{\Gamma }(C_n,\gamma )`$ by

$$x_1\{[1]\},x_2\{((1,2))\},x_3\{((2,3))\},\mathrm{},x_n\{((n1,n))\}$$

###### Lemma 6.3.

The function $`\varphi `$ determines a well-defined and surjective homomorphism.

*Proof:* The relations involving $`\varphi (x_1)`$ hold in $`\mathrm{\Gamma }(C_n,\gamma )`$ by virtue of the following identities in $`\mathrm{\Gamma }(C_n,\gamma )`$.

$`\{[1]\}\{((1,2))\}\{[1]\}\{((1,2))\}`$ $`=`$ $`\{[1,2]\}\{[1,2]\}`$
$`=`$ $`\{((1,2))\}\{[2]\}\{((1,2))\}\{[1]\}`$
$`=`$ $`\{((1,2))\}\{[1,2]\}\{[1]\}`$
$`=`$ $`\{((1,2))\}\{[1]\}\{((1,2))\}\{[1]\}`$
$$\{[1]\}\{((i,i+1))\}=\{((i,i+1))\}\{[1]\},\text{for}i2.$$

The image of the subgroup generated by $`\{x_2,\mathrm{},x_n\}`$ lies in the copy of the braid group corresponding to $`\mathrm{\Sigma }_n<C_n`$ so that the relations not involving $`\varphi (x_1)`$ hold by Lemma 4.2 and Lemma 4.4 of . Thus $`\varphi `$ is well-defined.

To establish surjectivity, first note that

$$\{((i,i+1,\mathrm{},j))\}=\varphi (Y_{i,j})\text{ and }\{((i,j))\}=\varphi (x_{i,j})$$

for $`1i<jn`$ all lie in $`\text{im}(\varphi )`$. Next $`\{[j]\}\text{im}(\varphi )`$ since

$$\varphi (x_1x_{1,j})=\{[1]\}\{((1,j))\}=\{[1,j]\}=\{((1,j))\}\{[j]\}.$$

Finally, $`\{((i,j))\}\text{im}(\varphi )`$ for $`1i<jn`$ since

$$\{((i,j))\}\{[j]\}=\{[i,j]\}=\{[j]\}\{((i,j))\}.$$

q.e.d.To construct an inverse to $`\varphi `$ we will use the presentation for $`\mathrm{\Gamma }(C_n,\gamma )`$ given by lemma 6.1.

###### Definition 6.4.

We define a function $`\theta `$ from the generators of $`\mathrm{\Gamma }(C_n,\gamma )`$ to $`A(C_n)`$ by

$`\{[1]\}`$ $``$ $`x_1,\{((i,j))\}x_{i,j}\text{ for }1i<jn,`$
$`\{[j]\}`$ $``$ $`y_j\text{ for }\mathrm{\hspace{0.17em}\hspace{0.17em}2}jn,\{((i,j))\}z_{i,j}\text{ for }\mathrm{\hspace{0.17em}\hspace{0.17em}1}i<jn,`$
where $`y_j`$ is the unique element of $`A(C_n)`$ satisfying

$$x_1x_2\mathrm{}x_j=x_2\mathrm{}x_jy_j$$

and $`z_{i,j}`$ is the unique element of $`A(C_n)`$ satisfying

$$z_{i,j}y_i=y_ix_{i,j}.$$

The homomorphism determined by $`\theta `$ will be surjective since each $`x_i`$ is the image of some reflection lift. We note that $`Y_{i,j}y_j=y_iY_{i,j}`$ for $`1i<jn`$ if we define $`y_1=x_1`$. To show that $`\theta `$ determines a well-defined homomorphism we first define the special element $`X=x_1x_2\mathrm{}x_n`$ in $`A(C_n)`$ and establish the following result.

###### Proposition 6.5.

For any reflection $`R`$ in $`C_n`$,

$$X\theta (\{R\})X^1=\theta (\{\gamma R\gamma ^1\}).$$

Proof.  Since $`X=x_1Y_{1,n}`$ and $`x_1`$ commutes with $`x_3,\mathrm{},x_n`$, it follows that $`Xx_i=x_{i+1}X`$ for $`2i<n`$ and $`Xx_{i,j}=x_{i+1,j+1}X`$ for $`1i<j<n`$. This establishes the proposition for $`R`$ of the form $`((i,j))`$ for $`1i<j<n`$. The identity $`Xy_j=y_{j+1}X`$ for $`1j<n`$ is a consequence of the following calculation.

$`Y_{2,j+1}Xy_j`$ $`=`$ $`x_2Y_{3,j+1}Xy_j=x_2XY_{2,j}y_j=x_2Xx_1Y_{2,j}`$
$`=`$ $`x_2x_1x_2Y_{3,n}x_1Y_{2,j}=x_2x_1x_2x_1Y_{3,n}Y_{2,j}`$
$`=`$ $`x_1x_2x_1x_2Y_{3,n}Y_{2,j}=x_1x_2XY_{2,j}=x_1x_2Y_{3,j+1}X`$
$`=`$ $`x_1Y_{2,j+1}X=Y_{2,j+1}y_{j+1}X`$
This establishes the proposition for $`R`$ of the form $`[j]`$ for $`1i<n`$. Conjugating $`y_n`$ by $`X`$ gives $`x_1`$, since

$$Xy_n=(x_1x_2\mathrm{}x_n)y_n=x_1(x_2\mathrm{}x_ny_n)=x_1(x_1\mathrm{}x_n).$$

This establishes the proposition for the reflection $`[n]`$. Next we show $`Xx_{i,n}=z_{1,i+1}X`$.

$`z_{1,i+1}X`$ $`=`$ $`z_{1,i+1}x_1Y_{1,n}=x_1x_{1,i+1}Y_{1,n}=x_1x_{1,i+1}Y_{1,i}Y_{i,n}`$
$`=`$ $`x_1Y_{1,i}x_{i+1}Y_{i,n}+x_1Y_{1,i}x_{i+1}Y_{i+1,n}x_{i,n}=x_1Y_{1,n}x_{i,n}=Xx_{i,n}`$
This establishes the proposition for $`R`$ of the form $`((i,n))`$ for $`1i<n`$. The identity $`Xz_{i,j}=z_{i+1,j+1}X`$ for $`1i<j<n`$ follows from the definition of $`z_{i,j}`$ and the corresponding identities for $`x_{i,j}`$ and $`y_i`$, which establishes the proposition for $`R`$ of the form $`((i,j))`$ for $`1i<j<n`$. Next we observe that, for $`3jn`$, $`y_jz_{1,j}=x_{1,j}y_j`$ because

$`Y_{1,j}y_jz_{1,j}x_1`$ $`=`$ $`x_1Y_{1,j}z_{1,j}x_1=x_1Y_{1,j}x_1x_{1,j}=x_1x_2Y_{2,j}x_1x_{1,j}`$
$`=`$ $`x_1x_2x_1Y_{2,j}x_{1,j}=x_1x_2x_1Y_{1,j}=x_1x_2x_1x_2Y_{2,j}`$
$`=`$ $`x_2x_1x_2x_1Y_{2,j}=x_2x_1x_2Y_{2,j}x_1=x_2x_1Y_{1,j}x_1`$
$`=`$ $`x_2Y_{1,j}y_jx_1=Y_{1,j}x_{1,j}y_jx_1.`$
Since $`Xz_{i,n}y_i=Xy_ix_{i,n}=y_{i+1}z_{1,i+1}X=x_{1,i+1}y_{i+1}X=x_{1,i+1}Xy_i`$, it follows that $`Xz_{i,n}=x_{1,i+1}X`$ and hence the proposition is established for the final case, $`R`$ of the form $`((i,n))`$ for $`1i<n`$. q.e.d.

###### Definition 6.6.

We define a lift of $`\gamma `$ to $`A(C_n)`$ to be an element of the form

$$E=\theta (\{R_1\})\theta (\{R_2\})\mathrm{}\theta (\{R_n\}),$$

where the $`R_i`$ are reflections in $`C_n`$ satisfying $`R_1R_2\mathrm{}R_n=[1,2,3,\mathrm{},n]`$.

We note that one lift of $`\gamma `$ to $`A(C_n)`$ is

$$X=x_1x_2\mathrm{}x_n=\theta (\{[1]\})\theta (\{((1,2))\})\mathrm{}\theta (\{((n1,n))\}).$$

To show that $`\theta `$ is well-defined it suffices, by Lemma 6.1, to prove the following.

###### Proposition 6.7.

For any lift $`E`$ of $`\gamma `$ to $`A(C_n)`$ we have $`E=X`$.

Proof. Given a lift $`E=\theta (\{R_1\})\theta (\{R_2\})\mathrm{}\theta (\{R_n\})`$ of $`\gamma `$ to $`A(C_n)`$, we know that $`R_1R_2\mathrm{}R_n=[1,2,\mathrm{},n]`$ and by Lemma 3.4 exactly one of the $`R_k`$ is of the form $`[j]`$. Since $`E=X`$ if and only if $`X^lEX^l=X`$ for any integer $`l`$, we may assume by the previous proposition that $`R_k=[1]`$. We will construct a new lift $`E^{}`$ of $`\gamma `$ satisfying $`E^{}=E`$ and

$$E^{}=\theta (\{R_1\})\mathrm{}\theta (\{R_{k2}\})\theta (\{[1]\})\theta (\{R^{}\})\theta (\{R_{k+1}\})\mathrm{}\theta (\{R_n\}),$$

for some reflection $`R^{}`$. To simplify notation we set $`R_{k1}=T`$ so that $`R_{k1}R_k=T[1]`$. Since $`T[1]\gamma `$ we know that $`T\gamma [1]`$ or

$$T((1,2,3,\mathrm{},n))$$

so that $`T`$ has the form $`((1,p))`$ for $`2pn`$ or $`T`$ has the form $`((i,j))`$ with $`2i<jn`$. In the latter case $`\theta (\{T\})`$ lies in the subgroup of $`A(C_n)`$ generated by $`\{x_3,x_4,\mathrm{},x_n\}`$ and so commutes with $`\theta (\{[1]\})=x_1`$. Thus we can use $`R^{}=T`$. In the former case, $`\theta (\{T\})=z_{1,p}`$ and $`E^{}`$ can be constructed using

$$\theta (\{T\})\theta (\{[1]\})=z_{1,p}x_1=x_1x_{1,p}=\theta (\{[1]\})\theta (\{((1,p))\}).$$

After $`k1`$ such steps we get $`E=x_1\theta (\{S_2\})\mathrm{}\theta (\{S_n\})`$, where the product on the right is a lift of $`\gamma `$ to $`A(C_n)`$. However, this means $`S_2S_3\mathrm{}S_n=((1,2,\mathrm{},n))`$ in $`C_n`$ so that $`S_i\mathrm{\Sigma }_n<C_n`$ and

$$\theta (\{S_2\})\mathrm{}\theta (\{S_n\})=x_2x_3\mathrm{}x_n,$$

by Lemma 4.6 of . q.e.d.Combining the results in this subsection we get the following theorem.

###### Theorem 6.8.

The poset group $`\mathrm{\Gamma }(C_n,\gamma )`$ is isomorphic to the Artin group $`A(C_n)`$ for $`\gamma `$ a Coxeter element in $`C_n`$.

### 6.2. The $`D_n`$ case

In this case our approach will be exactly as in the $`C_n`$ case. However, the computations are more numerous and more complicated. The Artin group $`A(D_n)`$ has a presentation with generating set $`x_1,x_2,\mathrm{}x_n`$, subject to the relations

$`x_1x_2`$ $`=`$ $`x_2x_1,`$
$`x_1x_3x_1`$ $`=`$ $`x_3x_1x_3,`$
$`x_1x_i`$ $`=`$ $`x_ix_1,\text{ for }i4`$
$`x_ix_{i+1}x_i`$ $`=`$ $`x_{i+1}x_ix_{i+1},\text{ for }1<i<n\text{ and}`$
$`x_ix_j`$ $`=`$ $`x_jx_i,\text{ for }|ji|2\text{ and }i,j1.`$
###### Definition 6.9.

We define a function $`\varphi `$ from the generators of $`A(D_n)`$ to $`\mathrm{\Gamma }(D_n,\gamma )`$ by

$$x_1\{((1,2))\},x_2\{((1,2))\},x_3\{((2,3))\},\mathrm{},x_n\{((n1,n))\}$$

###### Lemma 6.10.

The function $`\varphi `$ determines a well-defined surjective homomorphism.

*Proof:* The relations involving $`\varphi (x_1)`$ hold in $`\mathrm{\Gamma }(D_n,\gamma )`$ by virtue of the following identities in $`\mathrm{\Gamma }(D_n,\gamma )`$.

$$\{((1,2))\}\{((1,2))\}=\{[1][2]\}=\{((1,2))\}\{((1,2))\}$$

$`\{((1,2))\}\{((2,3))\}\{((1,2))\}`$ $`=`$ $`\{((1,2,3))\}\{((1,2))\}`$
$`=`$ $`\{((2,3))\}\{((1,3))\}\{((1,2))\}`$
$`=`$ $`\{((2,3))\}\{((1,2,3))\}`$
$`=`$ $`\{((2,3))\}\{((1,2))\}\{((2,3))\}`$
$$\{((1,2))\}\{((i,i+1))\}=\{((i,i+1))\}\{((1,2))\},\text{for}i3.$$

The image of the subgroup generated by $`\{x_2,\mathrm{},x_n\}`$ again lies in the copy of the braid group corresponding to $`\mathrm{\Sigma }_n<D_n`$ so that the relations not involving $`\varphi (x_1)`$ hold by Lemma 4.2 and Lemma 4.4 of . Thus $`\varphi `$ is well-defined.

To establish surjectivity, note that both $`\{((i,j))\}`$ and $`\{((i,i+1,\mathrm{},j))\}`$ lie in $`\text{im}(\varphi )`$, for $`1i<jn`$ as in the $`C_n`$ case. To find the other reflection lifts in $`\text{im}(\varphi )`$ first note that

$$\varphi (x_1x_2\mathrm{}x_j)=\{[1][2,3\mathrm{},j]\}=\{((1,2))\}\{((1,2,\mathrm{},j))\}\text{im}(\varphi ),$$

and $`\{((1,j))\}\text{im}(\varphi )`$ for $`j3`$ since

$$\{((1,2,\mathrm{},j))\}\{((1,j))\}=\{[1][2,\mathrm{},j]\}.$$

Reflection lifts of the form $`\{((2,j))\}`$ for $`j3`$ lie in $`\text{im}(\varphi )`$ since

$$\{((1,2))\}\{((1,j))\}=\{((1,j,2))\}=\{((2,j))\}\{((1,2))\}$$

and reflection lifts of the form $`\{((i,j))\}`$ for $`3i<jn`$ lie in $`\text{im}(\varphi )`$ since

$$\{((i,j))\}\{((1,i))\}\{((1,i))\}=\{[1][i,j]\}=\{((1,i))\}\{((1,i))\}\{((i,j))\}.$$

q.e.d.To construct an inverse to $`\varphi `$ we will use the presentation for $`\mathrm{\Gamma }(D_n,\gamma )`$ given by Lemma 6.1.

###### Definition 6.11.

We define a function $`\theta `$ from the generators of $`\mathrm{\Gamma }(D_n,\gamma )`$ to $`A(D_n)`$ by

$$\{((1,2))\}x_1,\{((i,j))\}x_{i,j}\text{ and }\{((i,j))\}z_{i,j},$$

for $`1i<jn`$, where $`z_{i,j}`$ is the unique element of $`A(D_n)`$ satisfying

$`z_{1,j}x_1`$ $`=`$ $`x_1x_{2,j}\text{ when }j3`$
$`z_{2,j}x_1`$ $`=`$ $`x_1x_{1,j}\text{ when }j3`$
$`z_{i,j}x_{1,i}z_{1,i}`$ $`=`$ $`x_{1,i}z_{1,i}x_{i,j}\text{ when }3i<jn`$
We note that $`z_{1,2}=x_1`$. Since each $`x_{i,j}`$ lies in the copy of $`B_n`$ generated by $`\{x_2,\mathrm{}x_n\}`$ the elements $`x_{i,j}`$ satisfy the same identities as in the $`C_n`$ case. The homomorphism determined by $`\theta `$ will be surjective since each $`x_i`$ is the image of some reflection lift. To show that $`\theta `$ determines a well-defined homomorphism we define the special element $`X=x_1x_2\mathrm{}x_n`$ in $`A(D_n)`$ and establish the $`D_n`$ analogue of Proposition 6.5 .

###### Proposition 6.12.

For any reflection $`R`$ in $`D_n`$,

$$X\theta (\{R\})X^1=\theta (\{\gamma R\gamma ^1\}).$$

Proof.  Since $`X=x_1Y_{1,n}`$ and $`x_1`$ commutes with $`x_4,\mathrm{},x_n`$ it follows that $`Xx_i=x_{i+1}X`$ for $`3i<n`$ and $`Xx_{i,j}=x_{i+1,j+1}X`$ for $`3i<j<n`$. This establishes the proposition in the case $`R=((i,j))`$ for $`3i<j<n`$. For some of the later cases we will require the identities $`x_{2,j}z_{1,j}=x_1x_{2,j}`$ and $`x_{1,j}z_{2,j}=x_1x_{1,j}`$ for $`3jn`$. The first follows from

$`Y_{3,j}x_{2,j}z_{1,j}x_1`$ $`=`$ $`x_3Y_{3,j}z_{1,j}x_1=x_3Y_{3,j}x_1x_{2,j}=x_3x_1Y_{3,j}x_{2,j}`$
$`=`$ $`x_3x_1x_3Y_{3,j}=x_1x_3x_1Y_{3,j}=x_1x_3Y_{3,j}x_1=x_1Y_{3,j}x_{2,j}x_1`$
$`=`$ $`Y_{3,j}x_1x_{2,j}x_1,`$
while the second follows from

$`x_1Y_{2,j}x_{1,j}z_{2,j}x_1`$ $`=`$ $`x_1x_2Y_{2,j}z_{2,j}x_1=x_1x_2Y_{2,j}x_1x_{1,j}=x_1x_2x_3Y_{3,j}x_1x_{1,j}`$
$`=`$ $`x_1x_2x_3x_1Y_{3,j}x_{1,j}=x_2x_1x_3x_1Y_{3,j}x_{1,j}=x_2x_3x_1x_3Y_{3,j}x_{1,j}`$
$`=`$ $`x_2x_3x_1Y_{2,j}x_{1,j}=x_2x_3x_1x_2Y_{2,j}=x_2x_3x_1x_2Y_{2,j}`$
$`=`$ $`x_2x_3x_2x_1Y_{2,j}=x_3x_2x_3x_1Y_{2,j}=x_3x_2x_3x_1x_3Y_{3,j}`$
$`=`$ $`x_3x_2x_1x_3x_1Y_{3,j}=x_3x_2x_1x_3Y_{3,j}x_1=x_3x_2x_1Y_{2,j}x_1`$
$`=`$ $`x_3x_1x_2Y_{2,j}x_1=x_3x_1Y_{2,j}x_{1,j}x_1=x_3x_1x_3Y_{3,j}x_{1,j}x_1`$
$`=`$ $`x_1x_3x_1Y_{3,j}x_{1,j}x_1=x_1x_3Y_{3,j}x_1x_{1,j}x_1.`$
The conjugation action of $`X`$ on $`x_1`$ is given by $`Xx_1=x_{1,3}X`$ since

$`x_3Xx_1`$ $`=`$ $`x_3x_1x_2x_3Y_{3,n}x_1=x_3x_1x_2x_3x_1Y_{3,n}=x_3x_2x_1x_3x_1Y_{3,n}`$
$`=`$ $`x_3x_2x_3x_1x_3Y_{3,n}=x_2x_3x_2x_1x_3Y_{3,n}=x_2x_3x_1x_2x_3Y_{3,n}`$
$`=`$ $`Y_{1,3}X=x_3x_{1,3}X.`$
A similar calculation gives $`x_3Xx_2=x_1x_3X`$. Since

$$x_1x_3X=x_1x_{2,3}X=x_{2,3}z_{1,3}X$$

we get $`Xx_2=z_{1,3}X`$. This establishes the proposition in the cases $`R=((1,2))`$ and $`R=((1,2))`$. Next we establish $`Xx_n=z_{2,n}X`$.

$$Xx_n=x_1Y_{1,n}x_n=x_1x_{1,n}Y_{1,n1}x_n=z_{2,n}x_1Y_{1,n}=z_{2,n}X$$

which takes care of the case $`R=((n1,n))`$. To obtain the identity $`Xx_{1,j}=z_{1,j+1}X`$ we note that

$$Y_{1,n}x_{1,j}Y_{1,j1}=Y_{1,n}Y_{1,j}=Y_{2,j+1}Y_{1,n}=x_{2,j+1}Y_{2,j}Y_{1,n}=x_{2,j+1}Y_{1,n}Y_{1,j1}$$

giving $`Y_{1,n}x_{1,j}=x_{2,j+1}Y_{1,n}`$ so that

$$Xx_{1,j}=x_1Y_{1,n}x_{1,j}=x_1x_{2,j+1}Y_{1,n}=z_{1,j+1}x_1Y_{1,n}=z_{1,j+1}X.$$

This completes the case $`R=((1,j))`$ for $`2j<n`$. For the identity $`Xx_{1,n}=x_2X`$ we compute

$$Xx_{1,n}=x_1x_2(x_3\mathrm{}x_n)x_{1,n}=x_1x_2(x_2x_3\mathrm{}x_n)=x_2X,$$

which establishes the case $`R=((1,n))`$. For $`2i<n`$ we have

$`Xx_{i,n}`$ $`=`$ $`x_1Y_{1,i+1}Y_{i+1,n}x_{i,n}=x_1Y_{1,i+1}x_{i+1}Y_{i+1,n}`$
$`=`$ $`x_1x_{1,i+1}Y_{1,i}x_{i+1}Y_{i+1,n}=z_{2,i+1}x_1Y_{1,n}=z_{2,i+1}X`$
and hence the proposition is true for $`R=((i,n))`$ with $`2i<n`$. The identity $`Xz_{1,j}=x_{1,j+1}X`$ for $`3j<n`$ follows from

$$Xz_{1,j}x_1=Xx_1x_{2,j}=x_{1,3}x_{3,j+1}X=x_{1,j+1}x_{1,3}X=x_{1,j+1}Xx_1,$$

while the identity $`Xz_{1,n}=z_{1,2}X=x_1X`$ follows from

$$Xz_{1,n}x_1=Xx_1x_{2,n}=x_{1,3}z_{2,3}X=x_1x_{1,3}X=x_1Xx_1.$$

This establishes the proposition for $`R=((1,j))`$ with $`2jn`$. The identity $`Xz_{i,n}=x_{2,i+1}X`$ for $`2i<n`$ follows from

$`Xz_{i,n}x_{1,i}z_{1,i}`$ $`=`$ $`Xx_{1,i}z_{1,i}x_{i,n}=z_{1,i+1}x_{1,i+1}z_{2,i+1}X`$
$`=`$ $`z_{1,i+1}x_1x_{1,i+1}X=x_1x_{2,i+1}x_{1,i+1}X`$
$`=`$ $`x_{2,i+1}z_{1,i+1}x_{1,i+1}X=x_{2,i+1}Xx_{1,i}z_{1,i}.`$
This establishes the proposition for $`R=((i,n))`$ with $`2i<n`$. Finally we note that $`x_{1,i}z_{1,i}=z_{1,i}x_{1,i}`$ since

$`x_{2,i}x_{1,i}z_{1,i}`$ $`=`$ $`x_2x_{2,i}z_{1,i}=x_2x_1x_{2,i}=x_1x_2x_{2,i}`$
$`=`$ $`x_1x_{2,i}x_{1,i}=x_{2,i}z_{1,i}x_{1,i}.`$
From this we deduce that $`Xz_{i,j}=z_{i+1,j+1}X`$ for $`2i<j<n`$ since

$`Xz_{i,j}x_{1,i}z_{1,i}`$ $`=`$ $`Xx_{1,i}z_{1,i}x_{i,j}=z_{1,i+1}x_{1,i+1}x_{i+1,j+1}X`$
$`=`$ $`z_{i+1,j+1}z_{1,i+1}x_{1,i+1}X=z_{i+1,j+1}Xx_{1,i}z_{1,i}.`$
This establishes the proposition for the remaining cases $`R=((i,j))`$ with $`2i<j<n`$. q.e.d.

###### Definition 6.13.

We define a lift of $`\gamma `$ to $`A(D_n)`$ to be an element of the form

$$E=\theta (\{R_1\})\theta (\{R_2\})\mathrm{}\theta (\{R_n\}),$$

where the $`R_i`$ are reflections in $`D_n`$ satisfying $`R_1R_2\mathrm{}R_n=[1][2,3,\mathrm{},n]`$.

We note that one lift of $`\gamma `$ to $`A(D_n)`$ is

$$X=x_1x_2\mathrm{}x_n=\theta (\{((1,2))\})\theta (\{((1,2))\})\mathrm{}\theta (\{((n1,n))\}).$$

To show that $`\theta `$ determines a well-defined homomorphism it suffices, by Lemma 6.1, to prove the following.

###### Proposition 6.14.

For any lift $`E`$ of $`\gamma `$ to $`A(D_n)`$ we have $`E=X`$.

*Proof:* Given a lift $`E`$ of $`\gamma `$ to $`A(D_n)`$, where

$$E=\theta (\{R_1\})\theta (\{R_2\})\mathrm{}\theta (\{R_n\}),$$

we know that $`R_1R_2\mathrm{}R_n=[1][2,\mathrm{},n]`$. It follows for the proof of proposition 4.2 that one of the $`R_k`$ is of the form $`((1,\pm j))`$. Since $`E=X`$ if and only if $`X^lEX^l=X`$ for any integer $`l`$, we may assume $`R_k=((1,\pm 2))`$. We treat these two cases separately. Suppose that $`R_k=((1,2))`$. We will construct a new lift $`E^{}`$ of $`\gamma `$ satisfying $`E^{}=E`$ and

$$E^{}=\theta (\{R_1\})\mathrm{}\theta (\{R_{k2}\})\theta (\{((1,2))\})\theta (\{R^{}\})\theta (\{R_{k+1}\})\mathrm{}\theta (\{R_n\}),$$

for some reflection $`R^{}`$. To simplify notation we set $`R_{k1}=T`$ so that $`R_{k1}R_k=T((1,2))`$. Since $`T((1,2))[1][2,\mathrm{},n]`$ we know that

$$T((1,3,4,\mathrm{},n,2))$$

so that $`T`$ has one of the forms

1. $`((1,2))`$,
2. $`((i,j))`$ for $`3i<jn`$,
3. $`((1,p))`$ for $`3pn`$ or
4. $`((2,p))`$ for $`3pn`$.

In the first case $`\theta (\{T\})=x_2`$, which commutes with $`\theta (\{((1,2))\})=x_1`$. In the second case, $`\theta (\{T\})=x_{i,j}`$ lies in the subgroup generated by $`\{x_4,\mathrm{}x_n\}`$ and hence also commutes with $`x_1`$. In the third case $`E^{}`$ can be constructed using

$$\theta (\{T\})\theta (\{((1,2))\})=z_{1,p}x_1=x_1x_{2,p}=\theta (\{((1,2))\})\theta (\{((2,p))\})$$

and in the fourth case using

$$\theta (\{T\})\theta (\{((1,2))\})=z_{2,p}x_1=x_1x_{1,p}=\theta (\{((1,2))\})\theta (\{((1,p))\}).$$

After $`k1`$ such steps we get $`E=x_1\theta (\{S_2\})\mathrm{}\theta (\{S_n\})`$, where the product on the right is a lift of $`\gamma `$ to $`A(D_n)`$. However, this means $`S_2S_3\mathrm{}S_n=((1,2,\mathrm{},n))`$ in $`C_n`$ so that $`S_i\mathrm{\Sigma }_n<C_n`$ and

$$\theta (\{S_2\})\mathrm{}\theta (\{S_n\})=x_2x_3\mathrm{}x_n,$$

by Lemma 4.6 of . Next suppose $`R_k=((1,2))`$. As in the previous case, we will construct a new lift $`E^{}`$ of $`\gamma `$ satisfying $`E^{}=E`$ and

$$E^{}=\theta (\{R_1\})\mathrm{}\theta (\{R_{k2}\})\theta (\{((1,2))\})\theta (\{R^{}\})\theta (\{R_{k+1}\})\mathrm{}\theta (\{R_n\}),$$

for some reflection $`R^{}`$. To simplify notation we again set $`R_{k1}=T`$ so that $`R_{k1}R_k=T((1,2))`$. Since $`T((1,2))[1][2,\mathrm{},n]`$ we know that

$$T((1,3,4,\mathrm{},n,2))$$

so that $`T`$ has one of the forms

1. $`((1,2))`$,
2. $`((i,j))`$ for $`3i<jn`$,
3. $`((1,p))`$ for $`3pn`$ or
4. $`((2,p))`$ for $`3pn`$.

In the first case $`\theta (\{T\})=x_1`$, which commutes with $`\theta (\{((1,2))\})=x_2`$. In the second case, $`\theta (\{T\})=x_{i,j}`$ lies in the subgroup generated by $`\{x_4,\mathrm{}x_n\}`$ and hence also commutes with $`x_2`$. In the third case $`E^{}`$ can be constructed using

$$\theta (\{T\})\theta (\{((1,2))\})=x_{1,p}x_{1,2}=x_{1,2}x_{2,p}=\theta (\{((1,2))\})\theta (\{((2,p))\}).$$

In the fourth case $`E^{}`$ is constructed using

$$\theta (\{T\})\theta (\{((1,2))\})=z_{2,p}x_2=x_2z_{1,p}=\theta (\{((1,2))\})\theta (\{((1,p))\}).$$

The middle equality holds since

$$z_{2,p}x_2x_1=z_{2,p}x_1x_2=x_1x_{1,p}x_2=x_1x_2x_{2,p}=x_2x_1x_{2,p}=x_2z_{1,p}x_1.$$

After $`k1`$ such steps we get $`E=x_2\theta (\{S_2\})\mathrm{}\theta (\{S_n\})`$, where the product on the right is a lift of $`\gamma `$ to $`A(D_n)`$. However, this means $`S_2S_3\mathrm{}S_n=((1,2,\mathrm{},n))`$ in $`C_n`$ so that $`S_i`$ lie in the copy of $`\mathrm{\Sigma }_n`$ generated $`\{((1,2)),((2,3)),\mathrm{},((n1,n))\}`$ and

$$\theta (\{S_2\})\mathrm{}\theta (\{S_n\})=x_1x_3\mathrm{}x_n,$$

by Lemma 4.6 of . Finally

$$E=x_2x_1x_3\mathrm{}x_n=x_1x_2x_3\mathrm{}x_n.$$

q.e.d.Combining the results in this subsection we get the following theorem.

###### Theorem 6.15.

The poset group $`\mathrm{\Gamma }(D_n,\gamma )`$ is isomorphic to the Artin group $`A(D_n)`$ for $`\gamma `$ a Coxeter element in $`D_n`$.


format: text

text:
# Scaling of 𝐻_{𝑐2⟂}(𝑇) in Nb/CuMn Multilayers

## I INTRODUCTION

The issue of the proximity effect in superconducting multilayers has been intensely studied since the early sixties. In particular since superconductivity and magnetism are two mutually excluding phenomena a lot of interest has been devoted to the analysis of superconducting (S)/magnetic (M) multilayers. Several theoretical and experimental studies have been done on these systems, in particular about the existence of the so-called $`\pi phase`$ state which manifests itself in a nonmonotonic behavior of the transition temperature $`T_c`$ of the S/M multilayers as a function of the magnetic layers thickness $`d_M`$. Numerous experiments about the behavior of $`T_c`$ versus $`d_M`$ have been reported on different S/M multilayers: However the presence of $`T_c`$ oscillations is still an open question and further theoretical investigation is needed. In particular in the case of Nb/CuMn multilayers (where CuMn is a spin glass) the presence of a small Mn percentage ($``$ 0.7 %) in copper gives rise to a nonmonotonic behavior of $`T_c`$ versus $`d_M`$  which cannot be explained in the framework of the conventional proximity theory even when taking into account a paramagnetic pair breaking mechamism.

Another interesting feature of S/M multilayers is the temperature behavior of the upper critical magnetic field, both in the direction parallel, $`H_{c2}(T)`$, and perpendicular, $`H_{c2}(T)`$, to the plane of the film, which shows deviations from the S/N case (here N is a normal metal). Measurements performed on V/Fe multilayers revealed a good agreement with the theoretical predictions for S/M multilayers. Both $`H_{c2}(T)`$ and $`H_{c2}(T)`$ could be consistently described using the same value for the only free parameter of the theory. On the other hand the same measurements performed on Nb/CuMn samples with 2.7 % and 4.5 % of Mn could be only qualitatively described by the same theory, probably due to the much more complicated nature of a spin glass system with respect to the ferromagnetic case.

In this paper we report on measurements of the perpendicular upper critical magnetic field as a function of temperature in Nb/CuMn multilayers. A large number of samples have been measured with different Mn percentage and different layering, also in the presence of a regular array of antidots. Regardeless of the specific nature of the multilayers, the measurements for the samples with low percentage of Mn in the CuMn layers (up to 2.7 %) are in agreement with the Werthamer-Helfand-Honenberg (WHH) theory, which describes the behavior of conventional type-II superconductors. This result indicates that $`H_{c2}(T)`$ measurements are less sensitive to the presence of Mn than the measurements of $`T_c`$ versus the magnetic layers thickness. However for sufficiently high Mn concentration a different theoretical approach is needed to describe the data.

## II EXPERIMENT

Nb/CuMn multilayers have been fabricated by using a dual-source magnetically enhanced dc triode sputtering system with a movable substrate holder on Silicon (100) substrates. The bottom layer is CuMn and the top layer is Nb for all the samples. Some of the samples are patterned into 200$`\times `$200 $`\mu `$m2 zones with a regular array of antidots and suitable contact pads. The preparation details for these samples, obtained by lift-off procedure, are reported elsewhere. All the samples present good superconducting properties and a well defined layered structure as shown by low angle X-ray diffraction patterns.

Transport measurements have been performed with a standard dc four probe technique with magnetic field applied perpendicular to the plane of the film. In figure 1 the resistive transitions of one of the analyzed samples (sample A(20)1) are reported at different values of the external perpendicular magnetic field. The $`H_{c2}(T)`$ values have been obtained from the $`R(T)`$ curves, at different applied magnetic fields, using the 50% $`R_N`$ criterion, where $`R_N`$ is the normal state resistance just before the transition to the superconducting state. However, even if different criteria are used to extract the $`H_{c2}(T)`$ from $`R(T,H)`$ curves, no substantial differences are observed in the results. We have also occasionally performed $`R(H)`$ measurements at different temperatures to extract the $`H_{c2}`$ value for each temperature at the intersection point between the flux flow regime and the normal state resistance. The critical magnetic field values obtained with the two different methods are always in good agreement with each other.

Table I shows the sample characteristics: Nb thickness $`d_S`$, CuMn (Cu) thickness $`d_M`$, Mn percentage, number of bilayers, superconducting critical temperature $`T_c(K)`$ and anisotropy ratio $`\zeta =H_{c2}(0)/H_{c2}(0)`$. A column is added in the end to point out the patterned samples with the array of antidots.

## III RESULTS AND DISCUSSION

The upper critical field measurement allows us to investigate the nature of the pair-breaking mechanism present in our superconducting-spin glass multilayers. Figure 2 shows the reduced perpendicular critical magnetic field $`h_{c2}=H_{c2}/[T_c(dH_{c2}/dT)|_{T=T_c}]`$ as a function of the reduced temperature $`t=T/T_c`$ for all the investigated samples. The data have been analyzed in the framework of the WHH theory which widely describes the $`H_{c2}(T)`$ behavior of bulk type-II superconductors, including the case where the effect of applied magnetic field on the electron spin magnetic moments cannot be neglected. In particular Pauli spin paramagnetism and spin-orbit scattering are taken into account, respectively through the parameters $`\alpha `$ and $`\lambda _{so}`$, which appear in the implicit equation for the reduced field $`h_{c2}`$:

$$ln\left(\frac{1}{t}\right)=\left(\frac{1}{2}+\frac{i\lambda _{so}}{2\gamma }\right)\mathrm{\Psi }\left(\frac{1}{2}+\frac{\overline{h}_{c2}+\frac{1}{2}\lambda _{so}+i\gamma }{2t}\right)+\left(\frac{1}{2}\frac{i\lambda _{so}}{2\gamma }\right)\mathrm{\Psi }\left(\frac{1}{2}+\frac{\overline{h}_{c2}+\frac{1}{2}\lambda _{so}i\gamma }{2t}\right)\mathrm{\Psi }\left(\frac{1}{2}\right)$$
(1)
where $`\psi `$ is the digamma function, $`\overline{h}_{c2}=(4/\pi ^2)h_{c2}`$ and $`\gamma =[(\alpha \overline{h}_{c2})^2((1/2)\lambda so)^2]^{1/2}`$.

While data for all the multilayers with high Mn percentage are not described by the WHH theory, for the samples with Mn percentage up to 2.7 all the experimental points collapse on the WHH curve calculated for the case $`\alpha =\lambda _{so}=0`$. This quite surprising result indicates that a small percentage of Mn does not significantly influence the $`H_{c2}(T)`$ curves and Nb/CuMn multilayers behave, at least for temperatures down to $`t=0.3`$, like ordinary type-II superconductors. $`H_{c2}(T)`$ measurements are then less sensitive to Mn concentration than measurements of $`T_c`$ versus $`d_M`$. A nonmonotonic $`T_c(d_M)`$ dependence was observed even for 0.7 % of Mn, revealing an unconventional proximity effect in the system, while 2.7 % of Mn is still not sufficient to cause an appreciable deviation from a conventional $`H_{c2}(T)`$ behavior.

In figure 2 measurements for a Nb/Cu multilayer, the sample M(0), are also shown. Again these data collapse on the WHH curve with $`\alpha =\lambda _{so}=0`$. Same results have been obtained for Nb/Pd multilayers. On the other hand data from samples with high Mn percentage cannot be fitted to the WHH theory even in the case $`\alpha 0`$ and $`\lambda _{so}0`$. In fact in the $`h_{c2}t`$ plane all these data lie above the points obtained in the small Mn percentage case, while theoretical curves with $`\alpha `$, $`\lambda _{so}0`$ are always below the $`\alpha =\lambda _{so}=0`$ curve. Similar results apply for V/Fe and Nb/Gd multilayers and Nb/Pd1-xFex/Nb triple layers, with $`x0`$, when plotted in the WHH fashion. Also in these cases the data lie above the WHH curve with $`\alpha =\lambda _{so}=0`$. These results show that an additional pair breaking mechanism, which is not taken into account in the WHH theory, is present both in superconducting/ferromagnetic and some superconducting/spin glass multilayers, such as Nb/CuMn with high Mn percentage ($`>`$ 2.7 %). In this case a realistic explanation requires theories which explicitly take into account the magnetic nature of the non superconducting material in the multilayers.

## IV CONCLUSIONS

Measurements of $`H_{c2}(T)`$ have been performed on several Nb/CuMn multilayers with different Mn percentage in the CuMn layers, also in the presence of regular array of antidots. It is found that the $`H_{c2}(T)`$ curves for samples having low Mn percentage are described by a conventional theory for type-II superconductors despite the magnetic nature of the samples, regardless of the layering and of a more complicated structure, i.e. if a regular array of antidots is present.

Table I. Relevant sample parameters. See the text for the meaning of the listed quantities.

| Sample | $`d_S`$ $`(\mathrm{\AA })`$ | $`d_M`$ $`(\mathrm{\AA })`$ | % Mn | $`\mathrm{N}_{\mathrm{bil}}`$ | $`T_c(K)`$ | $`\zeta `$ | Antidot lattice |
| --- | --- | --- | --- | --- | --- | --- | --- |
| M(27)1 | 260 | 6 | 2.7 | 10 | 6.02 | 1.0 | No |
| M(27)2 | 260 | 9 | 2.7 | 10 | 5.42 | 1.0 | No |
| M(27)3 | 260 | 11 | 2.7 | 10 | 4.96 | 1.2 | No |
| M(27)4 | 260 | 16 | 2.7 | 10 | 4.22 | 1.8 | No |
| M(27)5 | 260 | 19 | 2.7 | 10 | 4.03 | 3.3 | No |
| M(27)6 | 260 | 24 | 2.7 | 10 | 4.58 | 3.1 | No |
| M(27)7 | 260 | 29 | 2.7 | 10 | 4.50 | 5.0 | No |
| M(45)1 | 350 | 4 | 4.5 | 10 | 6.67 | 1.37 | No |
| M(45)2 | 350 | 11 | 4.5 | 10 | 5.46 | 1.74 | No |
| M(45)3 | 350 | 15 | 4.5 | 10 | 3.78 | 1.45 | No |
| M(45)4 | 350 | 29 | 4.5 | 10 | 3.67 | 7.23 | No |
| M(45)5 | 350 | 32 | 4.5 | 10 | 3.61 | 5.41 | No |
| A(20)1 | 250 | 8 | 2 | 6 | 7.54 | 1.46 | Yes |
| A(20)2 | 250 | 12 | 2 | 6 | 7.38 | 1.36 | Yes |
| A(20)3 | 250 | 20 | 2 | 6 | 6.96 | 1.41 | Yes |
| A(20)4 | 250 | 24 | 2 | 6 | 6.66 | 1.72 | Yes |
| A(20)5 | 250 | 28 | 2 | 6 | 6.5 | 1.76 | Yes |
| M(0) | 200 | 200 | 0 | 10 | 6.67 | 1.6 | No |