\documentclass[12pt]{article}
\textheight 8.6in
\textwidth 6.0in
\setlength{\unitlength}{0.2cm}
\usepackage{amssymb,amsmath}
\usepackage{rotating}
\renewcommand{\theequation}{\thesection.\arabic{equation}}
\renewcommand{\arraystretch}{1.3}
\setlength{\tabcolsep}{1mm}
\begin{document}
\title{\bf Root systems for two dimensional complex reflection groups}

\author{Mervyn C Hughes\thanks{Department of Mathematics,
King Edward College, Nuneaton CV11 4BE, England, U.K.} \and 
Alun O Morris\thanks{Department of Mathematics,
 University of Wales, Aberystwyth, Ceredigion SY23 3BZ, Wales, U.K.}}
\date{}
\maketitle

\begin{abstract}

Root systems for all real reflection groups have been known for a long time. 
A M Cohen (1976) extended the idea of root systems to complex reflection groups:
furthermore he explicitly presented root systems for all dimensions greater than two.
Here, root systems are given for the two dimensional complex reflection groups which are
generated by two reflections.

\end{abstract}

%First page headline in LaTeX for S\'eminaire Lotharingien de Combinatoire
%--first part
\thispagestyle{myheadings}
\font\rms=cmr8 
\font\its=cmti8 
\font\bfs=cmbx8
\markright{\its S\'eminaire Lotharingien de
Combinatoire \bfs 45 \rms (2001), Article~B45e\hfill}
\def\thepage{}
%
%

\section{\bf Introduction.}

In 1954, Shephard and Todd \cite{Sh&Todd} completely classified the finite complex reflection groups.
In 1967 Coxeter \cite{cox2} gave presentations for all the $n$ dimensional finite complex
reflection groups generated by $n$ reflections. He introduced a graphical notation
for these groups as follows.

If the presentation has $n$ generators $r_{1}, \ldots ,r_{n}$ then the graph consists of $n$
nodes. If $r_{i}$ is of order $m$, then the number $m$ is written inside the node, although if
$m=2$, then by convention the number 2 may be omitted. If $r_{i}$ and $r_{j}$ commute, then the
corresponding nodes are not joined. If $r_{i}$ and $r_{j}$ do not commute then they are related
by the braid relation
$$\underbrace{r_{i}r_{j}r_{i} \ldots}_{e} = \underbrace{r_{j}r_{i}r_{j} \ldots}_{e}$$
with $e$ factors on each side for some $e\in {\mathbb {N}}$ and the corresponding
nodes are joined by an edge of weight $e$, which is omitted (by convention)
when $e=3$. Coxeter shows that if the graph is not a tree (that is, it contains no cycles),
then it contains a subgraph which is a triangle with a number $k$ written inside (as this
paper will mainly be involved with groups generated by two generators, we will use $s$ and $t$
to denote the generators (and $u$ if a third generator is involved))


\setlength{\unitlength}{1mm}
\begin{center}
\begin{picture}(30,25)
\put(3,5){\circle{4}}
\put(21,5){\circle{4}}
\put(12,19){\circle{4}}
\put(5,5){\line(1,0){14}}
\put(4,7){\line(2,3){7}}
\put(20,7){\line(-2,3){7}}
\put(2,4){2}
\put(20,4){2}
\put(11,18){2}
\put(2,0){$t$}
\put(20,0){$u$}
\put(11,22){$s$}
\put(11,2){$g$}
\put(5,12){$e$}
\put(17,12){$f$}
\put(11,10){$k$}
\end{picture}
\end{center}

\vspace{0.25cm}

%First page headline in LaTeX for S\'eminaire Lotharingien de Combinatoire
%--restoring the headers and pagenumbering
\pagenumbering{arabic}
\addtocounter{page}{1}
\markboth{\small Mervyn Hughes and Alun Morris}
{\small Root systems for two dimensional complex reflection groups}
%
%

The corresponding group has relations 
$$(stut)^{k}=1, (st)^{e}=(su)^{f}=(tu)^{g}=1.$$
Coxeter showed that in all cases, the orders of $s,t,u$ is 2 and that
at least two of the edges have weight 3.

Inspired by these graphs and by root systems associated with real reflection groups
(see, for example, Bourbaki \cite{bour}), in 1976 Cohen \cite{cohen} defined root graphs and
root systems connected with finite complex reflection groups for dimension greater
than 2. Our aim in this paper is to obtain root graphs and root systems associated with two dimensional
complex reflection groups which are generated by two reflections.

We concern ourselves with a graph with two nodes

\begin{center}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$m$}
\put(20,5){$p$}
\put(2,2){$s$}
\put(20,2){$t$}
\put(11,7){$e$}
\end{small}
\end{picture}
\end{center}
with presentation

$$s^{m}=t^{p}=1,\; \underbrace{sts \ldots }_{e}=
\underbrace{tst \ldots }_{e}.$$
Coxeter also used the notation $m[e]p$ for this presentation.

Although the classification of such finite reflection groups is of long standing
(see, for example, Coxeter \cite{cox} and Koster \cite{koster}), we give a new classification which
simultaneously leads in a natural way to root graphs and root systems for these
groups. This is done by first introducing certain polynomials $f_{l}(x),\; l \geq 0$
and then determining which of these are admissible, that is, have all their roots in
$(0,1)$. It turns out that the irreducible two dimensional complex reflection groups
are in one-one correspondence with these polynomials; furthermore, their roots
provide a natural way of forming the corresponding root graphs and root systems.

We remark that if $e$ is odd, then relation
$$\underbrace{sts \ldots }_{e}=
\underbrace{tst \ldots }_{e}$$
can be written as

$$(st)^{(e-1)/2}s\;=\;(ts)^{(e-1)/2}t.$$

Thus, the generators $s$ and $t$ are conjugate and therefore of the same order.
Hence if $e$ is odd, then $p=m$. We see later that this condition arises naturally
in the classification via the above polynomials.

More recently, complex reflection groups have been given more prominence\break through the work of M. Brou\'{e}, G. Malle and R. Rouquier \cite{bm},\cite{bmr1},\cite
{bmr2} in their work on the representation theory for reductive algebraic
groups. In particular, they have given presentations for all finite complex reflection groups in the style of those given by Coxeter. Also, they have
presented diagrams which generalise Coxeter diagrams in an interesting way.
We present our results so that they are consistent with these recent developments. 


\section{\bf Preliminaries.}\label{prel}

In this section, the basic definitions and notation required later
are given following the approach in \cite{cohen},\cite{hughes1}.

Let $V$ be a complex vector space of dimension $n$.
A {\it reflection} in $V$ is a linear transformation of $V$
of finite order with exactly $(n-1)$ eigenvalues equal to 1.
A {\it reflection group} $G$ in $V$ is a group generated by reflections
in $V$. There exists a unitary inner product $(\; ,\;)$ on $V$
invariant under $G$. A reflection group $G$ is said to be
$r$-dimensional if the dimension of the subspace $V^{G}$ of points fixed
by $G$ is $n-r$. The group $G$ is irreducible if the restriction to a
$G$-invariant complement of $V^{G}$ in $V$ is irreducible.

A (unitary) {\it root} of a reflection in $V$ is an eigenvector (of
length 1) corresponding to the unique eigenvalue not equal to 1
of the reflection. A (unitary) {\it root} of $G$ is a (unitary) root
of a reflection in $G$.

Let $s$ be a reflection in $V$ of order $m>1$. There exists
$v \in {V}, v\neq 0$ and a primitive $mth$ root of unity $\zeta$
such that
\begin{eqnarray*}
s_{v,m}x = x-(1-\zeta)(x,v)(v,v)^{-1}v
\end{eqnarray*}
for all $x\in V$, where $s= s_{v,m}$. If $t$ is any unitary
transformation of $V$, we have
\begin{eqnarray*}
ts_{v,m}t^{-1}=s_{tv,m}.
\end{eqnarray*}
Define ${\theta}_{G}:V\rightarrow {\mathbb {N}}$ by ${\theta}_{G}(v)=
|G_{W}|$, where $W=<v>^{\bot}, v \in V$. The number ${\theta}_{G}(v)$
is called the {\it  order} of $v$ (with respect to $G$).

A {\it vector graph} is a pair $(B,\theta)$, where $B$ is a non-empty
finite subset ${\mathbb {C}}^{\infty}$, such that for all $u,v \in B, |(u,v)|=1$
if and only if $u=v$ and ${\theta}$ is a map from $B$ to ${\mathbb {N}}\setminus\{1\}$. We
say that $B$ is the set of {\it vertices} and $\theta(v)$, for $v \in b$
, is the {\it order} of $v$. Let $\Gamma =(B,\theta)$ be a vector graph.
Then, we define dim $\Gamma$ to be the dimension of the vector space spanned by $B$, and
$W(\Gamma)$ to be the group generated by all the reflections $s_{v,\theta(v)}$ for
$v \in B$. The vector graph $\Gamma$ is called a {\it root graph} if

(i) dim $\Gamma=|B|$

\vspace{0.1in}

(ii) $W(\Gamma)$ is a finite reflection group.

We say that $\Gamma$ is {\it irreducible} if $W(\Gamma)$ is irreducible in dim $\Gamma$
(or that $\Gamma$ is connected). Thus in Section 3 we restrict ourselves to the
classification of irreducible root graphs. The vector graph $\Gamma$ is said
to be {\it congruent} to the vector graph ${\Gamma}^{\prime}=(B^{\prime},{\theta}^{\prime})$
if there is a $t\in {\bf Gl}({\mathbb {C}}^{\infty})$ such that ${\theta}^{\prime}(tv)={\theta}(v)$
for $v\in B$ and the elements of $B$ are eigenvectors of $t$.

In this paper we only concern ourselves with vector graphs with two
nodes (since we only consider two-dimensional reflection groups generated by two
reflections).

Let $B=\{u,v\}$. To $u$ is assigned the value $\theta(u)$ [and $\theta(v)$ to $v$] and to the edge is
assigned the value $(u,v)$, together with an arrow from $u$ to $v$.

For example, if $\theta(u)=m$ and $\theta(v)=p$ and $(u,v)=\alpha$,
then the vector graph is
\begin{center}
\begin{picture}(25,10)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\vector(1,0){8}}
\put(13,6){\line(1,0){6}}
\begin{small}
\put(2,5){$m$}
\put(20,5){$p$}
\put(2,2){$u$}
\put(20,2){$v$}
\put(11,8){$\alpha$}
\end{small}
\end{picture}
\end{center}
We adopt the following conventions.

(i) If $m=2$, we may omit the number $2$.

\vspace{0.1in}

(ii) If $\alpha \in {\mathbb {R}}$, the arrow is omitted.

\vspace{0.1in}

(iii) If $l=m$ and $\alpha=-1/2$, we may omit the value $-1/2$.

A pair $(R,f)$ consisting of

(i) a finite set $R$ of non-zero elements of ${\mathbb {C}}^{\infty}$,

\vspace{0.1in}

(ii) a map $f:R\rightarrow{\mathbb {N}}\setminus\{1\}$ such that for all ${u,v\in R}, 
s_{u,f(u)}R=R$ and $f(s_{u,f(u)}v)=f(v)$ is called a {\it pre-root system}.
To $\Sigma=(R,f)$ is associated the reflection group $W(\Sigma)$
defined by $W(\Sigma)=<s_{u,f(u)}|u \in R>$.

A pre-root system $\Sigma$ is called a {\it root system} if in addition

(iii) $\alpha u \in R$ if and only if $\alpha u \in {W(\Sigma)u}$
for all ${u \in R}, {\alpha \in \mathbb {C}}.$

If $(B,\theta)$ is a root graph with $B=\{e_{1}, \ldots ,e_{n}\},$
then $det((e_{i},e_{j}))$ is a positive real number.

A group $G$ of unitary automorphisms of $V$ is said to be {\it imprimitive}
if $V$ is a direct sum $V= V_{1} \oplus \cdots \oplus V_{k}$
of non-trivial proper subspaces $V_{i}(1\leq i\leq k)$ of $V$ such that
$V_{i}$ is invariant under $G$. If such a direct splitting of $V$ does not exist,
$G$ is said to be {\it primitive}.

Let ${\mathcal S}_{n}$ be the (symmetric) group of all $n\times n$ permutation
matrices and let $A(m,p,n)$ be the set of all diagonal $n\times n$ matrices with
$\zeta^{{\rho}_{i}},\rho_{i} {\in {\mathbb {Z}}}$ in the $(i,i)$ position, where
$\zeta$ is a primitive $m$th root of unity and $\sum_{i=1}^{n}\rho_{i} \equiv 0 \pmod{p} $.
Define $G(m,p,n)=A(m,p,n)\rtimes{\mathcal S}_{n}$, then the imprimitive groups in $V$
are of the form $G(m,p,n)$, where $p|m$.

\newtheorem{remark}{Remark}[section]
\begin{remark}
(i) $G(m,m,2)$ is conjugate to $W(I_{2}(m))$ (notation of \cite{bour}), the dihedral group
of order $2m$.

\vspace{0.1in}

(ii) $G(1,1,n)=W(A_{n-1})\cong{\mathcal S}_{n}$, the Weyl group of type $A_{n-1}$.

\vspace{0.1in}

(iii) $G(2,1,n)=W(B_{n})$, the Weyl group of type $B_{n}$.

\vspace{0.1in}

(iv) $G(2,2,n)=W(D_{n})$, the Weyl group of type $D_{n}$.

\vspace{0.1  in}

(v) If $p\neq 1$, then $G(m,p,n)$ can be defined with $n+1$ generating reflections, but for
$p=1,m$, $n$ generating reflections are sufficient.
\end{remark}

Thus when $n=2$, only two of these groups, namely $G(m,m,2)$ and $G(m,1,2)$, are generated
by two reflections.

The group $G(m,m,2)$ is generated by reflections of order 2 corresponding to the root graph
$\{\frac{1}{\sqrt2}(\epsilon_{1}-\epsilon_{2}),\frac{1}{\sqrt2}(\epsilon_{1}-\zeta\epsilon_{2})\}$
and the group $G(m,1,2)$ is generated by reflections of orders 2 and $m$ respectively corresponding 
to the root graph $\{\frac{1}{\sqrt2}(\epsilon_{1}-\epsilon_{2}),\epsilon_{2}\}$. Thus, the vector
graphs are
respectively, which root graphs with the following root systems:
\[\Sigma(m,m,2)=(R(m,m,2),f)\]
where $R(m,m,2)=\pm\mu_{m}\{\frac{1}{\sqrt2}(\epsilon_{1}-\zeta^{k}\epsilon_{2}),1\leq k\leq m\}$
and
\[\Sigma(m,1,2)=(R(m,m,2)\cup R_{2},f)\]
where $R_{2}=\mu_{m}\{\epsilon_{1},\epsilon_{2}\}$ and $f(R(m,m,2))=2$ and
$f(R_{2})=m$ and where \newline $\mu_{m}=\{\zeta^{k}|1\leq k\leq m\}$. Here and later,
$\{\epsilon_{1},\epsilon_{2}\}$ is the standard basis for ${\mathbb {C}}^{2}$.
   


\section{\bf Classification of two-dimensional reflection\break groups.}
\noindent

In this section, we consider certain polynomials which are used later
in the classification.

Let $l,m,p\; {\in \mathbb {N}}$ and $\zeta$ and $\xi$ be
primitive $mth$ and $pth$ roots of unity respectively. A
sequence of polynomials $\{f_{l}(x):=f_{l,m,p}(x) \in {\mathbb{C}}[x]\}$
are defined
as follows:-

Put
\begin{eqnarray*}
f_{1}(x)=f_{2}(x)=1.
\end{eqnarray*}

If $l$ is even, $l\geq2,$ put
\begin{eqnarray}\label{eq:3.1}
f_{l+1}(x) & = & xf_{l}(x)+\frac{\zeta}{(1-\zeta)(1-\xi)}f_{l-1}(x)  
\end{eqnarray}
\begin{eqnarray}\label{eq:3.2}
f_{l+2}(x) & = & f_{l+1}(x)+\frac{\xi}{(1-\zeta)(1-\xi)}f_{l}(x).
\end{eqnarray}

It is easily seen that $f_{l}(x)$ is a monic polynomial of degree
$\lfloor(l-1)/2\rfloor$, where $\lfloor i \rfloor$ denotes the integer
part of $i$. For smaller values of $l$, these polynomials are
calculated explicitly as these are required later in the classification
we give the $f_{l}(x)$ for $3\leq l \leq10.$

\begin{tiny}
\begin{eqnarray*}
f_{3}(x)&=&x+\frac{\zeta}{(1-\zeta)(1-\xi)} \\
f_{4}(x)&=&x+\frac{\zeta+\xi}{(1-\zeta)(1-\xi)} \\
f_{5}(x)&=&x^{2}+\frac{2\zeta+\xi}{(1-\zeta)(1-\xi)}x
+\frac{\zeta^{2}}{(1-\zeta)^{2}(1-\xi)^{2}} \\
f_{6}(x)&=&x^{2}+\frac{2(\zeta+\xi)}{(1-\zeta)(1-\xi)}x
+\frac{\zeta^{2}+\zeta\xi+\xi^{2}}{(1-\zeta)^{2}
(1-\xi)^{2}} \\
f_{7}(x)&=&x^{3}+\frac{3\zeta+2\xi}{(1-\zeta)(1-\xi)}x^{2}
+\frac{3\zeta^{2}+2\zeta\xi+\xi^{2}}{(1-\zeta)^{2}
(1-\xi)^{2}}x+\frac{\zeta^{3}}{(1-\zeta)^{3}(1-\xi)^{3}} \\
f_{8}(x)&=&x^{3}+\frac{3(\zeta+\xi)}{(1-\zeta)(1-\xi)}x^{2}
+\frac{3\zeta^{2}+4\zeta\xi+3\xi^{2}}{(1-\zeta)^{2}
(1-\xi)^{2}}x+\frac{\zeta^{3}+\zeta^{2}\xi+
\zeta\xi^{2}+\xi^{3}}{(1-\zeta)^{3}(1-\xi)^{3}} \\
f_{9}(x)&=&x^{4}+\frac{4\zeta+3\xi}{(1-\zeta)(1-\xi)}x^{3}
+\frac{6\zeta^{2}+6\zeta\xi+3\xi^{2}}{(1-\zeta)^{2}
(1-\xi)^{2}}x^{2}+\frac{4\zeta^{3}+3\zeta^{2}\xi+
2\zeta\xi^{2}+\xi^{3}}{(1-\zeta)^{3}(1-\xi)^{3}}x
+\frac{\zeta^{4}}{(1-\zeta)^{4}(1-\xi)^{4}}  \\
f_{10}(x)&=&x^{4}+\frac{4(\zeta+\xi)}{(1-\zeta)(1-\xi)}x^{3}
+\frac{6\zeta^{2}+9\zeta\xi+6\xi^{2}}{(1-\zeta)^{2}
(1-\xi)^{2}}x^{2}+\frac{4\zeta^{3}+6\zeta^{2}\xi+
6\zeta\xi^{2}+4\xi^{3}}{(1-\zeta)^{3}(1-\xi)^{3}}x
+\frac{\zeta^{4}+\zeta^{3}\xi+
\zeta^{2}\xi^{2}+\zeta\xi^{3}+
\xi^{4}}{(1-\zeta)^{4}(1-\xi)^{4}}.  \\
\end{eqnarray*}
\end{tiny}

Easy calculations show that
\begin{equation}\label{eq:3.3}
\frac{\zeta+\xi}{(1-\zeta)(1-\xi)}=
-\frac{1}{2} \left( 1+cot\frac{\pi}{m}cot\frac{\pi}{p} \right) 
\end{equation}
\begin{equation}\label{eq:3.4}
\frac{\zeta}{(1-\zeta)^{2}}=-\frac{1}{4}cosec^{2}\frac{\pi}{m},\;
\frac{\xi}{(1-\xi)^{2}}=-\frac{1}{4}cosec^{2}\frac{\pi}{p}.
\end{equation}
Thus, for example,
\begin{eqnarray*}
f_{4}(x)=
x-\frac{1}{2} \left( 1+cot\frac{\pi}{m}cot\frac{\pi}{p} \right). 
\end{eqnarray*}

We now prove some easy results concerning these
polynomials which are required later.

\newtheorem{lemma}[remark]{Lemma}
\begin{lemma}
(i)If $l$ is even, $l\geq4,\;$ then
\begin{equation}\label{eq:3.5}
f_{l+2}(x)=f_{l}(x)f_{4}(x)-
\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}f_{l-2}(x)
\end{equation}
\begin{equation}\label{eq:3.6}
f_{l+3}(x)=x \left( f_{l}(x)f_{4}(x)-
\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}f_{l-2}(x) \right) +
\frac{\zeta}{(1-\zeta)(1-\xi)}f_{l+1}(x)  
\end{equation}

(ii)If $l$ is even, then $f_{l}(x)\in {\mathbb {R}}[x].$

\vspace{0.1in}

(iii)If $l$ is odd and $\xi=\zeta$, then $f_{l}(x)\in {\mathbb {R}}[x].$
\end{lemma}
{\bf Proof.} From (3.1),(3.2) and (3.4), we obtain
\begin{eqnarray*}
f_{l+2}(x)&=&xf_{l}(x)+\frac{\zeta}{(1-\zeta)(1-\xi)}f_{l-1}(x)+
\frac{\xi}{(1-\zeta)(1-\xi)}f_{l}(x) \\
          &=&f_{l}(x)f_{4}(x)-\frac{\zeta}{(1-\zeta)(1-\xi)}(f_{l}(x)-f_{l-1}(x)) \\
          &=&f_{l}(x)f_{4}(x)-\frac{\zeta\xi}{(1-\zeta)^{2}(1-\xi)^{2}}
f_{l-2}(x) \\
          &=&f_{l}(x)f_{4}(x)-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}f_{l-2}(x) \\ 
\end{eqnarray*}
which proves (3.5). Formula (3.6) now follows directly from (3.2) and (3.4). The proof
of (ii) and (iii) follows from (3.3) by induction on $l$.

\begin{lemma}
(i) The coefficient of $x^{n-1}$ in $f_{2n+2}(x)$ is
\begin{eqnarray*}
\frac{n(\zeta+\xi)}{(1-\zeta)(1-\xi)}&=&-\frac{n}{2} \left( \frac{cos(\frac{\pi}{m}-
\frac{\pi}{p})}{sin\frac{\pi}{m}sin\frac{\pi}{p}} \right) \\
 &=&-\frac{n}{2} \left( 1+cot\frac{\pi}{m}cot\frac{\pi}{p} \right) .
\end{eqnarray*}
(ii) If $l$ is odd and if $\xi=\zeta$ the constant term in $f_{l}(x)$ is
\begin{eqnarray*}
(\zeta(1-\zeta)^{-2})^{l-2}&=& \left( -\frac{1}{4}cosec^{2}\frac{\pi}{m} \right)^{l-2} \in {\mathbb{R}}. 
\end{eqnarray*}
\end{lemma}
{\bf Proof.} The proofs are simple induction arguments and we give a sketch of the proof only.

(i) If $l=2n$, from (3.5) we have
\begin{eqnarray*}
f_{2n+2}(x)&=&f_{2n}(x)f_{4}(x)-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}f_{2n-2}(x). 
\end{eqnarray*}
Since $f_{2n-2}(x)$ and $f_{2n}(x)$ have degrees $n-2$ and $n-1$ respectively, the result follows by induction on $n$
and noting the form of $f_{4}(x)$ given above.

(ii) If $l$ is odd and $\xi=\zeta$, then if we put $x=0$ in (3.6),
the result follows by induction.

\begin{lemma}
If $l$ is even and if $f_{l}(a)=0, f_{l-2}(a)>0$ for some $a\geq 1$, then there
exists $b>1$ such that $f_{m}(b)=0$ for even $m>l$.
\end{lemma}
{\bf Proof.} Since
\begin{eqnarray*}
f_{l+2}(a)&=&f_{l}(a)f_{4}(a)-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}f_{l-2}(a). 
\end{eqnarray*}
and since $f_{l}(a)=0$, we have $f_{l+2}(a)<0$. As the $f_{l}(x)$ are monic, there exist
$a_{1}>a$ such that $f_{l+2}(a_{1})=0$ and $f_{l}(a_{1})>0$. Thus, by induction there exist
$b>1$ such that $f_{m}(b)=0$ for even $m>l$.

\begin{lemma}
If $p=m$ and $f_{l-1}(a)>0$ and $f_{l}(a)=0$ for some $a\geq1$, then there exist
$b>1$ such that $f_{m}(b)=0$ for all $m>l$.
\end{lemma}
{\bf Proof} Whether $l$ is odd or even, since $f_{l}(a)=0$, from (3.1) and (3.2) we have
\begin{eqnarray*}
f_{l+1}(a)&=&-\frac{1}{4}cosec^{2}\frac{\pi}{m}f_{l-1}(a)
\end{eqnarray*}
and so $f_{l+1}(a)<0$. Thus there exist $a_{1}>a$ with $f_{l+1}(a_{1})=0$ and $f_{l}(a_{1})>0$.
Hence, by induction there exist $b>1$ such that $f_{m}(b)=0$ for all $m>l$.

Motivated by the requirements of the classification problem, we now make the 
following definition.

\newtheorem{definition}[remark]{Definition}
\begin{definition}
If $l,m,p \in {\mathbb {N}},m\leq p$, we say the triple $(m,p;l)$ is

(i) {\em admissible} if all the roots of $f_{l}(x)=0$ are in $(0,1)$,

\vspace{0.1in}

(ii) {\em semi-admissible} if all the roots of $f_{l}(x)=0$ are in $[0,1]$ with
one root equal to $1$,

\vspace{0.1in}

(iii) {\em inadmissible} if $f_{l}(x)=0$ has at least one root not in $[0,1]$.

\end{definition}

We now classify the admissible and semi-admissible triples; we do this in a series of lemmas.

\begin{lemma}
If $(m,p;l)$ is admissible then

(i) for $l$ odd, $m=p<6$;

\vspace{0.1in}

(ii) for $l$ even, $(m,p) \in \{(2,m),(3,3),(3,4),(3,5)\}$, where
$m\leq p$.
\end{lemma}
{\bf Proof.} (i) If $l$ is odd, then $f(x) \in {\mathbb{R}}[x]$ only if $p=m$;
thus $f_{l}(x)=0$ can only have real roots if $p=m$. Put $
\xi = \zeta$, then from Lemma 3.2(ii) we have 
$0\leq|\frac{1}{4}cosec^{2}\frac{\pi}{m}|\leq1$, which implies that $m<6$ as required.

(ii) If $l$ is even, then from Lemma 3.2(i), the sum of the roots of $f_{l}(x)=0$ is
$\frac{k}{2}(1+cot\frac{\pi}{m}cot\frac{\pi}{p})$, where $k$ is the degree
of $f_{l}(x)$. Since $(m,p;l)$ is admissible, all the roots are in $(0,1)$ and so
\begin{eqnarray*}
\frac{k}{2} \left (1+cot\frac{\pi}{m}cot\frac{\pi}{p} \right) &<&k,
\end{eqnarray*}
that is, $tan\frac{\pi}{m}tan\frac{\pi}{p}>1$, which gives the required result.

\begin{lemma}
If $(m,m;l-1)$ is admissible and $(m,m;l)$ is semi-admissible 
then\break $(m,m;r)$
is inadmissible for $r>l$.
\end{lemma}
{\bf Proof.} As $(m,m;,l-1)$ is admissible and $(m,m;l)$ is semi-admissible we
have $f_{l-1}(1)>0$ and $f_{l}(1)=0$. The result now follows from Lemma 3.4.

\begin{lemma}
If $m>2$, then

(i) The triple $(m,m;l)$ is admissible if and only if $(m,m;l)=(3,3;l),(l=3,4,5),(4,4,3),\\
(5,5;3)$;

\vspace{0.1in}

(ii) The triple $(m,m;l)$ is semi-admissible if and only if $(m,m;l)=(3,3;6),\\(4,4;4),
(6,6;3)$
\end{lemma}
{\bf Proof.}
If $l=3$, then $f_{3}(x)=x-\frac{1}{4}cosec^{2}\frac{\pi}{m}$ and
$0<\frac{1}{4}cosec^{2}\frac{\pi}{m}<1$ if and only if $m=2,3,4,5$. Furthermore, for $m=6$,
$f_{3}(1)=0$ and so $(6,6;3)$ is semi-admissible.

If $l=4$, then $f_{4}(x)=x-\frac{1}{2}cosec^{2}\frac{\pi}{m}$, and we see that
\[
\frac{1}{2}cosec^{2}\frac{\pi}{m} \left\{ \begin{array}{cl}
                                  <1  & \mbox{if m=2 or 3}\\
                                  =1  & \mbox{if m=4}\\
                                  >1  & \mbox{if $m\geq5$},
                                  \end{array}
\right. \]
which proves that $(2,2;4)$ and $(3,3;4)$ are admissible, $(4,4;4)$ is semi-admissible
and that $(m,m;4)$ is inadmissible if $m\geq 5$.

If $l=5$, then
\begin{eqnarray*}
f_{5}(x)&=&x^{2}+\frac{3\zeta}{(1-\zeta)^{2}}x+\frac{\zeta^{2}}{(1-\zeta)^{4}},
\end{eqnarray*}
whose two roots are $\frac{1}{8}(3\pm\sqrt{5})cosec^{2}\frac{\pi}{m}$. Consideration of these roots
shows that $(m,m;5)$ is admissible only if $m=2,3$ and is never semi-admissible.

If $l=6$, then
\begin{eqnarray*}
f_{6}(x)&=&x^{2}+\frac{4\zeta}{(1-\zeta)^{2}}x+\frac{3\zeta^{2}}{(1-\zeta)^{4}}\\
        &=&\left (x+\frac{\zeta}{(1-\zeta)^{2}} \right) \left(x+\frac{3\zeta}{(1-\zeta)^{2}} \right),
\end{eqnarray*}
and the corresponding roots are $\frac{1}{4}cosec^{2}\frac{\pi}{m}$ and
$\frac{3}{4}cosec^{2}\frac{\pi}{m}$. Both of these roots are in $(0,1)$ only for $m=2$.
For $m=3$, both these roots are in [0,1] with one of these roots equal to $1$. Thus
$(m,m;6)$ is admissible if $m=2$ and semi-admissible if $m=3$. Furthermore, for $m>3$,
there is always a root outside $[0,1]$ and so $(m,m;6)$ is inadmissible for $m>3$. By
Lemma 3.7, $(3,3;l)$ is inadmissible for $l>6$. Thus, the proof of this lemma is
complete.

\begin{remark}
Note that $(2,2;l)$ is admissible for all $l$.
\end{remark}

We have now classified all the admissible $(m,m;l)$ for both $l$ even and $l$ odd.
We now proceed towards the classification of all admissible triples $(m,p;l)$
for $l$ even.

\begin{lemma}
Let $l$ be even.

(i) If $(m,p;l-2)$ is admissible and $(m,p;l)$ is either semi-admissible
or inadmissible, then $(m,p;k)$ is inadmissible for $k>l$.

\vspace{0.1in}

(ii) If $(m,p;l)$ is admissible, then so is $(m,p;l-2)$ for $l>2$.
\end{lemma}
{\bf Proof.} (i) If $(m,p;l-2)$ is admissible and $(m,p;l)$ is either
semi-admissible or inadmissible, then for some $a\geq 1,f_{l-2}(a)>0$ and $f_{l}(a)=0$.
Thus, the result follows from Lemma 3.3.

(ii) This is a consequence of (i).

\begin{lemma}
(i) The triple $(m,p;4),m<p$ is admissible if and only if $(m,p)=
(2,m), m>3,(3,4),(3,5)$.

\vspace{0.1in}

(ii) The triple $(m,p;4),m<p$ is semi-admissible if and only if $(m,p)=
(3,6)$.
\end{lemma}
{\bf Proof.} We first note that the only root of $f_{4}(x)=0$ is
$\frac{1}{2}(1+cot\frac{\pi}{m}cot\frac{\pi}{p})$. 

(i) We see that $\frac{1}{2}(1+cot\frac{\pi}{m}cot\frac{\pi}{p})<1$ if and only
if $tan\frac{\pi}{m}tan\frac{\pi}{p}>1$ which implies that if $m<p,
(m,p)=(2,m),(m\geq 3),(3,4),(3,5)$ as required.

(ii) Similarly, $tan\frac{\pi}{m}tan\frac{\pi}{p}=1$ if and only if $(m,p)=(3,6)$.

\vspace{0.1in}

We now consider the case $l=6$. By Lemma 3.10 and Lemma 3.11, $(m,p;6)$ can only be admissible
if $(m,p)=(2,m),(m\geq 3),(3,4),(3,5) (m<p)$. We prove

\begin{lemma}
(i) The triple $(m,p;6)$ is admissible if and only if $(m,p)=
(2,3),(2,4),\break(2,5)$.

\vspace{0.1in}

(ii) The triple $(m,p;6),m<p$ is semi-admissible if and only if $(m,p)=
(2,6)$.
\end{lemma}{\bf Proof.} From (3.5), we have
\begin{eqnarray*}
f_{6}(x)&=&f_{4}(x)^{2}-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}, 
\end{eqnarray*}
from which we deduce that the two roots of $f_{6}(x)=0$ are
\[ \frac{1}{2} \left( 1+cot\frac{\pi}{m}cot\frac{\pi}{p} \right) \pm
\frac{1}{4}cosec\frac{\pi}{m}cosec\frac{\pi}{p}. \]
If $m=2$, the two roots are $\frac{1}{2}\pm\frac{1}{4}cosec\frac{\pi}{p}$,
from which we see that $(2,p;6)$ is admissible only if $p=3,4,5$ and semi-admissible
if $p=6$.

If $m=3$, the two roots are
$\frac{1}{2}(1+\frac{1}{\sqrt 3}(cot\frac{\pi}{p}\pm cosec\frac{\pi}{p}))$,
from which an easy calculation shows that one of the roots is $>1$ for all $p\geq4$.

\vspace{0.1in}

We now consider the case $l=8$. By Lemma 3.10 and Lemma 3.12, $(m,p;8)$ can only be admissible
if $(m,p)=(2,3),(2,4),(2,5)$. We prove

\begin{lemma}
(i)  The triple $(m,p;8)$ is admissible if and only if $(m,p)=(2,3)$.

(ii)  The triple $(m,p;8)$ is semi-admissible if and only if $(m,p)=(2,4)$.
\end{lemma}
{\bf Proof.} From (3.5), we see that

\begin{eqnarray*}
f_{8}(x)&=&f_{4}(x) \left( f_{6}(x)-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p} \right) . 
\end{eqnarray*}

We need only concern ourselves with the roots of $f_{6}(x)-\frac{1}{16}cosec^{2}\frac{\pi}{m}cosec^{2}\frac{\pi}{p}=0$.
If $m=2$, a simple calculation shows that this reduces to $x^{2}-x+\frac{1+\xi^{2}}
{4(1-\xi)^{2}}=0$, from which we deduce that $(m,p;8)$ is admissible if and only if
$(m,p)=(2,3)$ and semi-admissible if $(m,p)=(2,4)$.

\vspace{0.1in}

Similar calculations now show that we have the following lemma.

\begin{lemma}
(i)  The triple $(m,p;10)$ is admissible if and only if $(m,p)=(2,3)$

(ii) The triple $(m,p;12)$ is inadmissible except for $(m,p)=(2,3)$
\end{lemma}
{\bf Proof.} We see this by considering the appropriate entries in Table 2.

\vspace{0.1in}

We have therefore proved the following theorem.

\newtheorem{theorem}[remark]{Theorem}
\begin{theorem}
(i) The admissible triples $(m,p;l)$ are 

$(2,2;l)(l\geq 2),(3,3;3),(3,3;4),(3,3;5),(4,4;3),(5,5;3),(2,m;4)(m\geq3),
(3,4;4),\\
(3,5;4),(2,3;6),(2,4;6),(2,5;6),(2,3;8),(2,3;10)$.

\vspace{0.1in}

(ii) The semi-admissible triples $(m,p;l)$ are 

$(6,6;3),(4,4;4),(3,6;4),(2,6;6),(3,3;6),(2,4;8),(2,3;12)$.
\end{theorem}

We now show that this not only leads to a classification of two dimensional complex reflection groups
but we also easily obtain the corresponding root graphs and root systems. 

Let $G$ be a reflection group with root graph $B=\{u,v\}$, where $u$ and $v$ are
unitary roots. Let $s$ and $t$ denote the corresponding reflections whose orders are
$m$ and $p$ respectively. Then, it can be proved (see, for example, Koster \cite{koster}) that
for some positive integer $l$

\begin{equation}\label{eq:3.7}
\underbrace{ \ldots sts}_{l}=
\underbrace{ \ldots tst}_{l} 
\end{equation}
From Section~\ref{prel}, since $B$ is linearly independent, we have
\begin{eqnarray*}
det\left( \begin{array}{cc}
(u,u) & (u,v) \\
(v,u) & (v,v)
\end{array} \right)>0,
\end{eqnarray*}
from which it follows that
$$0<(u,v)(v,u)=|(u,v)|^{2}<1.$$
Now, put $a=|(u,v)|^{2} \in (0,1)$ and let $v^{\prime}=(1-\xi)(u,v)v$ and let
$u^{(l)}=\underbrace{ \ldots tstu}_{l}$. Furthermore, let
$$u^{(l)}=\alpha_{(u^{(l)},u)}u+\alpha_{(u^{(l)},v^{\prime})}v^{\prime},$$
where $\alpha_{(u^{(l)},u)},\alpha_{(u^{(l)},v^{\prime})}\in {\bf C}.$ If $l$ is even,
then $u^{(l)}=\underbrace{tst \ldots stu}_{l}$ and so
\begin{eqnarray*}
u^{(l+1)}=su^{(l)}=(1-\zeta)(1-\xi) \left\{ \frac{\zeta}{(1-\zeta)(1-\xi)}\alpha_{(u^{(l)},u)}-
a\alpha_{(u^{(l)},v^{\prime})} \right\} u+\alpha_{(u^{(l)},v^{\prime})}v^{\prime};
\end{eqnarray*}
thus
\begin{equation}\label{eq:3.8}
\alpha_{(u^{(l+1)},u)} = (1-\zeta)(1-\xi) \left\{ \frac{\zeta}{(1-\zeta)(1-\xi)}\alpha_{(u^{(l)},u)}-
a\alpha_{(u^{(l)},v^{\prime})} \right\}
\end{equation} 
and
\begin{equation}\label{eq:3.9}
\alpha_{(u^{(l+1)},v^{\prime})}=\alpha_{(u^{(l)},v^{\prime})}. 
\end{equation}
Similarly,
\begin{eqnarray*}
u^{(l+2)}=tu^{(l+1)}=\alpha_{(u^{(l+1)},u)}u+
(\xi\alpha_{(u^{(l)},v^{\prime})}-\alpha_{(u^{(l+1)},u)})v^{\prime}
\end{eqnarray*}
from which we obtain
\begin{equation}\label{eq:3.10}
\alpha_{(u^{(l+2)},v^{\prime})}=\xi\alpha_{(u^{(l)},v^{\prime})}
-\alpha_{(u^{(l+1)},u)} 
\end{equation}
and
\begin{equation}\label{eq:3.11}
\alpha_{(u^{(l+2)},u)}=\alpha_{(u^{(l+1)},u)}. 
\end{equation}

Now, for $l$ even $l\geq 2$, define
\begin{equation}\label{eq:3.12}
g_{l-1}(a)= \left( \frac{1}{(1-\zeta)(1-\xi)} \right) ^{\frac{l-2}{2}}
\alpha_{(u^{(l)},u)} 
\end{equation}
\begin{equation}\label{eq:3.13}
g_{l}(a)=- \left( \frac{1}{(1-\zeta)(1-\xi)} \right) ^{\frac{l-2}{2}}
\alpha_{(u^{(l)},v^{\prime})} 
\end{equation}
Then, we can prove the following theorem.
\begin{theorem}
(i) If $l$ is even, $l \geq 2$, then
\begin{equation}\label{eq:3.14}
g_{l+1}(a)=ag_{l}(a)+\frac{\zeta}{(1-\zeta)(1-\xi)}g_{l-1}(a)
\end{equation}
\begin{equation}\label{eq:3.15}
g_{l+2}(a)=g_{l+1}(a)+\frac{\xi}{(1-\zeta)(1-\xi)}g_{l}(a),  
\end{equation}
where $g_{l-1}(a)$ and $g_{l}(a)$ are monic polynomials in $a$.
\end{theorem}
{\bf Proof.} The proof is by induction on $l$. An easy verification shows that
$u^{(1)}=u, u^{(2)}=u-v^{\prime}$ and
$$u^{(3)}=(1-\zeta)(1-\xi) \left( a+\frac{\zeta}{(1-\zeta)(1-\xi)} \right) u-v^{\prime}.$$
Substitution of (3.12) and (3.13) in (3.8) and (3.11) now gives (3.14), and similarly in (3.9) and (3.10) to give (3.15).

We note that these are precisely the defining relations of the polynomials
$f_{l}(x)$ given in (3.1) and (3.2). We will exploit this now in
order to classify two dimensional root graphs and root systems.

Using the relation (3.7), we find that
\begin{eqnarray*}
u^{(l+1)}&=&\underbrace{ \ldots tstu}_{l+1}\\
         &=&\underbrace{ \ldots stsu}_{l+1}\\
         &=&\zeta(\underbrace{ \ldots stu}_{l}).
\end{eqnarray*}
This implies that if $l$ is even,
$$su^{(l)}=\zeta u^{(l)}$$
that is, $u^{(l)}$ is a multiple of $u$. Hence, the coefficient of $v$, and thus of
$v^{\prime}$, in $u^{(l)}$ is zero. This means that $\alpha (u^{(l)},v^{\prime})=0,$
and so, $g_{l}(a)=0$, that is, $a$ is a root of $g_{l}(x)=0$, where $a\in (0,1)$.
However, {\it this is precisely the requirement for a triple $(m,p;l)$ to be admissible}.
Thus, the two dimensional complex reflection groups which are generated by two reflections
correspond to the admissible triples listed in Theorem 3.15(i). We have therefore recovered the
following well known theorem.
\begin{theorem}
The two dimensional complex reflection groups which are generated by two reflections correspond to the
Coxeter graphs

\vspace{0.2in}

\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$3$}
\put(11,7){$3$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$3$}
\put(11,7){$4$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$3$}
\put(11,7){$5$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$4$}
\put(20,5){$4$}
\put(11,7){$3$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$5$}
\put(20,5){$5$}
\put(11,7){$3$}
\end{small}
\end{picture}

\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$4$}
\put(11,7){$4$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$5$}
\put(11,7){$4$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$3$}
\put(11,7){$6$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$4$}
\put(11,7){$6$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$5$}
\put(11,7){$6$}
\end{small}
\end{picture}

\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$3$}
\put(11,7){$8$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$3$}
\put(11,7){$10$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$2$}
\put(11,7){$l$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(19,5){$m$}
\put(11,7){$4$}
\end{small}
\end{picture}

\end{theorem}

Similarly, using the classification of semi-admissible triples given in Theorem 3.15(ii)
we obtain all the infinite two-dimensional complex reflection groups generated by two
reflections.

\begin{theorem}
The infinite two-dimensional complex reflection groups generated by two reflection groups
correspond to the Coxeter graphs

\vspace{0.2in}

\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$6$}
\put(20,5){$6$}
\put(11,7){$3$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$4$}
\put(20,5){$4$}
\put(11,7){$4$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$6$}
\put(11,7){$4$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$6$}
\put(11,7){$6$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$3$}
\put(20,5){$3$}
\put(11,7){$6$}
\end{small}
\end{picture}

\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$4$}
\put(11,7){$8$}
\end{small}
\end{picture}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$2$}
\put(20,5){$3$}
\put(11,7){$12$}
\end{small}
\end{picture}

\end{theorem}

However, what is far more significant, the roots $a=|(u,v)|^{2}$ of $f_{l}(x)=0$
corresponding to the admissible triples listed in Theorem 3.15 can be calculated.
These are listed in Table 1. In the first column of that
table, we denote these groups using the numbering given in the original
classification by Shephard and Todd \cite{Sh&Todd}. Furthermore, we can determine a value for
$(u,v)$ in each case: this is clearly not unique. In Table 2, we give the order of each group, the number
of elements in the corresponding root system and the number of reflections of each order. 
In Table 3, we choose a
$(u,v)$ to be real in each case; indeed, for consistency with what occurs in the
case of real reflection groups, we choose the root to be negative. We note, however,
that if we had chosen $(u,v) \in {\bf C} \setminus{\bf R}$, then by
replacing $u$ with $\zeta u$ for a suitable $\zeta \in {\bf C}, |\zeta|=1$, then
we obtain a congruent vector graph $\{\zeta u,v\}$, where $(\zeta u,v) \in {\bf R}$.

\begin{table}[h]
\begin{center}
\begin{tabular}{|cccc|} \hline
{\bf Shephard and}&{\bf admissible}& ${\bf f_{l}(x)}$&{\bf roots}\\ 
{\bf Todd type}          &{\bf triple}    &                 &                         \\ \hline
$G_{4}$&$(3,3;3)$ & $x-\frac{1}{4}cosec^{2}\frac{\pi}{3}$&$\frac{1}{3}$\\
$G_{5}$&$(3,3;4)$ & $x-\frac{1}{2}(1+cot^{2}\frac{\pi}{3})$&$\frac{2}{3}$\\
$G_{20}$&$(3,3;5)$ & $x^{2}-x+\frac{1}{16}cosec^{4}\frac{\pi}{3}$
&$\frac{4}{3}cos^{2}\frac{k\pi}{5}(k=1,2)$\\ 
$G_{8}$&$(4,4;3)$ & $x-\frac{1}{4}cosec^{2}\frac{\pi}{4}$&$\frac{1}{2}$\\
$G_{16}$&$(5,5;3)$ & $x-\frac{1}{4}cosec^{2}\frac{\pi}{5}$&$\frac{1}{2}(1+\frac{1}{\sqrt 5})$\\
$G_{10}$&$(3,4;4)$ & $x-\frac{1}{2}(1+cot\frac{\pi}{3}cot\frac{\pi}{4})$&$\frac{1}{2}
(1+\frac{1}{\sqrt 3})$\\
$G_{18}$&$(3,5;4)$ & $x-\frac{1}{2}(1+cot\frac{\pi}{3}cot\frac{\pi}{5})$&$\frac{1}{2}
(1+\frac{1}{\sqrt 3}cot\frac{\pi}{5})$\\
$G_{6}$&$(2,3;6)$ & $x^{2}-x+\frac{1}{4}(1-\frac{1}{4}cosec^{2}\frac{\pi}{3})$
&$\frac{1}{2}(1\pm\frac{1}{\sqrt 3})$\\
$G_{9}$&$(2,4;6)$ & $x^{2}-x+\frac{1}{4}(1-\frac{1}{4}cosec^{2}\frac{\pi}{4})$
&$\frac{1}{2}(1\pm\frac{1}{\sqrt 2})$\\
$G_{17}$&$(2,5;6)$ & $x^{2}-x+\frac{1}{4}(1-\frac{1}{4}cosec^{2}\frac{\pi}{5})$
&$\frac{1}{2}(1\pm\frac{1}{2}cosec\frac{\pi}{5})$\\
$G_{14}$&$(2,3;8)$ & $(x-\frac{1}{2})(x^{2}-x+\frac{1}{12})$
&$\frac{1}{2},\frac{1}{2}(1\pm{\sqrt\frac{2}{3}})$\\
$G_{21}$&$(2,3;10)$ & $\prod_{k=1}^{2}(x^{2}-x+\frac{1}{3}cos^{2}\frac{k\pi}{5})$
&$\frac{1}{2}(1\pm\frac{2}{\sqrt3}cos\frac{k\pi}{5})(k=1,2)$\\
$G(m,1,2)$&$(2,m;4)$ & $x-\frac{1}{2}(1+cot\frac{\pi}{2}cot\frac{\pi}{m})$&$\frac{1}{2}$\\
$G(m,m,2)$&$(2,2;m)$&$\prod_{k=1}^{\lfloor(m-1)/2\rfloor}(x-cos^{2}\frac{k\pi}{m})$
&$cos^{2}\frac{k\pi}{m}$\\ \hline 
\end{tabular}
\caption{The polynomials $f_{l}(x)$ and their roots}
\end{center}
\end{table}

%\mbox{}\vspace{-1.5in}\par
%\hspace{-2.5in}


\setcounter{table}{1}

\begin{table}[h]
\begin{center}
\begin{tabular}{|cccccccc|} \hline
{\bf Shephard}&{\bf admissible}&{\bf order of}&{\bf number of}& \multicolumn{4}{c|}
{\bf number of} \\ 
{\bf and Todd} &{\bf triple}&${\bf G_{n}}$ & {\bf elements in} & 
\multicolumn{4}{c|}{\bf reflections} \\ 
{\bf type} & & & ${\bf R_{n}}$ & \multicolumn{4}{c|}{\bf of order} \\
& & & &$2$&$3$&$4$&$5$ \\ \hline
$G_{4}$&$(3,3;3)$&$24$&$24$& &$8$& & \\ 
$G_{5}$&$(3,3;4)$&$72$&$48$ & & $16$ & &\\
$G_{20}$&$(3,3;5)$&$360$&$120$& &$40$& & \\ 
$G_{8}$&$(4,4;3)$&$96$&$48$&$6$& &$12$& \\
$G_{16}$&$(5,5;3)$&$600$&$120$& & & &$48$ \\ 
$G_{10}$&$(3,4;4)$&$288$&$168$&$6$&$16$&$12$& \\
$G_{18}$&$(3,5;4)$&$1800$&$960$& &$40$& &$48$ \\
$G_{6}$&$(2,3;6)$&$48$&$72$&$6$&$8$& & \\  
$G_{9}$&$(2,4;6)$&$192$&$144$&$18$& &$12$& \\  
$G_{17}$&$(2,5;6)$&$1200$&$840$&$30$& & &$48$ \\
$G_{14}$&$(2,3;8)$&$144$&$120$&$12$&$16$& & \\ 
$G_{21}$&$(2,3;10)$&$720$&$600$&$30$&$40$& & \\ \hline
\end{tabular}
\caption{Statistics about rootsystems}
\end{center}
\end{table}



In Table 3, a complete list of the $(u,v)$ is given. We give simultaneously in the form

\begin{center}
\begin{picture}(25,8)
\put(3,6){\circle{4}}
\put(21,6){\circle{4}}
\put(5,6){\line(1,0){14}}
\begin{small}
\put(2,5){$m$}
\put(20,5){$p$}
\put(2,2){$s$}
\put(20,2){$t$}
\put(11,7){$e$}
\put(10,3){${\alpha}_{n}$} 
\end{small}
\end{picture}
\end{center}
both the Coxeter graph and the root graph in each case, where ${\alpha}_{n}=(u,v)$
for the group $G_{n}$. Furthermore, ${\alpha}_{n}^{\prime}=\sqrt{1-{\alpha}_{n}^{2}}$.
In addition, we give the corresponding root system $R_{n}$, where these are expressed
in terms of the positive systems $P_{n}$ as defined by Hughes \cite{hughes1},\cite{hughes2} and Can
\cite{can}. Here ${\mu}_{n}$ denotes the 
group of $nth$ roots of unity
and $\omega,i,\zeta,\xi \enspace \mbox{and} \enspace \eta$ denote respectively primitive 
cube, fourth, fifth, eighth and
twentieth roots of unity.

As mentioned above, these root systems are not unique. More 'symmetric'
root systems may be obtained by either selecting a non-real complex value
for the inner product $\alpha_{n}$ or by embedding the root system in
${\bf R}^{3}$. For example,
$$\mu_{6} \left\{ \epsilon_{1},-\frac{1}{\sqrt 3}({\omega}^{k}\epsilon_{1}+
\epsilon_{2}+\epsilon_{3}),0 \leq k \leq 2 \right\} $$
is an alternative root system for $G_{4}$ and
$$\mu_{12} \left\{ \epsilon_{1},\epsilon_{2},-\frac{1}{\sqrt 3}({\omega}^{k}\epsilon_{1}+
\epsilon_{2}+\epsilon_{3}),\frac{1}{\sqrt 3}(-{\omega}^{k}\epsilon_{1}
-{\omega}^{k}\epsilon_{2}+\epsilon_{3}), 0 \leq k \leq 2 \right\} $$
is an alternative root system for $G_{5}$, where $\{\epsilon_{1},
\epsilon_{2},\epsilon_{3}\}$ is the natural basis for ${\bf C}^{3}$.
Also, for example,
$$\mu_{10} \left\{ \epsilon_{1},\epsilon_{2},-\frac{1}{1-\zeta}(\zeta^{k}
\epsilon_{1}+(\zeta^{2}+\zeta^{4})\epsilon_{2}),\frac{1}{1-\zeta}((
1+\zeta^{3})\epsilon_{1}-\zeta^{k}\epsilon_{2}), 0 \leq k \leq 4 \right\} $$
is an alternative root system for $G_{16}$.

We are grateful to Tom McDonough for all the assistance that he so readily gave in 
producing the MAGMA programmes for the computational work involved.



\newpage

\begin{sidewaystable}
\begin{center}
\begin{tiny}
\begin{tabular}{ccccccc}\hline
{\bf Shephard}&{\bf diagram}& &&{\bf positive system}&{\bf root system}&\\
{\bf Todd type}  &{\bf root graph}&$-{\bf \alpha_{n}}$&${\bf \alpha_{n}^{\prime}}$
&${\bf P_{n}}$&${\bf R_{n}}$\\ \hline
$G_{4}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$3$}
\put(20,2){$3$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$3$}
\put(10,0){$\alpha_{4}$}
\end{small}
\end{picture}
&$\frac{1}{\sqrt 3}$&$\frac{\sqrt{2}}{\sqrt{3}}$
&$\{\epsilon_{1},\alpha_{4}\omega^{k}\epsilon_{1}+\alpha_{4}^{\prime}\epsilon_{2}
,0\leq k\leq 2\}$&$\mu_{6}P_{4}$\\
$G_{5}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$3$}
\put(20,2){$3$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(10,4){$4$}
\put(11,0){$\alpha_{5}$}
\end{small}
\end{picture}
&$\frac{\sqrt{2}}{\sqrt{3}}$
&$\frac{1}{\sqrt 3}$
&$\{\epsilon_{1},\epsilon_{2},\omega^{k}\alpha_{5}\epsilon_{1}+\alpha_{5}^{\prime}\epsilon_{2},
\alpha_{5}^{\prime}\epsilon_{1}-\alpha_{5}\omega^{k}\epsilon_{2},0\leq k\leq 2\}$
&$\mu_{6}P_{5}$\\
$G_{20}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$3$}
\put(20,2){$3$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$5$}
\put(10,0){$\alpha_{20}$}
\end{small}
\end{picture}
&$\frac{1}{2}(\frac{1 + \sqrt 5}{\sqrt 3})$
&$\frac{1}{2}(\frac{1 - \sqrt 5}{\sqrt 3})$
&$\{\epsilon_{1},\epsilon_{2},\omega^{k}\alpha_{20}\epsilon_{1}+{\alpha}_{20}^{\prime}
\epsilon_{2},
\alpha_{20}^{\prime}\epsilon_{1}-\omega^{k}\alpha_{20}\epsilon_{2},$ & $\mu_{6}P_{20}$\\
& & & & $\omega^{k}e^{i\theta}
\alpha_{4}\epsilon_{1} \pm {\alpha}_{4}^{\prime}\epsilon_{2},
\alpha_{4}^{\prime}\epsilon_{1} \pm \omega^{k}e^{i\theta}\alpha_{4}\epsilon_{2},$ & \\
& & & & $0\leq k\leq 2, \enspace \theta = tan^{-1}\alpha_{20}\}$ & \\
$G_{8}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$4$}
\put(20,2){$4$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$3$}
\put(10,0){$\alpha_{8}$}
\end{small}
\end{picture}
&$\frac{1}{\sqrt 2}$&$\frac{1}{\sqrt 2}$
&$\{\epsilon_{1},\epsilon_{2},i^{k}\alpha_{8}\epsilon_{1}+\alpha_{8}^{\prime}\epsilon_{2},
0\leq k\leq 3\}$&$\mu_{8}P_{8}$\\
$G_{16}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$5$}
\put(20,2){$5$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$3$}
\put(10,0){$\alpha_{16}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\frac{1}{\sqrt 5}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\frac{1}{\sqrt 5}))}^{\frac{1}{2}}$
&$\{\epsilon_{1},\epsilon_{2},\zeta^{k}\alpha_{16}\epsilon_{1}+\alpha_{16}^{\prime}\epsilon_{2},
\alpha_{16}^{\prime}\epsilon_{1}-\zeta^{k}\alpha_{16}\epsilon_{2},0\leq k\leq 4\}$
&$\mu_{10}P_{16}$\\
$G_{10}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$4$}
\put(20,2){$3$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$4$}
\put(10,0){$\alpha_{10}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\frac{1}{\sqrt 3}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\frac{1}{\sqrt 3}))}^{\frac{1}{2}}$
&$\{\omega^{k}\alpha_{10}\epsilon_{1}+{\alpha}_{10}^{\prime}\epsilon_{2},
\alpha_{10}^{\prime}\epsilon_{1}-\alpha_{10}\omega^{k}\epsilon_{2},0\leq k\leq 2\}$&
$\mu_{12}P_{10} \cup \mu_{12}P_{5}$\\
$G_{18}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$5$}
\put(20,2){$3$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$4$}
\put(10,0){$\alpha_{18}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\frac{1}{\sqrt 3}cot\frac{\pi}{5}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\frac{1}{\sqrt 3}cot\frac{\pi}{5}))}^{\frac{1}{2}}$
&$\{\epsilon_{1},\epsilon_{2},\zeta^{k}\alpha_{18}\epsilon_{1}+\alpha_{18}^{\prime}\epsilon_{2},
\alpha_{18}^{\prime}\epsilon_{1}-\alpha_{18}\zeta^{k}\epsilon_{2},$  & 
$\mu_{30}P_{18}$\\
 & & & & $\zeta^{k}\alpha_{20}\epsilon_{1}+
\alpha_{20}^{\prime}\epsilon_{2},
\alpha_{20}^{\prime}\epsilon_{1}- \alpha_{20}\zeta^{k}\epsilon_{2},  $& \\
& & & & $\zeta^{k}\alpha_{4}\epsilon_{1}+\alpha_{4}^{\prime}\epsilon_{2},
\alpha_{4}^{\prime}\epsilon_{1}- \alpha_{4}\zeta^{k}\epsilon_{2},0\leq k\leq 4\}$ & \\
$G_{6}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$3$}
\put(20,2){$2$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$6$}
\put(10,0){$\alpha_{6}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\frac{1}{\sqrt 3}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\frac{1}{\sqrt 3}))}^{\frac{1}{2}}$
&$\{\omega^{k}\alpha_{6}\epsilon_{1}+{\alpha}_{6}^{\prime}\epsilon_{2},
\alpha_{6}^{\prime}\epsilon_{1}-\alpha_{6}\omega^{k}\epsilon_{2},0\leq k\leq 2\}$
&$\mu_{12}P_{4} \cup \mu_{4}P_{6}$\\
$G_{9}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$4$}
\put(20,2){$2$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$6$}
\put(10,0){$\alpha_{9}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\frac{1}{\sqrt 2}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\frac{1}{\sqrt 2}))}^{\frac{1}{2}}$
&$\{i^{k}\alpha_{9}\epsilon_{1}+{\alpha}_{9}^{\prime}\epsilon_{2},
\alpha_{9}^{\prime}\epsilon_{1}-\alpha_{9}i^{k}\epsilon_{2},
i^{k}\alpha_{8}\epsilon_{1}+\xi\alpha_{8}^{\prime}\epsilon_{2}$ 
& $\mu_{8}P_{8} \cup \mu_{8}P_{9}$ \\
& & & & $0\leq k\leq 3\}$ & \\
$G_{17}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$5$}
\put(20,2){$2$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$6$}
\put(10,0){$\alpha_{17}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\alpha_{16}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\alpha_{16}))}^{\frac{1}{2}}$
&$\{\zeta^{k}\alpha_{17}\epsilon_{1}+{\alpha}_{17}^{\prime}\epsilon_{2},
\alpha_{17}^{\prime}\epsilon_{1}-\alpha_{17}\zeta^{k}\epsilon_{2},$&
 $\mu_{20}P_{16} \cup \mu{20}P_{17}$\\
 & & & & $2\zeta^{k}\alpha_{17}sin\frac{17\pi}{20}\epsilon_{1}+2\eta\alpha_{17}^{\prime}
sin \frac{13\pi}{20}\epsilon_{2},$ &\\
 & & & & $2\zeta^{k}\alpha_{17}^{\prime}sin\frac{13\pi}{20}\epsilon_{1}-2\eta{\alpha}_{17}
sin \frac{17\pi}{20}\epsilon_{2},$ &\\
 & & & & $\zeta^{k}\alpha_{8}\epsilon_{1} \pm 
\eta\alpha_{8}^{\prime}\epsilon_{2}, 0\leq k\leq 4\}\}$ & \\
$G_{14}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small}
\put(2,2){$3$}
\put(20,2){$2$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$8$}
\put(10,0){$\alpha_{14}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+ \alpha_{5}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\alpha_{5}))}^{\frac{1}{2}}$
&$\{\omega^{k}\alpha_{14}\epsilon_{1}+{\alpha}_{14}^{\prime}\epsilon_{2},
\alpha_{14}^{\prime}\epsilon_{1}-\alpha_{14}\omega^{k}\epsilon_{2},$ & $\mu_{6}P_{5}
\cup \mu_{6}P_{14}$\\
 & & & &$(\alpha_{14} + \alpha_{14}^{\prime})(\omega^{k}\alpha_{8}\epsilon_{1} \pm i\alpha_{8}
\epsilon_{2}),0\leq k\leq 2\}$ & \\
$G_{21}$&\begin{picture}(25,8)
\put(3,3){\circle{4}}
\put(21,3){\circle{4}}
\put(5,3){\line(1,0){14}}
\begin{small} 
\put(2,2){$3$}
\put(20,2){$2$}
\put(2,-1){$s$}
\put(20,-1){$t$}
\put(11,4){$10$}
\put(10,0){$\alpha_{21}$}
\end{small}
\end{picture}
&${(\frac{1}{2}(1+\alpha_{20}))}^{\frac{1}{2}}$
&${(\frac{1}{2}(1-\alpha_{20}))}^{\frac{1}{2}}$
&$\{\omega^{k}\alpha_{21}\epsilon_{1}+{\alpha}_{21}^{\prime}\epsilon_{2},
\alpha_{21}^{\prime}\epsilon_{1}-\alpha_{21}\omega^{k}\epsilon_{2},$ &
$\mu_{12}P_{20} \cup \mu_{12}P_{21}$\\
 & & & &$\omega^{k}\alpha_{21}^{\prime}\epsilon_{1}+{\alpha}_{21}\epsilon_{2},
\alpha_{21}\epsilon_{1}-\alpha_{21}^{\prime}\omega^{k}\epsilon_{2},$ & \\
 & & & &$\omega^{k}\alpha_{6}\epsilon_{1}\pm{\alpha}_{6}^{\prime}\epsilon_{2},
\alpha_{6}^{\prime}\epsilon_{1} \pm \alpha_{6}\omega^{k}\epsilon_{2},
\omega^{k}\alpha_{8}\epsilon_{1} \pm i{\alpha}_{8}^{\prime}\epsilon_{2}$ & \\
& & & & $0\leq k\leq 2\}$ & \\  
\end{tabular}
\caption{Root systems}
\end{tiny}
\end{center}
\end{sidewaystable}


\newpage 

\begin{thebibliography}{99}

\bibitem{bour}
N.Bourbaki, {\it Groupes et alg\`{e}bres de Lie}, Chap IV, V, VI (Hermann, Paris, 1968).

\bibitem{bm}
M.Brou\'{e} and G.Malle, {\it Zyklotomische Heckealgebren},
Ast\'{e}risque {\bf 212} (1993),119-189.

\bibitem{bmr1}
M.Brou\'{e}, G.Malle, R.Rouquier, {\it On complex reflection groups
and their associated braid groups}, Representations of groups (B.N.Allison
and G.H.Cliff, eds.), CMS conference Proceedings, vol. 16,AMS,Providence,
1995, pp. 1-13.

\bibitem{bmr2}
M.Brou\'{e}, G.Malle, R.Rouquier, {\it Complex reflection groups,
braid groups, Hecke algebras}, J. reine angew. Math. {\bf 500} (1998),
127-190.

\bibitem{can}
H.Can, {\it Some combinatorial results for complex reflection groups}, Europ.
J. Combinatorics {\bf 19} (1998), 901-909.

\bibitem{cohen}
A.M.Cohen, {\it Finite complex reflection groups}, Ann. scient. \'{E}c. Norm. Sup., 
{\bf 9} (1976), 379-436.

\bibitem{cox}
H.S.M.Coxeter, {\it The symmetry groups of the regular complex polygons},
Arch. Math. {\bf 13} (1962), 86-97.

\bibitem{cox2}
H.S.M.Coxeter, {\it Finite groups generated by unitary reflections}, 
Abh. Math. Sem. Univ. Hamburg {\bf 31} (1967), 125-135.

\bibitem{hughes1}
M.C.Hughes, {\it Complex reflection groups}, Comm. in Algebra {\bf 18} (1990), 3999-4029.

\bibitem{hughes2}
M.C.Hughes, {\it Extended root graphs for complex reflection groups}, Comm. in Algebra 
{\bf 27} (1999), 119-148.

\bibitem{koster}
D.W.Koster, {\it Complex reflection groups}, Ph.D. thesis, University of Wisconsin, 1975.

\bibitem{popov}
V.L.Popov, {\it Discrete complex reflection groups}, Comm. of the Math. Institute, vol. 15,
Rijksuniversiteit Utrecht, 1982.

\bibitem{Sh&Todd}
G.C.Shephard and J.A.Todd, {\it Finite unitary reflection groups}, 
Canad. J. Math. {\bf 6} (1954), 274-304.

\end{thebibliography}   






   
\end{document}
