text:
# Abelian representation for nonabelian Wilson loops and the Non - Abelian Stokes theorem on the lattice.

## I Introduction

In order to visualize multidimensional space the projection onto the lower dimensional spaces can be used. The analogous idea is used in the non - Abelian gauge theory, where the dynamics is described in terms of certain Abelian variables. This method is called the Abelian Projection t’Hooft (1981).

One of the most important quantities we encounter in gauge theory is the Wilson loop

$$W_q[𝒞]=\chi _q(\mathrm{Pexp}(i_𝒞A_\mu 𝑑x_\mu ))$$
(1)
Here $`A`$ is the gauge field (that belongs to the Lie algebra of the correspondent gauge group), $`𝒞`$ is the closed contour, $`\mathrm{P}`$ denotes the usual path ordering, and $`\chi _q`$ is the character considered in the representation $`q`$ of the gauge group. For the application of the Abelian projection method it is important to have an Abelian - like representation for the Wilson loop. The representation of such kind was derived more than ten years ago by D. Diakonov and V. Petrov Diakonov and Petrov (1989). For the case of the irreducible representation $`q`$ of $`SU(N)`$ it has the form:

$$W_q[𝒞]=D\mu _{𝒞,q}(g)\mathrm{exp}(i_𝒞\mathrm{Tr}A_\mu ^g^q𝑑x_\mu ),$$
(2)
where $`g`$ is the $`SU(N)`$ gauge transformation and $`A_\mu ^g=gA_\mu g^+ig_\mu g^+`$. Here $`^q=_{i=1,\mathrm{},N1}m_iH_i`$, where each $`H_i`$ denotes the basis element of the Cartan subalgebra of $`su(N)`$ and $`(m_i)`$ is the highest weight of the representation. The matrices $`H_i`$ are normalized in such a way that $`\mathrm{Tr}H_iH_j=\delta _{ij}`$. The gauge transformations are defined on the contour $`𝒞`$. The measure $`\mu _{𝒞,q}(g)`$ on the space of gauge transformations is constructed using the invariant measure on the $`SU(N)`$ group. This construction will be discussed in detail later.

Both in the monopole and in the $`P`$ \- vortex confinement pictures the confining forces are induced by the magnetic flux contained inside the contour that is correspondent to the worldline of the charged particle Polikarpov (1997). In the Abelian theory a Stokes theorem is used for counting the magnetic flux. For counting the ”magnetic flux” contained inside the contour correspondent to the Wilson loop in a non - Abelian theory D. Djakonov and V. Petrov suggested to use representation (2) in the following form:

$$W_q[𝒞]=D\mu _{𝒞,q}(g)\mathrm{exp}(i_{(𝒞)}\mathrm{Tr}_{[\mu }A_{\nu ]}^g^qdx_\mu dx_\nu ),$$
(3)
where $`g`$ is defined on the surface $`(𝒞)`$ that spans the contour $`𝒞`$. The integral of a two - form over this surface is denoted by $`_{(𝒞)}\mathrm{}𝑑x_\mu dx_\nu `$. The expression (3) is known as the non - Abelian Stokes theorem.

In the present work we consider a lattice variant of the Abelian representation for the non - Abelian Wilson loop and the non - Abelian Stokes theorem on the lattice. The representation (2) was originally derived in a continuum theory. In the later publications (see, for example, Diakonov and Petrov (2000); Kondo and Taira (1999)) the approximated lattice variant of (2) was derived.

It appears that one of the most fruitful methods of the investigation of the quantum field theory is the lattice approach. This approach gives the exact meaning to any field correlator. It is possible both to define and to calculate it using the lattice regularization. Without using a lattice numerical investigation this could become possible only for the Integrable Models.

Thus it seems important to derive the lattice variant of (2), which is valid within the lattice $`SU(N)`$ theory precisely (i.e. not only in its naive continuum limit). In this paper such a representation is derived. If we assume that the gauge field is smooth enough, then the continuum limit of the derived representation coincides with (2). The non - Abelian Stokes theorem on the lattice commonly follows from the lattice Abelian representation of the Wilson loop.

## II Irreducible representations of the $`SU(N)`$ group

In this section we briefly summarize the basic notations of group representation theory that will be used in the next sections.

1. The space $`𝒱`$ of any irreducible representation of $`SU(N)`$ consists of the tensors $`\mathrm{\Psi }_{i_1i_2\mathrm{}i_r}`$. The symmetry of $`\mathrm{\Psi }`$ is defined by the set of integer numbers $`q_i(i=1,\mathrm{},N1)`$ ($`_iq_i=r,q_i0`$), which is called the signature of the representation. The elements of $`𝒱`$ are the tensors

$$\mathrm{\Psi }_{i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}}$$
(4)
For any $`k\{1,\mathrm{},q_1\}`$ the number of indices $`i_l^k`$ is denoted by $`c_k`$. Let us arrange these indices as follows:

$$\begin{array}{ccccc}i_1^1& \mathrm{}& i_i^1& \mathrm{}& i_{q_1}^1\\ i_1^2& \mathrm{}& i_{q_2}^2& & \\ \mathrm{}& & & & \\ i_1^{c_1}& \mathrm{}& & & \end{array}$$
(5)
Therefore $`q_i`$ is the length of the $`i`$-th line while the hight of the $`l`$-th column is $`c_l`$.

2. Let us consider the arbitrary tensor $`\mathrm{\Psi }_{i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}}`$. The tensor with the required symmetry can be obtained by means of the following transformation:

$`\mathrm{\Psi }_{i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}}𝒮^q\mathrm{\Psi }_{i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}}`$
$`={\displaystyle \underset{S}{}}()^{P(S)}\mathrm{\Psi }_{S[i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}]},`$ (6)
where the sum is over the permutations $`S`$ of the indices. Each permutation that enters the sum consists of the ordered product $`𝒬\times 𝒫`$ of some permutation $`𝒫`$ inside the lines $`(i_1^k\mathrm{}i_{q_k}^k)`$ of (5) and some permutation $`𝒬`$ inside the columns $`(i_l^1\mathrm{}i_l^{c_l})`$. $`P(S)=0(1)`$ if $`Q`$ is even (odd).

3. Let $`U_{ij}`$ be the $`N\times N`$ matrix that represents a certain element of $`SU(N)`$. Then the action of this element on $`𝒱`$ is given by:

$`\mathrm{\Psi }_{i_1i_2\mathrm{}i_r}𝒟_q(U)_{i_1i_2\mathrm{}i_r}^{j_1j_2\mathrm{}j_r}\mathrm{\Psi }_{j_1j_2\mathrm{}i_r}`$
$`=U_{i_1j_1}U_{i_2j_2}\mathrm{}U_{i_rj_r}\mathrm{\Psi }_{j_1j_2\mathrm{}j_r}`$ (7)
We shall also write:

$$|\mathrm{\Psi }𝒟_q(U)|\mathrm{\Psi }$$
(8)
4. Let us represent an infinitesimal element of $`SU(N)`$ as $`U=\mathrm{exp}(iAs)`$. Here $`s`$ is an infinitely small parameter and $`A`$ is a matrix that represents a certain element of the Lie algebra $`su(N)`$. Then (7) defines the representation of $`su(N)`$. We denote the correspondent matrix by $`𝒟_q(A)`$:

$$𝒟_q(U)=\mathrm{exp}(i𝒟_q(A)s)$$
(9)
5. Using the Cartan basis any $`Asu(N)`$ can be represented as

$`A={\displaystyle \underset{i=1,\mathrm{},N1}{}}H^i\mathrm{Tr}AH^i+`$
$`{\displaystyle \underset{i<j;i,j=1,\mathrm{},N1}{}}(E^{ij}(\mathrm{Tr}AE^{ij})^{}+(E^{ij})^+\mathrm{Tr}AE^{ij})`$ (10)
The Cartan elements of the basis are

$$H^i=\frac{1}{\sqrt{i(i+1)}}\mathrm{diag}(1,\mathrm{},1,i,0,\mathrm{})$$
(11)
The shift operators are:

$$(E^{ij})_{ab}=\delta _{ai}\delta _{bj}$$
(12)
6. The normalized vector $`|\mathrm{\Lambda }^a`$ ($`\mathrm{\Lambda }^a|\mathrm{\Lambda }^a=1`$), which is an eigenvector for any operator $`𝒟_q(H^i)`$ is called the weight vector. Here $`\mathrm{\Lambda }^a(a=1,\mathrm{},N1)`$ are the correspondent eigenvalues:

$$𝒟_q(H^i)|\mathrm{\Lambda }^a=\mathrm{\Lambda }^i|\mathrm{\Lambda }^a$$
(13)
Shift operators act on the weight vectors as follows:

$`𝒟_q(E^{ij})|\mathrm{\Lambda }^a`$ $``$ $`|\mathrm{\Lambda }^a+(\alpha ^{ij})^a`$
$`𝒟_q(E^{ij})^+|\mathrm{\Lambda }^a`$ $``$ $`|\mathrm{\Lambda }^a(\alpha ^{ij})^a`$ (14)
Here $`|a|b`$ means that $`|a=C|b`$ for some constant $`C`$. The numbers $`\alpha ^{ij}`$ are called the roots of $`su(N)`$. They enter the following commutation relations:

$`[H^a,E^{ij}]=(\alpha ^{ij})^aE^{ij}`$
$`[H^a,(E^{ij})^+]=(\alpha ^{ij})^a(E^{ij})^+`$ (15)
7. The weight vector that is annihilated by each of the operators $`E^{ij}`$ is called the eldest vector. The correspondent set of numbers $`\mathrm{\Lambda }^a`$ is called the highest weight and is denoted by $`m^a`$.

We denote the eldest vector by $`|0`$. Up to the normalization factor it corresponds to the tensor

$$\mathrm{\Psi }_{i_1^1\mathrm{}i_{q_1}^1\mathrm{}i_1^{c_1}\mathrm{}i_{q_{c_1}}^{c_1}}^0𝒮^q\delta _{i_1^1}^1\mathrm{}\delta _{i_{q_1}^1}^1\mathrm{}\delta _{i_1^{c_1}}^{c_1}\mathrm{}\delta _{i_{q_{c_1}}^{c_1}}^{c_1}$$
(16)
8. The highest weight of the representation $`q`$ is given by:

$$m_i=\frac{1}{\sqrt{i(i+1)}}(q_1+q_2+\mathrm{}+q_{i1}iq_i)$$
(17)
9. The coherent state system correspondent to the representation $`q`$ is the following subset of $`𝒱`$:

$$\{|g:|g=e^{i\varphi (g)}𝒟_q(g)|0(gSU(N))\},$$
(18)
where $`\varphi (g)`$ is a real - valued function on $`SU(N)`$.

10. The coherent state system possesses the following completeness relation:

$$𝑑g|gg|=\frac{1}{D(q)}$$
(19)
Here $`D(q)`$ is the dimension of the representation. The measure on $`SU(N)`$ is normalized in such a way that $`𝑑g=1`$.

## III The Abelian representation for the non - Abelian Wilson loop on the lattice.

In this section we consider the lattice $`SU(N)`$ Wilson loop. As an auxiliary instrument we use the lattice $`SU(N)`$ gauge model coupled to the scalar field $`\mathrm{\Phi }`$ that belongs to the irreducible representation $`q`$ of $`SU(N)`$. In addition this scalar field is considered in the presence of the external $`U(1)`$ gauge field $`\theta ]\pi ,\pi ]`$ (that lives on the links of the lattice). The partition function has the form:

$$Z[\theta ]=D\mathrm{\Phi }exp(\underset{xy}{}\mathrm{\Phi }_x^+𝒟_q(U_{xy})e^{i\theta }\mathrm{\Phi }_yV(\mathrm{\Phi }))$$
(20)
Here $`USU(N)`$ and the average is calculated in a certain $`SU(N)`$ gauge theory. We assume that the potential $`V`$ is infinitely deep and that it has the minimum at $`\mathrm{\Phi }=|0`$ with $`V(|0)=0`$, where $`|0`$ is the eldest vector of the representation. We also assume that $`V`$ is invariant under the transformation $`\mathrm{\Phi }e^{i\alpha }𝒟_q(g)\mathrm{\Phi }`$, where $`\alpha `$ is arbitrary real-valued field.

The idea is that there exist two different ways to rewrite the partition function as a sum over the worldlines of the scalar. The first one demonstrates that the partition function of the model generates the non - Abelian Wilson loop average (in the representation $`q`$). The second one demonstrates that the same functional also generates the Abelian - like expression for the Wilson loop. Finally due to the arbitrariness of the $`SU(N)`$ measure we obtain the equivalence of the Wilson loop itself and its Abelian - like representation.

### III.1 $`Z[\theta ]`$ generates the Wilson loops

The mentioned properties of the potential make it possible to reduce the integration over $`\mathrm{\Phi }`$ to the integration over $`gSU(N)`$ and over a real \- valued scalar field $`\alpha `$. Both fields are defined on the sites of the lattice. Then we can rewrite (20) as a sum over the worldlines of the scalar as follows:

$`Z[\theta ]={\displaystyle }D\alpha Dgexp({\displaystyle \underset{xy}{}}0|𝒟_q(g)_x^+𝒟_q(U_{xy})`$ (21)
$`e^{i\theta _{xy}+i\alpha _yi\alpha _x}𝒟_q(g)_y|0)`$
$`=`$ $`{\displaystyle }Dg{\displaystyle \underset{𝒞}{}}(2\pi )^{n(j(𝒞))}e^{i(j(𝒞),\theta )}`$
$`\mathrm{Tr}\mathrm{\Pi }_{\{xy\}𝒞}{\displaystyle \frac{1}{|j(𝒞)_{xy}|!}}g_x|𝒟_q(U_{xy})|g_y^{|j(𝒞)_{xy}|}`$
Here we used the calculus of differential forms on the lattice (for the definitions see, for example, Zubkov (1993)). The sum is over the closed lattice paths $`𝒞`$. The closed lattice path is defined as a map $`𝒞:Z_N=\{0,1,\mathrm{},N1\}X`$ (where $`X`$ is a set of the lattice points and $`N`$ is an integer number) such that for each $`kZ_N`$ the points $`𝒞(k)`$ and $`𝒞([k+1]\mathrm{mod}N)`$ are connected by a link. The product over all such links is denoted by $`\mathrm{\Pi }_{\{xy\}𝒞}`$, where each link is counted once and it is implied that $`x=𝒞(k)`$ and $`y=𝒞([k+1]\mathrm{mod}N)`$ for some $`k`$. $`j(𝒞)`$ is an integer - valued link field that corresponds to the path $`𝒞`$. $`|j_{xy}|`$ counts the number of times the given link $`\{xy\}`$ is encountered when we are moving along the path. The sign of $`j_{xy}`$ reflects the orientation of the path $`𝒞`$. So the case $`|j|>1`$ corresponds to the overlapping of the different pieces of $`𝒞`$. It is worth mentioning that $`j`$ does not contain the complete information on the orientation of $`𝒞`$. Therefore different paths may correspond to the same $`1`$ \- form $`j(𝒞)`$. This may happen if $`𝒞`$ has the selfintersections. However, in (21) the sum is over $`𝒞`$ that have different $`j(𝒞)`$. This means that the sum is indeed over different $`j(𝒞)`$ and each term of the sum depends only upon $`j(𝒞)`$ (not on $`𝒞`$ itself). $`n(j)`$ is the number of points, which enter the path represented by $`j`$. Also we assume the following notation:

$$(j,\theta )=\underset{xy}{}j_{xy}\theta _{xy},$$
(22)
where the sum is over the links of the lattice.

We denote $`i|𝒟_q(g)|0=𝒟_q(g)_{i0};0|𝒟_q(g)^+|i=𝒟_q(g)_{0i}^+`$, where $`|i`$ is the basis vector of the space $`𝒱`$ of the representation $`q`$. The integration over $`Dg`$ can be performed using the following expressions:

$`{\displaystyle 𝑑g𝒟_q(g)_{i0}^+𝒟_q(g)_{0j}}={\displaystyle \frac{\mathrm{𝟏}}{M_1(q)}}\delta _{ij}`$
$`{\displaystyle 𝑑g𝒟_q(g)_{i_10}^+𝒟_q(g)_{0j_1}𝒟_q(g)_{i_20}^+𝒟_q(g)_{0j_2}}=`$
$`{\displaystyle \frac{\mathrm{𝟏}}{M_2(q)}}(\delta _{i_1j_1}\delta _{i_2j_2}+\delta _{i_1j_2}\delta _{i_2j_1})`$
$`\mathrm{}`$ (23)
Here the measure $`dg`$ is normalized in such a way that $`𝑑g=1`$. The first identity reflects the completeness of a coherent state system and implies that $`M_1(q)=D(q)`$, where $`D(q)`$ is the dimension of the representation. Other equations follow from the gauge invariance. The correspondent coefficients $`M_i(q)`$ depend on the representation and can be calculated explicitly using the expressions for the basis vectors of $`𝒱`$ and the technique of a strong coupling expansion (see, for example, Creutz (1985)).

We obtain:

$$Z[\theta ]=\underset{𝒞}{}C(j(𝒞))e^{i(j(𝒞),\theta )}W_q[𝒞]$$
(24)
where the sum is over all different $`𝒞`$. $`W_q[𝒞]`$ is the Wilson loop (in the representation $`q`$) correspondent to the path $`𝒞:Z_NX`$:

$`W_q[𝒞]`$ $`=`$ $`\mathrm{Tr}𝒟_q(U_{𝒞(0)𝒞(1)})𝒟_q(U_{𝒞(1)𝒞(2)})\mathrm{}`$ (25)
$`\mathrm{}𝒟_q(U_{𝒞(N1)𝒞(0)})`$
We also denote

$$C(j)=\frac{(2\pi )^{n(j(𝒞))}}{(M_1(q))^{n_1(j)}(M_2(q))^{n_2(j)}\mathrm{}}$$
(26)
Here $`n_1`$ is the number of points of the path $`𝒞`$, where there are no selfintersections, $`n_2`$ is the number of points where $`𝒞`$ intersects itself once (i.e. where there are two different $`k_aZ_N,(a=1,2)`$, such that $`𝒞(k_1)=𝒞(k_2)`$), $`n_2`$ is the number of points where $`𝒞`$ intersects itself twice etc ($`n=_in_i`$).

As we have already mentioned, $`j`$ does not contain the complete information on the orientation of $`𝒞`$. Hence we extract from (24) the sum of the Wilson loops, which have the same $`j(𝒞)`$. The expression for the vacuum average of $`W_q^l=_{j[𝒞]=l}W_q[𝒞]`$ can be obtained using the Fourier transformation:

$`W_q^l={\displaystyle \underset{j[𝒞]=l}{}}W_q[𝒞]`$
$`={\displaystyle \frac{1}{C[l]}}{\displaystyle D\theta exp(i(l,\theta ))Z[\theta ]}`$ (27)
### III.2 $`Z[\theta ]`$ generates the Abelian - like expressions for the Wilson loop

Let us fix the gauge, where $`\mathrm{\Phi }_x=e^{i\alpha _x}|0`$ ($`\alpha `$ is a real valued field). We get:

$`Z[\theta ]={\displaystyle }D\alpha \mathrm{exp}({\displaystyle \underset{xy}{}}0|𝒟_q(U_{xy})|0e^{i(\theta _{xy}+\alpha _x\alpha _y)})`$
$`={\displaystyle \underset{𝒞}{}}\overline{C}(j(𝒞))\mathrm{exp}(i(j(𝒞),\theta ))`$
$`\mathrm{\Pi }_{\{xy\}𝒞}{\displaystyle \frac{1}{|j(𝒞)_{xy}|!}}0|𝒟_q(U_{xy})|0^{|j(𝒞)_{xy}|}`$ (28)
Here the sum is over $`𝒞`$ that have different $`j(𝒞)`$ and

$$\overline{C}(j)=(2\pi )^{n(j)}$$
(29)
### III.3 Equivalence of the Wilson loop and its Abelian representation

Recall that (24) and (28) are the different representations of the same quantity. Hence we obtain:

$`W_q^l={\displaystyle \frac{1}{C(l)}}{\displaystyle D\theta \mathrm{exp}(i(l,\theta ))Z[\theta ]}`$
$`={\displaystyle \underset{j[𝒞]=l}{}}{\displaystyle \frac{\overline{C}(l)}{C(l)}}\mathrm{\Pi }_{\{xy\}𝒞}{\displaystyle \frac{1}{|j(𝒞)_{xy}|!}}0|𝒟_q(U_{xy})|0^{|j(𝒞)_{xy}|}`$
$`={\displaystyle \underset{j[𝒞]=l}{}}\stackrel{~}{C}(l){\displaystyle Dg\mathrm{\Pi }_{\{xy\}𝒞}0|𝒟_q(U_{xy}^g)|0^{|j(𝒞)_{xy}|}},`$ (30)
where we used the gauge invariance of the operation $`\mathrm{}`$ and introduced a new combinatorial factor

$$\stackrel{~}{C}(l)=(M_1(q)^{n_1(l)}M_2(q)^{n_2(l)}\mathrm{})\mathrm{\Pi }_{\mathrm{links}}\frac{1}{|l_{\mathrm{link}}|!},$$
(31)
where the sum is over all links of the lattice. The gauge transformation of the link variable $`U_{xy}`$ is denoted by $`U_{xy}^g=gU_{xy}g^+`$. The measure $`Dg`$ is defined in such a way that $`Dg=1`$.

Due to the arbitrariness of the averaging $`\mathrm{}`$ over the gauge field $`U`$ we have:

$$W_q^l=\underset{j[𝒞]=l}{}\stackrel{~}{C}[l]Dg\mathrm{\Pi }_{\{xy\}𝒞}0|𝒟_q(U_{xy}^g)|0^{|l_{xy}|}$$
(32)
Thus the sum of $`SU(N)`$ Wilson loops that are correspondent to the same $`1`$ \- form $`l`$ can be represented through the Abelian - like expressions $`\mathrm{\Pi }_{\{xy\}𝒞}0|𝒟_q(U_{xy}^g)|0^{|l_{xy}|}`$. For the Wilson loops without selfintersections we have:

$$W^{l[𝒞]}=W[𝒞]$$
(33)
Then $`\stackrel{~}{C}[l]=D(q)^{n(l)}=D(q)^{|𝒞|}`$, where $`|𝒞|`$ is the length of the loop. In this case (32) acquires the form:

$$W_q[𝒞]=D(q)^{|𝒞|}Dg\mathrm{\Pi }_{xy𝒞}0|𝒟_q(U_{xy}^g)|0,$$
(34)
The expression (34) can be considered as the main result of this paper. In the next section we shall obtain the explicit expression for the matrix elements entering (34) and discuss symmetry properties of (34).

## IV Properties of the derived representation.

In this section we derive the expression for $`0|𝒟_q(U_{xy}^g)|0`$ entering (34). Also we introduce some new notations in order to demonstrate the Abelian nature of (34).

We use the explicit expressions for the eldest vector and for the matrix $`𝒟_q(U)`$ given in the section $`2`$. We can represent $`0|𝒟_q(U)|0`$ as

$$0|𝒟_q(U)|0=𝒰(U),$$
(35)
where

$`𝒰(U)={\displaystyle \frac{1}{K}}{\displaystyle \underset{S,\stackrel{~}{S}}{}}()^{P(S)+P(\stackrel{~}{S})}U_{\stackrel{~}{S}_1^1S_1^1}\mathrm{}U_{\stackrel{~}{S}_{q_1}^1S_{q_1}^1}`$
$`\mathrm{}U_{\stackrel{~}{S}_1^{c_1}S_1^{c_1}}\mathrm{}U_{\stackrel{~}{S}_{q_{c_1}}^{c_1}S_{q_{c_1}}^{c_1}}`$ (36)
and the normalization factor $`K`$ is chosen in such a way that $`𝒰(1)=1`$. Here the sum is over $`S_i^j`$ and $`\overline{S}_i^j`$ that are the elements of the following tables:

$$\begin{array}{cc}\begin{array}{ccccc}S_1^1& \mathrm{}& S_i^1& \mathrm{}& S_{q_1}^1\\ S_1^2& \mathrm{}& S_{q_2}^2& & \\ \mathrm{}& & & & \\ S_1^{c_1}& \mathrm{}& & & \end{array}& \begin{array}{ccccc}\overline{S}_1^1& \mathrm{}& \overline{S}_i^1& \mathrm{}& \overline{S}_{q_1}^1\\ \overline{S}_1^2& \mathrm{}& \overline{S}_{q_2}^2& & \\ \mathrm{}& & & & \\ \overline{S}_1^{c_1}& \mathrm{}& & & \end{array}\end{array}$$
(37)
(The lines contain $`q_1,q_2,\mathrm{},q_{c_1}`$ elements while the columns contain $`c_1,c_2,\mathrm{},c_{q_1}`$ elements respectively.) Each of these two tables is obtained via the composition of some permutation inside the lines and some permutation inside the columns of the following table:

$$\begin{array}{ccccc}1& \mathrm{}& 1& \mathrm{}& 1\\ 2& \mathrm{}& 2& & \\ \mathrm{}& & & & \\ c_1& \mathrm{}& & & \end{array}$$
(38)
$`P(S)=0(1)`$ if the correspondent column permutation is even (odd).

We can rewrite (36) in a compact form

$$𝒰(U)=\omega _{c_1}(U)\omega _{c_2}(U)\mathrm{}\omega _{c_{q_1}}(U),$$
(39)
where

$$\omega _M(U)=\mathrm{det}\left(\begin{array}{ccc}U_{11}& \mathrm{}& U_{1M}\\ \mathrm{}& \mathrm{}& \mathrm{}\\ U_{M1}& \mathrm{}& U_{MM}\end{array}\right)$$
(40)
In order to demonstrate the $`U(1)`$ nature of the derived expression for the Wilson loop (34) we rewrite it as follows:

$$W_q[𝒞]=Dg\mathrm{exp}(i(𝒜^g,j(𝒞))+\mathrm{log}(D(q))|𝒞|),$$
(41)
where

$$𝒜_{xy}^g=i\mathrm{log}𝒰(U_{xy}^g)$$
(42)
is a complex - valued link field. Below we shall show that its real part can be treated as a lattice Abelian gauge field. (It is worth mentioning that its imaginary part vanishes in a continuum limit. This will be shown in the next section, when we shall consider the continuum limit of the derived expressions.)

The exponent in (41) is invariant under the $`U(Nc_1)`$ \- transformation

$$U_{xy}h^+(\mathrm{\Omega }_x)U_{xy}h(\mathrm{\Omega }_y)$$
(43)
where $`\mathrm{\Omega }_xU(Nc_1)`$ is attached to the points of the path $`𝒞`$,

$$h(\mathrm{\Omega })=\left(\begin{array}{ccccc}e^{i\alpha }& 0& \mathrm{}& \mathrm{}& \mathrm{}\\ 0& e^{i\alpha }& \mathrm{}& \mathrm{}& \mathrm{}\\ \mathrm{}& \mathrm{}& \mathrm{}& \mathrm{}& \mathrm{}\\ \mathrm{}& \mathrm{}& 0& e^{i\alpha }& 0\\ \mathrm{}& \mathrm{}& \mathrm{}& 0& \mathrm{\Omega }\end{array}\right),$$
(44)
and

$$\mathrm{det}\mathrm{\Omega }=e^{ic_1\alpha }$$
(45)
This transformation acts on $`𝒜^g`$ as follows:

$$𝒜_{xy}^g𝒜_{xy}^{hg}=𝒜_{xy}^g+r(\alpha _x\alpha _y),$$
(46)
where $`r=_iq^i`$ is the rank of the representation. This demonstrates that the mentioned $`U(Nc_1)`$ symmetry induces the $`U(1)`$ gauge symmetry and real part of $`𝒜^g`$ plays the role of the correspondent gauge field.

In analogy with the continuum theory we obtain the lattice variant of the non - Abelian Stokes theorem:

$$W_q[𝒞]=Dg\mathrm{exp}(i(d𝒜^g,m(𝒞))+\mathrm{log}(D(q))|𝒞|),$$
(47)
where $`m(𝒞)`$ is the integer - valued plaquette variable that represents the surface that spans the contour $`𝒞`$. $`d𝒜^g`$ is the plaquette variable that is defined in an analogy with the Abelian field strength:

$$[d𝒜]_{xyzw}=𝒜_{xy}+𝒜_{yz}𝒜_{wz}𝒜_{xw},$$
(48)
where we suppose that the directions $`(xy)`$ and $`(yz)`$ are positive. The sum over the plaquettes is denoted by

$$(m,d𝒜)=\underset{xyzw}{}m_{xyzw}[d𝒜]_{xyzw}$$
(49)
Let us mention two particular cases, when expression (40) has the most simple form.

For the symmetric ($`q_1=r,q_2=\mathrm{}=q_{N1}=0`$) representations we have: $`𝒰=U_{11}^r`$. Thus the expression for the Wilson loop has the form:

$$W_r[𝒞]=Dg\mathrm{exp}(r(\mathrm{log}U_{11}^g,j(𝒞))+\mathrm{log}(D(q))|𝒞|)$$
(50)
(The adjoint representation is an example of such a representation. It corresponds to $`r=2`$.)

Another simple case corresponds to the absolutely antisymmetric representation ($`q_1=q_2=\mathrm{}=q_r=1,q_{r+1}=\mathrm{}=q_{N1}=0`$). In this case we have:

$$𝒰=\mathrm{det}\left(\begin{array}{ccc}U_{11}& \mathrm{}& U_{1r}\\ \mathrm{}& \mathrm{}& \mathrm{}\\ U_{r1}& \mathrm{}& U_{rr}\end{array}\right)$$
(51)
## V The continuum limit.

In order to consider consistently the continuum limit of a lattice model, its behavior in a small vicinity of the critical couplings should be investigated. Only near the point of the second order phase transition the lattice correlation length becomes infinite and the lattice spacing can be considered as infinitely small. In the correspondent model the continuum gauge field that is not smooth may arise. It was shown, for example, that such singular configurations of a gauge field as the center vortices may survive a continuum limit Bakker, Veselov, Zubkov (2002).

In this paper we consider only smooth continuum gauge fields. The continuum limit of the derived lattice expressions in the case of singular field configurations is out of scope of the present consideration.

Let us consider the expression (41) within the lattice $`SU(N)`$ gauge model that has the second order phase transition. Let us also consider the behavior of the following correlator:

$$<O(U)W_q[𝒞]>$$
(52)
Here $`O(U)`$ is gauge invariant functional. We assume that $`𝒞`$ has no selfintersections. We have:

$`O(U)W_q[𝒞]=O(U)\mathrm{exp}(i(𝒜,j(𝒞))`$
$`+\mathrm{log}(D(q))|𝒞|),`$ (53)
Here the integration over gauge transformations was absorbed by the average $`\mathrm{}`$. Let us suppose that the singular gauge fields do not arise in the continuum limit of the considered model. Then we can use the correspondence:

$$U_{xy}(1+iA_\mu \mathrm{\Delta }x),$$
(54)
where $`A`$ is a continuum gauge field and $`\mathrm{\Delta }x`$ is an infinite small space distance. In accordance with (54) $`0|𝒟_q(U)|0`$ corresponds to

$$0|𝒟_q(U_{xy})|01+i0|𝒟_q(A_\mu )|0\mathrm{\Delta }x$$
(55)
Hence it is clear that

$$𝒜_{xy}0|𝒟_q(A_\mu )|0\mathrm{\Delta }x$$
(56)
and imaginary part of $`𝒜`$ vanishes in a continuum limit.

Recall that in the vicinity of the second order phase transition $`𝒞=𝒞_{\mathrm{phys}}\frac{1}{a}`$, where the lattice spacing $`a`$ tends to zero and the physical length of the contour is equal to $`𝒞_{\mathrm{phys}}=_𝒞\sqrt{dx_\mu dx_\mu }`$. Let us consider such $`O`$ that it tends to a smooth functional of $`A`$ in the continuum limit. Therefore we can write the continuum limit of (53) as follows:

$`O(U)W_q[𝒞]=O(A)\mathrm{exp}(i{\displaystyle }0|𝒟_q(A_\mu )|0dx_\mu `$
$`+m_q{\displaystyle _𝒞}\sqrt{dx_\mu dx_\mu })`$ (57)
where the constant $`m_q`$ is divergent as

$$m_q𝐌\mathrm{log}D(q),$$
(58)
Here $`𝐌`$ is the ultraviolet cut-off (which in the case of the lattice regularization is equal to the inverse lattice spacing).

In gauge theory any Wilson loop always corresponds to the charged particle. The divergence of $`m_q`$ in (61) should be included into the renormalization scheme for the mass of this particle.

Let us restore the integration over the gauge transformations. The obtained continuum theory is gauge invariant. Hence we can rewrite the last expression as:

$`O(U)W_q[𝒞]`$ $`=`$ $`O(A){\displaystyle }Dg\mathrm{exp}(i{\displaystyle }0|𝒟_q(A_\mu )|0dx_\mu `$ (59)
$`+m_q{\displaystyle _𝒞}\sqrt{dx_\mu dx_\mu }),`$
where $`Dg`$ is the measure on the space of all $`\mathrm{𝑠𝑚𝑜𝑜𝑡ℎ}`$ gauge transformations, defined in such a way that $`Dg=1`$.

Due to the arbitrariness of the average $`\mathrm{}`$ we have:

$$W_q[𝒞]=D\mu _𝒞(g)\mathrm{exp}(i0|𝒟_q(A_\mu )|0𝑑x_\mu ),$$
(60)
where

$$D\mu _{𝒞,q}(g)=(𝒞)Dg=\mathrm{exp}(m_q_𝒞\sqrt{dx_\mu dx_\mu })Dg$$
(61)
This measure differs from the conventional one, which is normalized in such a way that $`Dg=1`$. Formally $`\mathrm{}`$ in the continuum limit. Thus if we substitute $`Dg`$ into (2) instead of $`D\mu _{𝒞,q}(g)`$, then the integral vanishes identically in the continuum limit. (This vanishing was pointed out in Ivanov (2000) for some particular choices of $`A`$.)

Of course, in any further application of this formula we should remember that the integration is over the smooth gauge transformations and the formula itself is valid only within the model, in which the singular gauge configurations are forbidden.

We use Cartan representation (10) of $`A^g`$ and obtain

$`0|𝒟_q(A^g)|0=0|{\displaystyle \underset{i=1,\mathrm{},N1}{}}H^i\mathrm{Tr}A^gH^i|0`$
$`=\mathrm{Tr}A^g^q`$ (62)
Thus the representation (60) has the form (2) originally proposed by D.Djakonov and V.Petrov Diakonov and Petrov (1989).

Using the expressions for the Cartan elements $`H^i`$ and for the highest weight $`m^i`$ it is easy to calculate $`^q`$. It’s nonzero elements are:

$$_{ii}^q=q_i\frac{1}{N}\underset{k=1,\mathrm{},N}{}q_k(i=1,\mathrm{},N),$$
(63)
where we imply that $`q_N=0`$.

Hence, we can rewrite (60) as follows:

$$W_q[𝒞]=D\mu _𝒞(g)\mathrm{exp}(i\underset{i=1,\mathrm{},N1}{}([A_\mu ^g]_{ii}q_i)dx_\mu )$$
(64)
It is worth mentioning that this expression can be obtained directly from (41) (with $`𝒰`$ that is given in (40)).

## VI Conclusions

In this work we have derived the Abelian representation (41) for the $`SU(N)`$ Wilson loop on the lattice. This representation contains the complex - valued link field. This field is a function of the matrix elements of the $`SU(N)`$ gauge field. (41) possesses the $`U(1)`$ gauge symmetry. Real part of the mentioned link field can be considered as a correspondent gauge field. Its imaginary part vanishes in a continuum limit.

The Non - Abelian Stokes theorem on the lattice commonly follows from (41). It can be used for ”counting” of the ”magnetic” flux that is contained inside the contour correspondent to the Wilson loop. Let us notice that both in the $`P`$ \- vortex and in the monopole pictures of a confinement phenomenon the Wilson loop is approximated by certain Abelian Wilson loop. The Abelian magnetic flux inside the correspondent contour appears to be responsible for the confinement. Therefore ”counting” of the ”magnetic” flux performed with the help of the non - Abelian Stokes theorem can be used in related confinement pictures in order to avoid an inexactitude associated with the mentioned approximation.

It is worth mentioning that the continuum limit of the derived expression coincides with the original representation obtained by D. Diakonov and V. Petrov.

###### Acknowledgements.

The author is grateful to A.N.Ivanov for the discussions, which stimulated him to investigate the subject considered in this paper. This work was partly supported by the grants INTAS 00-00111 and CRDF award RP1-2364-MO-02.


format: text

text:
# Introduction

## Introduction

1.  Let $`P`$ be a convex polyhedron in the spherical space $`S^n`$, Euclidean space $`IE^n`$ or hyperbolic space $`IH^n`$. Consider a group $`G_P`$ generated by the reflections with respect to the facets of $`P`$. We call $`G_P`$ a reflection group generated by $`P`$. The problem is to list the polyhedra generating discrete reflection groups.

Although the problem is old and easy to state, the answer is known only for some very simple combinatorial types of polyhedra. Already in 1873, Schwarz  listed the spherical triangles generating discrete groups. In 1998, E. Klimenko and M. Sakuma  solved the problem for hyperbolic triangles. In , , ,  the problem was solved for hyperbolic quadrilaterals, bounded hyperbolic pyramids and triangular prisms, hyperbolic simplices, and Lambert cubes in $`S^3`$, $`IE^3`$, $`IH^3`$.

In this paper, we solve this problem for spherical simplices.

2.  In , this problem is solved for hyperbolic simplices. The methods of  are valid for the spherical case, and these methods are sufficient to solve the problem for any partial case. Namely, if $`G`$ is a reflection group in $`S^n`$, then it is possible to find all the simplices, generating the group $`G`$. It is shown in  that for any $`G`$ the procedure takes finite (but not uniformly bounded!) time.

A spherical discrete reflection group $`G`$ is a group generated by one of the spherical Coxeter simplices. Any indecomposable spherical Coxeter simplex is one of $`A_n`$, $`B_n`$, $`D_n`$, $`E_6`$, $`E_7`$, $`E_8`$, $`F_4`$, $`H_3`$, $`H_4`$ and $`G_2^{(m)}`$ (we use the standard notation, see Table 1). The rest spherical Coxeter simplices are the direct products of some indecomposable Coxeter simplices. It is sufficient to classify simplices generating indecomposable discrete reflection groups (other simplices generating discrete groups are the direct products of these ones).

Since there exist indecomposable Coxeter simplices in any dimension, it is not possible to solve the general problem case by case. One could expect that the answer become stable, while $`n`$ goes to infinity. But the list of answers grows exponentially.

E. B. Vinberg suggested a way to reduce the number of items in the answer. Any simplex in the spherical n-space is bounded by $`n+1`$ hyperplanes. Observe, that these hyperplanes decompose the $`n`$-dimensional sphere into $`2^{n+1}`$ simplices. We call this set of simplices a family. Evidently, the simplices in a family generate one and the same group. We say that a family generates a reflection group. In this paper we classify all the families of simplices, generating discrete groups.

The classification up to a family is shorter than one for the ordinary simplices is. The number of families for $`A_n`$, $`B_n`$ and $`D_n`$ still goes to infinity with growth of the dimension. But in this situation it is possible to classify the families in terms of graphs. In Section 2, we prove that

* The families generating $`A_n`$ are in one-to-one correspondence with the trees with $`n+1`$ vertices.
* The families generating $`B_n`$ are in one-to-one correspondence with the trees with $`n`$ vertices exactly one of which is marked.
* The families generating $`D_n`$ are nearby in one-to-one correspondence with the connected graphs with $`n`$ vertices containing exactly one cycle (possibly the cycle contains only two vertices, but the cycle containing exactly one vertex is permitted).

Once the classification for $`A_n`$, $`B_n`$ and $`D_n`$ is done, we can solve the problem for the rest groups case by case. In fact, the answers for some groups are huge even in terms of the families. For example, there are 78 families generating $`H_4`$, 223 families generating $`E_7`$, and 1242 families generating $`E_8`$. In Section 3, we derive a criteria in terms of the dihedral angles for a family generating a discrete group. The complete answer for each of the groups $`E_6`$, $`E_7`$, $`E_8`$, $`F_4`$, $`H_3`$ and $`H_4`$ is contained in the Appendix. (The answer for the group $`G_2^{(m)}`$ is quite evident: two reflections generate $`G_2^{(m)}`$ if and only if the angle between the mirrors equals $`\pi \frac{k}{m}`$, where $`k`$ is prime to $`m`$).

### Acknowledgments

The work was written during the stay at the University of Fribourg, Switzerland. The author would like to thank Prof. R. Kellerhals for the invitation and the University for the hospitality. The author is grateful to Prof. R. Kellerhals for very useful discussions. The author is also grateful to Prof. E. B. Vinberg for the idea to classify the simplices modulo family.

## 1 Preliminaries

Spherical reflection groups. Let $`S^n`$ be the $`n`$-dimensional sphere, and $`G`$ be a group acting on $`S^n`$ and generated by reflections. Suppose that $`G`$ acts discretely, that is $`G`$ is a finite group for the spherical case. Then $`G`$ is called a Coxeter group and $`G`$ is generated by the reflections with respect to the facets of a spherical Coxeter polyhedron (a polyhedron is called Coxeter polyhedron, if its dihedral angles are the integer parts of $`\pi `$). The classification of the spherical Coxeter polyhedra is due to Coxeter . Any spherical Coxeter polyhedron containing no pair of antipodal points of $`S^n`$ is a simplex. Any spherical indecomposable Coxeter simplex is one of the simplices $`A_n`$, $`B_n`$, $`D_n`$, $`E_6`$, $`E_7`$, $`E_8`$, $`F_4`$, $`H_3`$, $`H_4`$ and $`G_2^{(m)}`$ (a simplex is called indecomposable if it is not a direct product of some other simplices).

To describe the Coxeter simplices, one can use the Coxeter diagrams. The Coxeter diagram of a Coxeter simplex $`P`$ is a graph whose vertices $`v_i`$ correspond to the faces $`f_i`$ of $`P`$, the vertices $`v_i`$ and $`v_j`$ are joined by a $`(k2)`$-fold edge if the dihedral angle formed up by $`f_i`$ and $`f_j`$ equals $`\frac{\pi }{k}`$ (if $`f_i`$ is orthogonal to $`f_j`$, $`v_i`$ and $`v_j`$ are disjoint). See Table 1 for the Coxeter diagrams of the indecomposable spherical Coxeter simplices. For more information about the reflection groups see .

We use one and the same notation for the Coxeter simplex and the group it generates.

Simplices generating discrete reflection groups. Let $`IE^{n+1}`$ be a $`(n+1)`$-dimensional Euclidean space and $`S^n`$ be a unit $`n`$-sphere centered at the origin. Any hyperplane in $`S^n`$ corresponds to a hyperplane in $`IE^{n+1}`$ containing the origin. An $`n`$-dimensional simplex $`P`$ in $`S^n`$ corresponds to some $`(n+1)`$-faced cone $`C`$ in $`IE^{n+1}`$ with tip at the origin. A simplex can be represented by a system of $`n+1`$ unit vectors $`f_1,\mathrm{},f_{n+1}`$ orthogonal to the faces of the cone $`C`$ and faced outside of $`C`$.

Let $`\mathrm{\Pi }_1,\mathrm{},\mathrm{\Pi }_{n+1}`$ be the faces bounding $`P`$. The hyperplanes containing $`\mathrm{\Pi }_1,\mathrm{},\mathrm{\Pi }_{n+1}`$ decompose $`S^n`$ into $`2^{n+1}`$ simplices $`P_1`$,…,$`P_{2^{n+1}}`$ encoded by the vectors $`\{\pm f_1,\mathrm{},\pm f_{n+1}\}`$. Throughout this paper the set of simplices $`P_1`$,…,$`P_{2^{n+1}}`$ is called a family. Obviously, any of $`P_1`$,…,$`P_{2^{n+1}}`$ generates the same reflection group as $`P`$ does. Thus, we can study families instead of ordinary simplices. (In fact, any family contains at most $`2^n`$ simplices up to an isometry: the simplex $`\{f_1,\mathrm{},f_{n+1}\}`$ is always congruent to $`\{f_1,\mathrm{},f_{n+1}\}`$).

Let $`P`$ be a simplex generating a discrete reflection group $`G`$. Clearly, the dihedral angles of $`P`$ are some rational numbers multiplied by $`\pi `$. Moreover, if $`G`$ is one of $`A_n`$, $`D_n`$, $`E_6`$, $`E_7`$ and $`E_8`$, any dihedral angle of $`P`$ is either right angle or $`\frac{\pi }{3}`$, or $`\frac{2\pi }{3}`$. If $`G`$ is either $`B_n`$ or $`F_4`$, the dihedral angle can be also $`\frac{\pi }{4}`$ or $`\frac{3\pi }{4}`$. Observe, that in these cases any dihedral angle is either $`\frac{\pi }{k}`$ or $`\frac{\pi (k1)}{k}`$, and that the only indecomposable discrete spherical reflection groups we omit here are $`H_3`$ and $`H_4`$.

Analogously to the Coxeter simplices, any simplex whose dihedral angles are either $`\frac{\pi }{k}`$ or $`\frac{\pi (k1)}{k}`$ can be represented by the following family diagram: the vertices $`v_i`$ correspond to the faces of $`P`$; the vertices $`v_i`$ and $`v_j`$ are joined by a $`(k2)`$-fold edge if the angle formed up by $`f_i`$ and $`f_j`$ is either $`\frac{\pi }{k}`$ or $`\frac{\pi (k1)}{k}`$ (if $`f_i`$ is orthogonal to $`f_j`$, $`v_i`$ and $`v_j`$ are disjoint).

Clearly, any two simplices in one family have one and the same family diagram. To specify the simplex in the family, one can use a labeled diagram: we assign an edge with $`{}_{}{}^{\prime \prime }_{}^{\prime \prime }`$ if the correspondent dihedral angle is acute, and with $`{}_{}{}^{\prime \prime }+_{}^{\prime \prime }`$ otherwise. Since the spherical simplices are determined (up to an isometry) by their dihedral angles, different simplices have different labeled diagrams. Note, that some diagrams and some labeled diagrams correspond to no spherical simplex.

We are aimed now to prove that any family diagram corresponds to at most one family of spherical simplices with dihedral angles $`\frac{\pi }{2}`$, $`\frac{\pi k}{3}`$ or $`\frac{\pi l}{4}`$. This means that if $`\mathrm{\Sigma }`$ is a family diagram for a family $`\mathrm{\Phi }`$ then any labeling of $`\mathrm{\Sigma }`$ either determines no spherical simplex or determines a simplex in $`\mathrm{\Phi }`$ (all simplices are considered up to an isometry).

###### Lemma 1.

Let $`\mathrm{\Gamma }`$ be a cycle, possibly with some 2-fold edges. Then $`\mathrm{\Gamma }`$ is a family diagram for at most one family of spherical simplices.

###### Proof.

Let $`\pm f_1,\mathrm{},\pm f_{n+1}`$ be a spherical family whose family diagram is $`\mathrm{\Gamma }`$. We can assume that $`f_i`$ is orthogonal to $`f_j`$ if $`|ij|>1`$ and $`\{i,j\}\{1,n+1\}`$. Fix $`f_1`$ and choose the sign for $`f_2`$ to make the angle $`\mathrm{}f_1f_2`$ non-acute. Then choose the sign for $`f_3`$ to make the angle $`\mathrm{}f_2f_3`$ non-acute, and so on. When the sign for $`f_{n+1}`$ is chosen, we have two possibilities: either the angle $`\mathrm{}f_{n+1}f_1`$ is acute, or non-acute. Observe, that if $`\mathrm{}f_{n+1}f_1`$ is non-acute, then the simplex $`P`$ determined by $`f_1,\mathrm{},f_{n+1}`$ is acute-angled. Moreover, any dihedral angle of $`P`$ is either right angle or $`\frac{\pi }{3}`$, or $`\frac{\pi }{4}`$. Thus, $`P`$ is a Coxeter simplex, and the Coxeter diagram of $`P`$ cannot be cyclic. The Coxeter diagram of $`P`$ coincides with the family diagram of $`P`$ which is a cycle. The contradiction shows that $`\mathrm{}f_{n+1}f_1`$ is acute.

Suppose that $`\mathrm{\Gamma }`$ corresponds to two different families. Choosing the signs as above for both families, we arrive with one and the same simplex (since the dihedral angles determine spherical simplex up to an isometry). Thus, the families coincide.

###### Lemma 2.

Let $`\mathrm{\Gamma }`$ be a graph, possibly with some 2-fold edges. Then $`\mathrm{\Gamma }`$ is a family diagram for at most one family of spherical simplices.

###### Proof.

The proof is by induction on the number of vertices of $`\mathrm{\Gamma }`$. If $`\mathrm{\Gamma }`$ consists of a unique vertex, the lemma is evident. Assume, inductively, that the lemma is true for any graph with at most $`n`$ vertices.

Let $`\mathrm{\Gamma }`$ be a graph with $`n+1`$ vertices $`v_1,\mathrm{},v_{n+1}`$. Suppose that $`\mathrm{\Gamma }`$ corresponds to two different families, and $`f_1,\mathrm{},f_{n+1}`$ and $`g_1,\mathrm{},g_{n+1}`$ are the representatives of these families. Let $`\mathrm{\Gamma }^f`$ and $`\mathrm{\Gamma }^g`$ be the labeled diagrams for these simplices. It is sufficient to prove that after some changes of signs of vectors $`f_1,\mathrm{},f_{n+1}`$ the labeled diagram $`\mathrm{\Gamma }^f`$ coincides with $`\mathrm{\Gamma }^g`$.

Remove from $`\mathrm{\Gamma }`$ the vertex $`v_1`$ and all the edges ended in $`v_1`$. By the assumption, $`\mathrm{\Gamma }v_1`$ corresponds to at most one family. Thus, up to an isometry we have $`f_i=\pm g_i`$, $`i=2,\mathrm{},n+1`$ (we choose the sign for each $`i`$ independently). Without loss of generality we can assume that $`f_i=g_i`$, $`i=2,\mathrm{},n+1`$, and that the labeled diagram $`\mathrm{\Gamma }^fv_1`$ coincides with $`\mathrm{\Gamma }^gv_1`$.

Denote the connected components of $`\mathrm{\Gamma }v_1`$ by $`\mathrm{\Gamma }_1`$,…,$`\mathrm{\Gamma }_k`$. Suppose that $`v_1`$ is joined with $`\mathrm{\Gamma }_i`$ by the edges $`e_i^1,\mathrm{},e_i^{s_i}`$. We can assume that the edge $`e_1^1`$ of $`\mathrm{\Gamma }^f`$ is labeled by “+”. If it is not, we change the sign of every vector $`f_i`$ correspondent to some vertex of $`\mathrm{\Gamma }_1`$. Note that these changes preserve the labels assigned to the edges of $`\mathrm{\Gamma }_i`$, $`i=1,\mathrm{},k`$. Analogously, we assume that $`e_1^i`$ is labeled by “+” for both diagrams $`\mathrm{\Gamma }^f`$ and $`\mathrm{\Gamma }^g`$ and for any $`i=1,\mathrm{},k`$. Note, that the labeled subdiagrams $`\mathrm{\Gamma }_i^f`$ and $`\mathrm{\Gamma }_i^g`$ still coincide.

Consider the edge $`e_1^2`$ joining $`v_1`$ with $`\mathrm{\Gamma }_1`$. Since $`\mathrm{\Gamma }_1`$ is connected, $`e_1^2`$ belongs to some cycle in $`\mathrm{\Gamma }_1v_1`$. By Lemma 1, any cycle corresponds to at most one family of simplices. Thus, the label of $`e_1^2`$ is determined by the labeled diagram $`\mathrm{\Gamma }_1^f=\mathrm{\Gamma }_1^g`$. Therefore, the edge $`e_1^2`$ has one and the same label in $`\mathrm{\Gamma }^f`$ and $`\mathrm{\Gamma }^g`$. Analogously, the same is true for any edge ended in $`v_1`$. Thus, we have $`\mathrm{\Gamma }^f=\mathrm{\Gamma }^g`$, and the lemma is proved.

The above lemma is useful for studying of families generating discrete reflection groups distinct from $`H_3`$ and $`H_4`$. To deal with $`H_3`$ and $`H_4`$, we extend the definition of the family diagram. The dihedral angles of any simplex generating $`H_3`$ or $`H_4`$ belong to the set $`\{\frac{\pi }{2},\frac{k\pi }{3},\frac{l\pi }{5}\}`$, where $`k=1,2`$; $`l=1,2,3,4`$. In the family diagram, the vertices $`v_i`$ correspond to the faces of the simplex; $`v_i`$ and $`v_j`$ are joined by a $`(k2)`$-fold edge, if $`\mathrm{}f_if_j`$ is either $`\frac{\pi }{k}`$ or $`\frac{\pi (k1)}{k}`$, $`v_i`$ and $`v_j`$ are joined by a $`3`$-fold edge decomposed into 2 parts, if $`\mathrm{}f_if_j`$ is either $`\frac{2\pi }{5}`$ or $`\frac{3\pi }{5}`$. See Table 3 for some examples.

Clearly, all the simplices in one family have one and the same family diagram. Unfortunately, the uniqueness of the family correspondent to a diagram does not hold now. For example, the triangles $`(\frac{2\pi }{5}`$,$`\frac{\pi }{3}`$,$`\frac{\pi }{3})`$ and $`(\frac{3\pi }{5}`$,$`\frac{\pi }{3}`$,$`\frac{\pi }{3})`$ have the same diagram, but these triangles belong to different families. Nevertheless, usually a family diagram corresponds to at most one family generating $`H_3`$ or $`H_4`$:

###### Lemma 3.

Let $`\mathrm{\Gamma }`$ be a family diagram for a family $`\mathrm{\Phi }`$ generating $`H_3`$ or $`H_4`$. If $`\mathrm{\Gamma }`$ is not a cycle with 4 vertices, then $`\mathrm{\Phi }`$ is the only family with family diagram $`\mathrm{\Gamma }`$. If $`\mathrm{\Gamma }`$ is a cycle with 4 vertices, then $`\mathrm{\Gamma }`$ corresponds to at most two families.

###### Proof.

First, suppose that $`\mathrm{\Phi }`$ generates $`H_3`$. The list of the triangles generating $`H_3`$ is contained in . We list the families of the triangles in Table 5. It is easy to see that different families have different family diagrams in this case.

Now, suppose that $`\mathrm{\Phi }`$ generates $`H_4`$ and $`\mathrm{\Gamma }`$ is not a cycle with 4 vertices. In this case, the lemma follows from the argument of the proof of Lemma 2 together with the result of the previous paragraph.

Finally, if $`\mathrm{\Gamma }`$ is a cycle with 4 vertices, we can assume that three edges correspond to the acute angles of the simplex $`P\mathrm{\Phi }`$. The rest edge corresponds to either acute or non-acute dihedral angle. Thus, there are at most two ways to specify the dihedral angles of $`P`$, and $`\mathrm{\Gamma }`$ corresponds to at most two families.

Remark. In Lemma 3, we do not specify the types of edges in the cycle. Thus, there could be up to 20 cyclic diagrams corresponding to two families, generating $`H_4`$, each. In fact, there are only two such diagrams.

## 2 Simplices generating $`A_n`$, $`B_n`$ and $`D_n`$

Let $`G`$ be one of the reflection groups $`A_n`$, $`B_n`$ and $`D_n`$. We will say that a reflection subgroup $`R`$ of $`G`$ is of maximal rank, if only the origin is fixed by $`R`$. Equivalently, $`R`$ is generated by $`n`$ reflections, or $`R`$ is generated by some $`(n1)`$-dimensional simplex.

Let $`\mathrm{\Phi }`$ be a family generating $`G`$ and $`f_1,\mathrm{},f_n`$ be the vectors orthogonal to the faces of $`\mathrm{\Phi }`$. Denote by $`\mathrm{\Delta }`$ the correspondent root system $`A_n`$, $`B_n`$ or $`D_n`$. Then suitably normalized vectors $`f_1,\mathrm{},f_n`$ belong to $`\mathrm{\Delta }`$. Moreover, any linearly independent $`n`$-tuple of vectors in $`\mathrm{\Delta }`$ determines some family generating a maximal rank subgroup of $`G`$.

To classify all the families generating $`G`$ it suffices to classify all the linearly independent $`n`$-tuples of vectors in $`\mathrm{\Delta }`$ and then eliminate families generating proper subgroups of $`G`$. Clearly, we are not interested in the ordering of the vectors in the $`n`$-tuple. The Weyl group acts on $`E^n`$ by reflections, and thus, it acts on the linearly independent $`n`$-tuples of vectors in $`\mathrm{\Delta }`$. We will not distinguish $`n`$-tuples equivalent under this action.

Definition. Let $`W`$ be a Weyl group of a root system $`\mathrm{\Delta }`$. We say that a family $`\mathrm{\Phi }`$ is embedded into $`W`$, if $`\mathrm{\Phi }`$ is represented by some vectors $`\pm f_1,\mathrm{}\pm f_n`$ chosen from $`\mathrm{\Delta }`$.

### 2.1 Simplices generating $`A_n`$

Let $`P`$ be a simplex generating a group $`A_n`$. Then we can assume that the vectors $`f_1,\mathrm{},f_n`$ belong to $`\mathrm{\Delta }(A_n)=\{\pm (h_ih_j)\},0i<jn`$ (where $`h_0,\mathrm{},h_n`$ is a standard basis of $`IE^{n+1}`$). From the other side, any linear independent system of vectors in $`\mathrm{\Delta }(A_n)`$ corresponds to a simplex generating $`A_n`$ (according to , $`A_n`$ has no maximal rank subgroups).

For any simplex $`P=\{f_1,\mathrm{}f_n\}`$ generating $`A_n`$ we construct the following graph $`\mathrm{\Sigma }`$: the vertices $`v_0,\mathrm{},v_n`$ of $`\mathrm{\Sigma }`$ correspond to the vectors $`h_0,\mathrm{}h_n`$, the vertices $`v_i`$ and $`v_j`$ are joined by the edge $`e_{i,j}`$ if one of the vectors $`(h_ih_j)`$ and $`(h_ih_j)`$ belong to the set $`\{f_1,\mathrm{},f_n\}`$. Clearly, two simplices in one family have one and the same graph.

To show that the families are in one-to-one correspondence with the graphs, we need a notion of a dual graph:

Definition. A complete subgraph $`C`$ of a graph $`\mathrm{\Sigma }`$ is called maximal, if $`\mathrm{\Sigma }`$ contains no complete subgraph $`C_1`$ such that $`C`$ is a subgraph of $`C_1`$.

A graph $`\mathrm{\Sigma }^{}`$ is dual to a graph $`\mathrm{\Sigma }`$ if the vertices of $`\mathrm{\Sigma }^{}`$ correspond to the maximal complete subgraphs of $`\mathrm{\Sigma }`$, and two vertices of $`\mathrm{\Sigma }^{}`$ are joined by a line if and only if they correspond to subgraphs in $`\mathrm{\Sigma }`$ having a common vertex.

If $`\mathrm{\Sigma }`$ is a tree, the vertices of $`\mathrm{\Sigma }^{}`$ correspond to the edges of $`\mathrm{\Sigma }`$, and two vertices are joint if the edges are adjacent.

###### Lemma 4.

Let $`\mathrm{\Sigma }_1`$ and $`\mathrm{\Sigma }_2`$ be the trees with $`n+1`$ vertices. If $`\mathrm{\Sigma }_1^{}=\mathrm{\Sigma }_2^{}`$, then $`\mathrm{\Sigma }_1=\mathrm{\Sigma }_2`$.

###### Proof.

A graph $`\mathrm{\Sigma }^{}`$ dual to a tree looks like a “cactus”, that is

* any vertex belongs to at most two maximal complete subgraphs of $`\mathrm{\Sigma }^{}`$;
* any pair of maximal complete subgraphs of $`\mathrm{\Sigma }^{}`$ has at most one common vertex;
* any cycle in $`\mathrm{\Sigma }^{}`$ belongs to some complete subgraph.

Any cactus is a graph dual to some tree. The lemma follows from the fact that the tree can be reconstructed from the cactus by the following algorithm:

* replace each maximal complete subgraph $`S`$ in $`\mathrm{\Sigma }^{}`$ by a vertex $`v_S`$;
* join the vertices $`v_{S_1}`$ and $`v_{S_2}`$, if $`S_1`$ and $`S_2`$ have a common vertex;
* for each vertex $`v_S`$ attach some additional edges to make the valence of $`v_S`$ equal to the number of vertices in $`S`$.

See Fig. 1 for an example.

Remark. The proof of Lemma 4 shows that $`(\mathrm{\Sigma }^{})^{}`$ is $`\mathrm{\Sigma }L`$, where $`L`$ is the set of all leaves of the tree $`\mathrm{\Sigma }`$ (a vertex is called a leaf if its valency equals 1).

Lemma 4 actually shows that the trees with $`n+1`$ vertices are in one-to-one correspondence with the cacti with $`n`$ vertices.

###### Theorem 1.

The families, generating $`A_n`$, are in one-to-one correspondence with the trees with $`n+1`$ vertices.

###### Proof.

Let $`P=\{f_1,\mathrm{}f_n\}`$ be a simplex generating $`A_n`$, and $`\mathrm{\Sigma }`$ be its graph. Since $`f_0,\mathrm{},f_n`$ are linearly independent, $`\mathrm{\Sigma }`$ has no cycles. Thus, any family generating $`A_n`$ corresponds to some tree with $`n+1`$ vertices.

Let $`\mathrm{\Sigma }`$ be a tree with vertices $`v_0,\mathrm{},v_n`$. Then $`\mathrm{\Sigma }`$ contains exactly $`n`$ edges $`e_{i,j}`$. Let $`f_1,\mathrm{},f_n`$ be the vectors $`h_ih_j,0i<jn`$, such that $`e_{i,j}`$ is an edge of $`\mathrm{\Sigma }`$. Since $`\mathrm{\Sigma }`$ is a tree, the vectors $`f_1,\mathrm{},f_n`$ are linearly independent. These vectors define a simplex generating $`A_n`$. Thus, the map from the families to the trees is surjective. It is suffices to prove that this map is injective and that this map does not depend on the embedding of the family in $`A_n`$.

Consider a graph $`\mathrm{\Sigma }^{}`$ dual to $`\mathrm{\Sigma }`$. Note, that $`\mathrm{\Sigma }^{}`$ coincides with the family diagram discussed in the previous section (the vertices correspond to the vectors $`f_1,\mathrm{}f_n`$, two vertices are joined if the vectors are not mutually orthogonal). Since the graphs dual to the trees are in one-to-one correspondence with the trees, it is sufficient to prove that the family diagrams for the families generating $`A_n`$ are in one-to-one correspondence with the families generating $`A_n`$. The last statement follows from Lemma 2.

###### Corollary 1.

Let $`\mathrm{\Phi }`$ be a family of simplices generating $`A_n`$. There exists a unique embedding of $`\mathrm{\Phi }`$ into $`A_n`$ (up to the action of the Weyl group of $`A_n`$).

###### Proof.

Let $`f_1,\mathrm{}f_n`$ and $`g_1,\mathrm{},g_n`$ be two embeddings of $`\mathrm{\Phi }`$, and let $`\mathrm{\Sigma }_f`$ and $`\mathrm{\Sigma }_g`$ be the graphs for these embeddings. Recall, that the vertices of the graphs $`\mathrm{\Sigma }_f`$ and $`\mathrm{\Sigma }_g`$ correspond to the basis vectors $`h_0,\mathrm{},h_n`$. Theorem 1 shows that $`\mathrm{\Sigma }_f`$ coincides with $`\mathrm{\Sigma }_g`$ up to a permutation of vertices. The Corollary follows from the fact that the group of permutations of the vectors $`h_0,\mathrm{},h_n`$ coincides with the Weyl group of $`A_n`$.

### 2.2 Simplices generating $`B_n`$

Let $`P`$ be a simplex generating a group $`B_n`$. Then we can assume that the vectors $`f_1,\mathrm{},f_n`$ belong to $`\mathrm{\Delta }(B_n)=\{\pm h_i,\pm h_i\pm h_j\},1i<jn`$ (where $`h_1,\mathrm{},h_n`$ is a standard basis of $`IE^n`$). Any linear independent system of vectors in $`\mathrm{\Delta }(B_n)`$ corresponds to a simplex generating either $`B_n`$ or some reflection subgroup of $`B_n`$.

According to , the only maximal rank indecomposable subgroup of $`B_n`$ is $`D_n`$. To generate $`B_n`$, the system of vectors $`f_1,\mathrm{},f_n`$ should be indecomposable and it should contain at least one of the vectors $`\pm h_i`$.

For any simplex $`P=\{f_1,\mathrm{}f_n\}`$ generating $`B_n`$ we construct the following graph $`\mathrm{\Sigma }`$: the vertices $`v_1,\mathrm{},v_n`$ of $`\mathrm{\Sigma }`$ correspond to the vectors $`h_1,\mathrm{}h_n`$, the vertices $`v_i`$ and $`v_j`$ are joined if $`\{f_1,\mathrm{},f_n\}`$ contains either $`\pm (h_i+h_j)`$ or $`\pm (h_ih_j)`$ the vertex $`h_i`$ is marked if $`\{f_1,\mathrm{},f_n\}`$ contains $`\pm h_i`$. If $`\{f_1,\mathrm{},f_n\}`$ contains both $`\pm (h_i+h_j)`$ and $`\pm (h_ih_j)`$ then $`v_i`$ and $`v_j`$ are joined by two edges.

Since $`f_1,\mathrm{},f_n`$ is indecomposable, the graph $`\mathrm{\Sigma }`$ is connected. Clearly, $`\mathrm{\Sigma }`$ contains at least one marked vertex. It is easy to see, that if $`\mathrm{\Sigma }`$ contains two marked vertices, then the vectors $`f_1,\mathrm{},f_n`$ are linearly dependent. Thus, $`\mathrm{\Sigma }`$ contains a unique marked vertex, and the number of edges in $`\mathrm{\Sigma }`$ is $`n1`$. Since $`\mathrm{\Sigma }`$ has $`n`$ vertices, $`\mathrm{\Sigma }`$ is a tree with one marked vertex (in particular, no pair of vertices is joined by two edges). Clearly, any tree with one marked vertex corresponds to a family generating $`B_n`$.

To show that the graphs of this type are in one-to-one correspondence with the families generating $`B_n`$, we define the dual graphs as the graphs obtained by the following algorithm:

* Construct the graph $`\mathrm{\Sigma }^{}`$ dual to $`\mathrm{\Sigma }`$ as usually: the vertices of $`\mathrm{\Sigma }^{}`$ correspond to the edges of $`\mathrm{\Sigma }`$, two vertices are joined if the edges are adjacent.
* Put an additional vertex $`v`$ in $`\mathrm{\Sigma }^{}`$ for the marked vertex $`h_{marked}`$ of $`\mathrm{\Sigma }`$.
* Join $`v`$ by 2-fold line with the vertices standing for $`\pm h_{marked}\pm h_j`$.

###### Lemma 5.

Let $`\mathrm{\Sigma }_1`$ and $`\mathrm{\Sigma }_2`$ be the trees with $`n`$ vertices containing exactly one marked vertex each. If $`\mathrm{\Sigma }_1^{}=\mathrm{\Sigma }_2^{}`$ then $`\mathrm{\Sigma }_1=\mathrm{\Sigma }_2`$.

###### Proof.

A graph $`\mathrm{\Sigma }^{}`$ dual to a tree with one marked vertex looks like a “bouquet of cacti ”, see Fig. 2. Any bouquet of cacti is dual to some tree, and the tree can be easily reconstructed from the bouquet.

###### Theorem 2.

The families generating $`B_n`$ are in one-to-one correspondence with the trees with $`n`$ vertices containing exactly one marked vertex.

###### Proof.

The proof follows the proof of Theorem 1. It is already shown that any family generating $`B_n`$ corresponds to a graph described in the theorem, and it is easy to see that any graph under consideration corresponds to some family generating $`B_n`$. Thus, we have the map from the trees to the families and back. To see that this map constitutes the one-to-one correspondence, note, that the dual graph $`\mathrm{\Sigma }^{}`$ coincides with the family diagram for $`f_1,\mathrm{}f_n`$, and use Lemma 5 and Lemma 2.

###### Corollary 2.

Let $`\mathrm{\Phi }`$ be a family of simplices generating $`B_n`$. There exists a unique embedding of $`\mathrm{\Phi }`$ into $`B_n`$ (up to the action of the Weyl group of $`B_n`$).

###### Proof.

The proof follows from the fact that the group of permutations of the vectors $`h_1,\mathrm{},h_n`$ is a subgroup of the Weyl group of $`B_n`$.

### 2.3 Simplices generating $`D_n`$

Let $`P`$ be a simplex generating a group $`D_n`$. Then we can assume that the vectors $`f_1,\mathrm{},f_n`$ belong to $`\mathrm{\Delta }(D_n)=\{\pm h_i\pm h_j\},1i<jn`$ (where $`h_1,\mathrm{},h_n`$ is a standard basis of $`IE^n`$). Any linear independent system of vectors in $`\mathrm{\Delta }(D_n)`$ corresponds to a simplex generating either $`D_n`$ or some reflection subgroup of $`D_n`$. It follows from , that any maximal rank proper reflection subgroup of $`D_n`$ is decomposable. Thus, $`P`$ generates $`D_n`$ if and only if the system of vectors $`f_1,\mathrm{},f_n`$ is indecomposable (the system of vectors is said to be decomposable if its Gram matrix is decomposable).

For any simplex $`P=\{f_1,\mathrm{}f_n\}`$ generating $`D_n`$ we construct the following colored graph $`\mathrm{\Sigma }`$: the vertices $`v_1,\mathrm{},v_n`$ of $`\mathrm{\Sigma }`$ correspond to the vectors $`h_1,\mathrm{}h_n`$, the vertices $`v_i`$ and $`v_j`$ are joined by a black edge if $`\{f_1,\mathrm{},f_n\}`$ contains $`\pm (h_i+h_j)`$, $`v_i`$ and $`v_j`$ are joined by a red edge if $`\{f_1,\mathrm{},f_n\}`$ contains $`\pm (h_ih_j)`$. If $`\{f_1,\mathrm{},f_n\}`$ contains both $`\pm (h_i+h_j)`$ and $`\pm (h_ih_j)`$, $`v_i`$ and $`v_j`$ are joined by two edges.

We assume the system $`f_1,\mathrm{},f_n`$ to be indecomposable. Hence, the graph $`\mathrm{\Sigma }`$ is connected. Since $`\mathrm{\Sigma }`$ consists of $`n`$ vertices and $`n`$ edges, $`\mathrm{\Sigma }`$ contains exactly one cycle. The cycle has at least one red edge, otherwise the vectors $`f_1,\mathrm{},f_n`$ are linearly dependent. After some changes of signs of $`h_1,\mathrm{},h_n`$ one can make all but one edges of $`\mathrm{\Sigma }`$ black. Moreover, one can choose any edge of the cycle, to make this edge the only red edge in $`\mathrm{\Sigma }`$ (the proof follows the proof of Lemma 1). Hence, the graph itself, without colors, prescribes the family of simplices. The only condition for the uncolored connected graph is that $`\mathrm{\Sigma }`$ contains a unique cycle (possibly, the cycle contains two vertices only).

Let $`\mathrm{\Sigma }`$ be a connected graph with exactly one cycle. Define the dual graph $`\mathrm{\Sigma }^{}`$ as follows: the vertices of $`\mathrm{\Sigma }^{}`$ correspond to the edges of $`\mathrm{\Sigma }`$, two vertices are joined if the edges have a common vertex; if two edges make up a cycle, the correspondent vertices of $`\mathrm{\Sigma }^{}`$ are joined by a dotted edge.

###### Lemma 6.

Let $`\mathrm{\Sigma }_1`$ and $`\mathrm{\Sigma }_2`$ be the graphs with $`n`$ vertices containing exactly one cycle each. If $`\mathrm{\Sigma }_1^{}=\mathrm{\Sigma }_2^{}`$, then $`\mathrm{\Sigma }_1=\mathrm{\Sigma }_2`$.

###### Proof.

Let $`\mathrm{\Sigma }`$ be a graph with $`n`$ vertices containing exactly one cycle. Then $`\mathrm{\Sigma }^{}`$ looks like a “cactus necklace”, see Fig. 3. If the cycle in $`\mathrm{\Sigma }`$ contains two edges only, then the string of the necklace is just the dotted edge. To prove the lemma, we check that the graph $`\mathrm{\Sigma }`$ can be recovered from the necklace.

Suppose that the string of $`\mathrm{\Sigma }^{}`$ contains at least four edges. Then, to find the graph $`\mathrm{\Sigma }`$ correspondent to the necklace $`\mathrm{\Sigma }^{}`$, one can use the same procedure as for $`A_n`$.

If the string of $`\mathrm{\Sigma }^{}`$ consists of two edges, one can use the usual procedure, but the vertices correspondent to two maximal complete subgraphs having the dotted edge in common should be joined by a 2-fold edge.

From now on in this proof suppose that the string of $`\mathrm{\Sigma }^{}`$ consists of three edges. Then $`\mathrm{\Sigma }`$ could be reconstructed with the usual procedure, but one should put no vertex for the string of the necklace (the string is a complete subgraph with 3 vertices). Unfortunately, sometimes it is impossible to recognize the string: see Table 2, second row, column $`\mathrm{\Sigma }_1^{}`$. We denote this graph by $`T`$.

To recognize the string in the other cases, note, that 1) any edge contained in two different maximal complete subgraphs belongs to the string; 2) if the string contains at least three vertices and the maximal complete subgraph $`C`$ intersects the string, then $`C`$ contains exactly two vertices of the string. Combining these properties, it is easy to see that any necklace with at least four vertices contains $`T`$ as a subgraph, and that if the necklace contains at least five vertices, the string could be recognized. Thus, the graph $`\mathrm{\Sigma }`$ could be reconstructed, unless $`\mathrm{\Sigma }^{}`$ is $`T`$. The last case does not cause a problem, since $`T`$ is symmetrical, and there is no difference which of the two triangles is chosen for a string. Therefore, $`\mathrm{\Sigma }`$ could be recovered from $`\mathrm{\Sigma }^{}`$, and the lemma is proved.

If $`\mathrm{\Sigma }^{}`$ has a dotted edge, denote by $`\overline{\mathrm{\Sigma }^{}}`$ the graph $`\mathrm{\Sigma }^{}`$ with the dotted edge removed. If $`\mathrm{\Sigma }^{}`$ contains no dotted edge, define $`\overline{\mathrm{\Sigma }^{}}=\mathrm{\Sigma }^{}`$.

###### Lemma 7.

Let $`\mathrm{\Sigma }_1`$ and $`\mathrm{\Sigma }_2`$ be the graphs with $`n`$ vertices containing exactly one cycle each. If $`\overline{\mathrm{\Sigma }_1^{}}=\overline{\mathrm{\Sigma }_2^{}}`$, then either $`\mathrm{\Sigma }_1=\mathrm{\Sigma }_2`$ or $`(\mathrm{\Sigma }_1,\mathrm{\Sigma }_2)`$ is one of two pairs described in Table 2.

###### Proof.

Suppose that neither $`\mathrm{\Sigma }_1^{}`$ nor $`\mathrm{\Sigma }_2^{}`$ contain the dotted line. Then the lemma follows from Lemma 6.

Suppose that both $`\mathrm{\Sigma }_1^{}`$ and $`\mathrm{\Sigma }_2^{}`$ contain the dotted line, and $`\overline{\mathrm{\Sigma }_1^{}}=\overline{\mathrm{\Sigma }_2^{}}`$. The proof of the preceding lemma shows that the dotted lines in $`\overline{\mathrm{\Sigma }_1^{}}`$ and $`\overline{\mathrm{\Sigma }_2^{}}`$ could be reconstructed. Thus, if $`\overline{\mathrm{\Sigma }_1^{}}=\overline{\mathrm{\Sigma }_2^{}}`$, then $`\mathrm{\Sigma }_1^{}=\mathrm{\Sigma }_2^{}`$, and the lemma follows from Lemma 6.

We are left with the case when $`\mathrm{\Sigma }_1^{}`$ contains a dotted line, $`\mathrm{\Sigma }_2^{}`$ contains no dotted line, and $`\overline{\mathrm{\Sigma }_1^{}}=\overline{\mathrm{\Sigma }_2^{}}`$. Suppose that the 2-fold edge in $`\mathrm{\Sigma }_1`$ is incident to at least three other edges. Then $`\overline{\mathrm{\Sigma }_1^{}}`$ has at least two cycles whose vertices are not the vertices of a complete subgraph. This is impossible, since $`\overline{\mathrm{\Sigma }_2^{}}`$ contains at most one such a cycle (this cycle is a string in $`\overline{\mathrm{\Sigma }_2^{}}`$, unless $`\mathrm{\Sigma }_2=T`$, where $`T`$ is a graph formed up by two triangles). Suppose that the 2-fold edge in $`\mathrm{\Sigma }_1`$ is incident to exactly two other edges. Then $`\overline{\mathrm{\Sigma }_1^{}}`$ has a cycle $`C`$ whose vertices are not the vertices of a complete subgraph. No edge of $`C`$ belongs to a complete subgraph having at least one vertex not in $`C`$. This is impossible for $`\overline{\mathrm{\Sigma }_2^{}}`$, unless any vertex of $`\overline{\mathrm{\Sigma }_2^{}}`$ is contained in $`C`$. Thus, $`\mathrm{\Sigma }_1`$ and $`\mathrm{\Sigma }_2`$ contain four vertices each, and $`(\mathrm{\Sigma }_1,\mathrm{\Sigma }_2)`$ is one of two pairs described in Table 2. Finally, suppose that the 2-fold edge in $`\mathrm{\Sigma }_1`$ is incident to a unique edge. Then $`\overline{\mathrm{\Sigma }_1^{}}`$ has two leaves with a common vertex, that is impossible for $`\overline{\mathrm{\Sigma }_2^{}}`$. (If the 2-fold edge is incident to no other edges, the lemma is obvious).

Denote by $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ the graphs shown in the column $`\mathrm{\Sigma }_2`$ of Table 2.

###### Theorem 3.

Let $`M`$ be the set of the connected graphs with $`n`$ vertices containing exactly one cycle (possibly the cycle contains only two edges, but the cycle containing exactly one vertex is permitted). Then the families, generating $`D_n`$ are in one-to-one correspondence with the graphs contained in $`M\{\mathrm{\Gamma }_1,\mathrm{\Gamma }_2\}`$.

###### Proof.

The proof follows the proof of Theorem 1.

It is already shown that any family generating $`D_n`$ corresponds to some connected graph with a unique cycle. Any connected graph with $`n`$ vertices with a unique cycle corresponds to some linearly independent indecomposable system of vectors $`f_1,\mathrm{},f_n`$ (to construct these vectors take any edge in the cycle, make it red, and put $`h_ih_j`$ for black edges and $`h_i+h_j`$ for the red one). Thus, we have the map from the graphs with $`n`$ vertices and exactly one cycle to the families generating $`D_n`$ and back. To see that this map constitutes the one-to-one correspondence, note, that the graph $`\overline{\mathrm{\Sigma }}^{}`$ coincides with the family diagram for $`f_1,\mathrm{}f_n`$, and use Lemma 7 and Lemma 2.

Denote by $`\mathrm{\Theta }_1`$ and $`\mathrm{\Theta }_2`$ the graphs shown in the last column of Table 2.

###### Corollary 3.

Let $`\mathrm{\Phi }`$ be a family of simplices generating $`D_n`$. If the family diagram for $`\mathrm{\Phi }`$ differs from $`\mathrm{\Theta }_1`$ and $`\mathrm{\Theta }_2`$, then there exists a unique embedding of $`\mathrm{\Phi }`$ into $`D_n`$ (up to the action of the Weyl group of $`D_n`$). If the family diagram for $`\mathrm{\Phi }`$ is either $`\mathrm{\Theta }_1`$ or $`\mathrm{\Theta }_2`$, then there are exactly two embeddings.

###### Proof.

If the family diagram for $`\mathrm{\Phi }`$ differs from $`\mathrm{\Theta }_1`$ and $`\mathrm{\Theta }_2`$, the proof follows from the fact that the group of permutations of the vectors $`h_1,\mathrm{},h_n`$ is a subgroup of the Weyl group of $`D_n`$.

Suppose that the family diagram of $`\mathrm{\Phi }`$ is either $`\mathrm{\Theta }_1`$ or $`\mathrm{\Theta }_2`$. Theorem 3 shows that $`\mathrm{\Phi }`$ has at most two embeddings (these embeddings are described by the graphs in the left column of Table 2). To show that these embeddings are different, note that the Weyl group of $`D_4`$ never takes the pair $`\{h_1h_2,h_1+h_2\}`$ to the pair $`\{h_1h_2,h_3h_4\}`$.

## 3 Simplices generating other groups

When all the families generating $`A_n`$, $`B_n`$ and $`D_n`$ are listed, we are left with finitely many indecomposable spherical reflection groups. These groups are $`E_6`$, $`E_7`$, $`E_8`$, $`F_4`$, $`H_3`$ and $`H_4`$ (we omit $`G_2^{(m)}`$ since the question is trivial for these groups). To treat these groups, one can use case-by-case check organized as follows:

* Let $`\mathrm{\Gamma }`$ be a finite indecomposable reflection group in $`S^{n1}`$; list the unit vectors orthogonal to the planes of the reflections of the group $`\mathrm{\Gamma }`$ under the consideration (this vectors are collinear to the roots in the correspondent root system, unless $`\mathrm{\Gamma }_n=H_3`$ or $`\mathrm{\Gamma }_n=H_4`$);
* for each $`n`$-tuple of vectors from this list check that the system is linearly independent and indecomposable;
* each linearly independent $`n`$-tuple corresponds to some family generating $`\mathrm{\Gamma }`$ or some subgroup of $`\mathrm{\Gamma }`$ (but we get every family a lots of times);
* list the different families obtained at the previous steps and eliminate the families generating the proper subgroups of $`\mathrm{\Gamma }`$.

Unfortunately, the lists one obtains after all are not too short (see Appendix for the lists). To get more compact criteria, we specify the necessary condition for a family generating a discrete spherical reflection group.

Notation. Let $`P=f_1,\mathrm{},f_{n+1}`$ be a spherical simplex, and $`\alpha `$ be a face of $`P`$ orthogonal to $`f_{n+1}`$. An $`(n1)`$-dimensional spherical simplex $`f_1,\mathrm{},f_n`$ will be denoted by $`P\alpha `$.

Definition. Let $`S`$ be a Coxeter simplex generating a reflection group $`G`$. A simplex $`P`$ satisfies the subgroup property for a group $`G`$, if for any facet $`\alpha `$ of $`P`$ there exists a facet $`\beta `$ of $`S`$ such that the group generated by $`P\alpha `$ coincides with the group generated by $`S\beta `$.

###### Lemma 8.

If a spherical simplex $`P`$ generates a discrete reflection group $`G`$, then $`P`$ satisfies the subgroup property for $`G`$.

###### Proof.

Let $`\alpha `$ be a face of $`P`$ and $`v`$ be a vertex of $`P`$ opposite to a face $`\alpha `$. Then the group generated by $`P\alpha `$ is a stabilizer $`Fix(v)`$ of $`v`$ in $`G`$. Let $`S`$ be a fundamental chamber for $`G`$ containing $`v`$, and $`\beta `$ be a face of $`S`$ opposite to $`v`$. Then $`Fix(v)`$ is a group generated by $`S\beta `$.

A case-by-case treating with the computer shows, that the subgroup property is almost sufficient criteria for a discreteness of the group generated by $`P`$:

###### Theorem 4.

Let $`P`$ be a simplex in $`S^n`$, $`n3`$. Suppose that the dihedral angles of $`P`$ are in the set $`\{\frac{\pi }{2},\frac{\pi }{3},\frac{2\pi }{3},\frac{\pi }{4},\frac{3\pi }{4}\}`$. Let $`G_P`$ be a reflection group generated by $`P`$. Let $`G`$ be an indecomposable spherical Coxeter group.

The group $`G_P`$ is a subgroup of $`G`$ if and only if $`P`$ satisfies the subgroup property for the group $`G`$.

Given a spherical simplex $`P`$ without the dihedral angles $`\frac{k\pi }{5}`$, one can determine whether the group $`G_P`$ generated by $`P`$ is discrete or not. Really, if the dihedral angles of $`P`$ satisfy the conjecture of Theorem 4, one can use the theorem. Otherwise, $`G_P`$ is not discrete. Note, that if an indecomposable simplex $`P`$ has a dihedral angle $`\frac{k\pi }{5}`$ and $`P`$ generates a discrete group $`G_P`$, then $`G_P=H_3`$ or $`G_P=H_4`$. The analog of Theorem 4 for tetrahedra with a dihedral angle $`\frac{k\pi }{5}`$ has some exclusions:

###### Proposition 1.

Let $`P`$ be a spherical tetrahedron having a dihedral angle $`\frac{k\pi }{5}`$. Then $`P`$ generates a discrete reflection group if and only if $`P`$ satisfies the subgroup property for a group $`H_4`$ and the family diagram for $`P`$ differs from the seventeen diagrams listed in Table 3.

Remark. The proof of this proposition as well as of Theorem 4 is just a coincidence of the results of two long case-by-case computer checks. It is not clear if it is possible to prove Theorem 4 a priori. Why do the exclusions in Proposition 1 occur, and how can one find these exclusions a priori?

But one can state that any non-Euclidean simplex whose dihedral angles belong to the set $`\{\frac{\pi }{2},\frac{\pi }{3},\frac{2\pi }{3}\}`$ generates a discrete reflection group (see  for the proof free of case-by-case checks).

## Appendix

The Appendix contains the list of families generating $`E_6`$, $`E_7`$, $`E_8`$, $`F_4`$, $`H_3`$ and $`H_4`$. Families generating $`E_6`$, $`E_7`$ and $`E_8`$ are encoded in the following way. For a family $`\pm f_1,\mathrm{},\pm f_n`$ construct a symmetric matrix $`G^+=\{g_{i,j}\}`$, where $`g_{i,j}=2|(f_i,f_j)|`$. This is a doubled unsigned Gram matrix of the system $`f_1,\mathrm{},f_n`$. The upper triangle of $`G^+`$ is filled up by $`0`$ and $`1`$. Let $`p`$ be a decimal number which is equal to the binary number $`\overline{g_{1,2}g_{1,3}\mathrm{}g_{1,n}g_{2,3}\mathrm{}g_{2,n}\mathrm{}g_{i,i+1}\mathrm{}g_{i,n}\mathrm{}g_{n1,n}}`$. The number $`p`$ depends on the ordering of vectors $`f_1,\mathrm{}f_n`$. We choose $`p`$ the smallest possible. Then $`p`$ depends only on the family of simplices. Lemma 2 shows that different families have different matrices. Thus, one can easily recover the family from the number $`p`$.

### Families generating $`E_6`$

1187 1195 1197 1199 1214 1259 1260 1261 1263 1270 1271 1278 1279 1983 3451 3452 3453 3455 3687 3949 3967 4831 5717 5791 7903 7915 7917 7935 8191 9719 17598 20287

### Families generating $`E_7`$

35050 35051 35052 35053 35054 35055 35070 35071 35098 35099 35102 35103 35195 35196 35197 35199 35431 35693 35711 36208 36209 36211 36212 36213 36215 36282 36283 36286 36287 36518 36519 36653 36663 36724 36725 36735 36862 36863 37117 37461 37523 37535 38547 38551 38623 39510 39595 39599 39647 39661 39666 39679 40670 40683 40685 40694 40703 40895 40956 40959 41191 41463 42487 43503 44967 48127 49279 49342 50303 50367 51515 52031 53055 64511 68986 68987 69487 71245 71247 71262 71265 71295 71339 71403 71675 73451 73577 74063 83070 83259 103864 103865 103867 103871 104012 104013 104015 104052 104053 104055 104063 104103 104107 104171 104178 104179 104371 104383 104444 104445 104447 105038 105039 105059 105071 105321 105339 106345 106349 108015 108295 111081 111085 111437 112527 112545 112557 112575 112639 113643 115838 115839 116027 116028 116029 116031 119341 119423 120510 120511 120637 129023 134739 134893 136925 138975 140765 141015 143327 170577 170589 171739 171740 171741 171743 173533 174555 174559 174799 175071 176013 176095 181437 182815 190103 208715 208719 241484 241487 241495 241502 241535 241546 241579 255574 255575 255607 255663 257774 258047 262143 265551 265558 265559 265711 270055 302991 303095 305639 312487 313719 313775 318975 349535 382463 384511 401101 401119 413021 445695 515577 515807 515820 516095 524287 527486 527487 532095 564863 564927 571646 571647 573375 575550 580159 835063 1050559 1052671 1053407 1083319 1083327 1084269 1084287 1084414 1085438 1086175 1088511 1090039 1150975 1153019 1153021 1160191 1176575

### Families generating $`E_8`$

2167311 2167326 2167375 2167378 2167383 2167391 2167415 2167423 2167518 2167531 2167533 2167551 2168396 2168404 2168406 2168414 2168436 2168478 2168492 2168510 2168543 2168556 2168562 2168566 2168575 2168603 2168605 2168607 2168637 2168827 2168829 2168831 2169422 2169578 2170590 2170603 2170605 2170606 2170623 2170733 2170736 2170739 2170748 2170751 2170874 2170879 2171222 2171237 2172399 2172407 2172679 2174823 2175450 2175455 2175465 2175487 2175719 2179199 2179903 2180223 2180287 2180412 2180415 2180927 2182975 2183711 2192383 2193269 2193407 2201234 2201235 2201238 2201239 2201248 2201249 2201251 2201252 2201253 2201255 2201266 2201267 2201270 2201271 2201520 2201521 2201523 2201527 2202212 2202213 2202282 2202283 2202286 2202287 2202348 2202349 2202409 2202413 2202480 2202481 2202491 2202495 2202618 2202619 2202622 2202623 2203570 2203571 2206470 2206471 2206503 2208240 2208241 2208243 2208247 2214202 2214203 2214206 2214207 2216249 2216253 2225013 2226175 2228222 2228223 2231885 2231892 2231893 2231925 2231954 2231955 2231999 2232045 2232093 2234961 2234973 2236123 2236125 2236621 2236631 2236893 2238103 2238943 2267867 2267869 2267871 2267901 2271729 2279611 2279615 2303622 2304906 2305003 2305007 2306015 2306028 2306034 2306047 2308061 2313854 2314043 2314047 2318591 2318934 2320118 2321134 2322431 2323167 2338698 2338700 2338703 2338718 2338721 2338727 2338731 2338733 2338751 2340753 2340765 2352823 2353826 2353827 2353839 2353951 2354926 2355123 2355199 2362710 2362711 2362743 2362799 2362870 2362871 2363143 2363303 2366183 2367207 2370023 2376871 2382335 2402791 2410662 2410663 2415006 2416127 2432931 2433007 2443567 2444662 2444718 2445095 2445551 2445599 2445823 2447787 2479455 2479615 2510061 2510173 2546317 2579967 2580205 2580479 2588671 2612732 2612959 2612972 2613247 2620303 2620415 2621439 2624702 2624703 2624827 2624828 2624829 2624831 2626749 2628127 2639934 2670527 2672703 2694783 2694975 2700735 2702207 2703231 2708031 2709055 2715775 2736062 2890998 2895271 2898151 2932215 2964975 3147775 3148653 3149822 3152895 3180469 3180543 3181567 3182591 3185663 3214188 3214189 3215359 3216108 3216109 3216127 3216379 3218426 3218427 3224575 3228479 3248126 3250171 3251195 3257343 3353583 3367935 3368959 3749823 4161535 4298316 4298317 4298318 4298319 4298336 4298337 4298339 4298347 4298366 4298367 4298410 4298411 4298474 4298475 4298522 4298523 4298537 4298555 4298601 4298611 4298619 4299627 4300648 4300649 4300651 4300655 4302318 4302319 4302695 4305387 4310142 4310143 4310330 4310331 4323181 4329038 4329039 4329059 4329067 4329194 4329195 4329321 4329339 4333291 4335066 4336459 4364890 4368383 4369163 4370251 4370258 4370259 4370273 4370291 4371419 4376127 4376191 4378238 4378427 4382955 4383247 4384335 4384375 4384767 4400619 4408442 4408443 4417103 4417135 4435786 4435791 4435819 4449870 4449891 4449895 4450157 4450175 4452203 4459854 4459855 4462151 4478303 4497231 4497391 4506999 4509935 4576607 4595529 4605211 4607323 4607355 4609369 4642526 4642547 4643563 4649435 4716365 4759167 4767615 4780159 4861307 4908159 5244799 5245803 5249019 5277567 5278571 5280491 5284335 5416927 5419995 6463411 6465420 6465421 6465423 6465463 6465471 6466034 6466035 6466274 6466275 6466379 6466386 6466387 6466401 6466419 6466467 6468307 6470618 6470619 6470655 6473268 6473269 6473271 6473914 6473915 6474040 6474041 6474043 6474047 6474283 6474290 6474291 6478460 6478461 6478463 6478522 6478523 6480319 6480399 6480406 6480407 6480503 6480831 6481487 6481571 6481847 6481919 6482594 6482595 6482803 6488060 6488061 6488063 6496105 6497771 6497775 6498127 6499179 6501193 6502395 6505594 6505595 6505598 6505599 6505787 6506027 6506031 6513019 6513263 6514254 6514255 6514275 6514279 6514541 6515563 6547022 6547023 6547055 6547233 6547237 6547309 6599119 6599141 6605070 6605071 6605091 6607123 6607221 6607277 6607367 6609327 6641255 6673779 6692681 6692685 6702199 6704489 6704496 6704497 6705385 6705741 6706931 6707791 6707947 6739602 6739603 6739699 6740581 6740643 6740655 6740715 6741933 6744839 6749071 6749183 6750207 6782955 6813527 6862783 6863228 6863229 6863661 6869051 6869052 6869053 6869055 6871614 6871615 6877501 6958893 6960819 6960831 6971519 6972983 7005311 7042687 7085671 7091599 7092559 7225175 7274495 7374708 7374709 7374719 7375723 7377777 7377919 7378943 7410537 7410555 7475930 7475931 7475949 7475963 7479785 7479789 7480141 7481343 7482347 7484379 7488127 7497727 7510013 7514103 7517147 7517181 7531518 7531519 8323071 8492625 8492699 8492763 8492785 8496869 8499027 8501213 8559321 8560345 8560349 8562389 8563161 8579807 8580831 8630097 8630109 8644181 8644319 8646381 8670463 8675039 8691405 8691411 8691415 8691423 8694471 8701173 8701591 8702207 8703213 8703325 8703387 8703631 8707807 8724171 8736091 8768748 8768881 8771157 8771231 8781791 8801499 8904415 9027327 9036991 9186783 9472749 9474781 9478621 9478871 9481183 9539579 9539583 10690264 10690265 10690267
10690271 10692057 10692061 10692301 10692307 10692311 10692319 10693323 10694619 10694623 10699961 10700317 10708565 10708703 10710783 10741395 10741399 10741471 10743518 10743519 10791383 10799265 10799295 10799377 10799515 10800373 10800375 10800383 10803871 10804959 10821323 10821324 10821325 10821327 10821330 10821331 10821342 10821343 10830965 10831027 10831383 10833131 10833138 10833306 10833683 10834139 10834655 10835603 10836557 10836575 10837747 10846175 10865899 10865907 10866611 10868121 10869147 10869343 10869387 10869659 10872727 10873743 10899029 10964223 10964735 10972879 11005654 11005669 11061309 11087291 11091711 11100191 11101375 11124479 11134143 11279957 11280031 11283853 11283935 11284103 11286733 11298903 11570173 11571197 11578335 11602667 11602939 11603967 11604703 11608539 11608543 11609055 11636732 11642869 11873231 12838482 12838483 12838494 12838495 12885710 12885711 12897519 12928107 12928111 12932443 12932683 12932687 12965209 12965453 12965458 12965471 12965473 12965659 12967770 12969542 12969731 12969807 12973907 13028603 13037263 13152127 13380939 13380943 13381455 13418190 13418211 13666029 13666034 13666047 13668347 13669083 13672922 13672923 13673166 13674463 13740011 13740015 15054720 15054723 15054732 15054735 15054750 15054783 15062361 15062364 15062367 15062603 15062605 15062613 15062614 15062623 15062800 15062803 15062812 15062815 15062875 15062877 15063819 15066887 15069953 15069965 15069983 15071093 15134423 15164999 15165007 15165135 15525991 15526127 15526407 15526439 15594739 15594742 15595087 15595175 15595443 15595519 15596111 16033743 16033751 16033783 16043007 16082927 16297919 16303679 16646143 16777215 16881139 16881143 16881223 16881286 16881287 16881319 16881655 16882155 16883535 16883557 16885223 16893206 16893207 16893239 16893303 16893359 16897397 16948951 16991471 17026287 17029711 17095055 17292767 17293031 17308911 17341686 17345959 17348839 17415663 17421431 17422447 17571047 17827319 17860087 19123438 19125911 19126683 19126863 19126926 19126959 19136503 19210215 19214791 19219719 19222759 19222871 19226095 19256663 19257742 19257743 19352974 19357150 19357183 19389919 19438831 19439543 19471599 19471791 19472143 19477903 19478863 19488127 19512823 19518583 19518647 19519599 19519663 19519789 19585183 19611103 19622159 19660287 19668367 19750263 19957239 19958255 19991022 19991399 19993055 19994615 19995631 19997159 20005239 20005295 20531503 21222747 21222991 21353807 21417455 21638479 22054383 22190047 23514531 23517579 23517583 23517662 23517695 23518095 23518686 23518719 23549261 23551467 23779423 23779455 23782679 23789055 24287199 24695071 24695231 25414893 25415255 25415405 25423839 25550303 25611469 25730719 25832653 26318813 26856829 27741421 27741439 28044543 28413951 28876701 28886197 28909278 28909467 28921086 28921087 28921275 28953854 28953855 28954043 28974813 30004351 30141675 30511082 30511083 30983287 30983295 30983422 30983423 33148283 33148286 33148798 33292287 33658042 33658043 33658046 33658047 33658431 33658495 33659002 33659003 33662263 33665143 33665307 33666495 33667007 33670206 33670207 33674815 33761387 33762683 33795871 33795885 33795903 33795967 33809535 33809599 33809975 34000063 34125951 34157695 34638139 34672763 34674303 34707134 34713981 34722367 34777343 35893037 35893055 35893119 35895902 35895927 35895935 35906687 35907127 35907711 35908143 36097215 36175807 36249151 36254847 36254910 36254911 36270143 36388479 36735292 36735295 36739775 36749375 36768059 36769915 36770334 36770335 36771455 36772478 36772667 36779967 36782142 36786751 36805246 36805435 36811133 36841727 36874495 36907387 36921471 37182079 37990187 37992045 37993067 38004271 38189291 38831935 38834815 38966909 38966971 40367358 40367547 40827007 41064124 41068798 41068799 41069375 41070845 41072383 41402367 43093631 45460991 49655295 49657758 49659903 49669567 50572623 50572631 50573063 52944111 52944319 53588471 59236063 66568140 66575871 66584575 67108863 67209076 67209077 67209087 67212011 67212012 67212013 67212283 67213308 67213309 67215855 67275507 67275519 67281373 67281623 67283935 67348447 67348471 67348479 67405303 67438063 67571691 67668799 68191167 68193278 68193279 68289247 68412415 69445599 69445620 69445623 69445631 69636085 69668843 69668862 69668863 69718015 69721087 70253567 70321005 70321023 70325247 70354942 70354943 70355966 70355967 70453247 70454267 70460415 70476799 70517239 70731775 71733227 71733231 71747071 72517627 74358783 74614780 74614783 74615807 74647546 75864029 76646397 87626239 100902575 100910655 103272255 103792575
134258411 134258413 134258422 134258431 134258623 134258684 134258687 134262695 134265855 134270783 134291179 134291305 134348799 134356703 134361055 134487783 134536703 134749823 134791103 136355563 136355565 136355573 136355574 136355583 136355761 136355767 136355772 136355775 136355836 136355839 136359847 136362999 136363007 136367935 136388461 136394639 136394657 136394669 136394687 136394751 136395755 136402622 136402623 136402749 136411135 136413182 136443903 136444927 136445950 136453851 136453853 136458125 136458207 136472215 136540159 136544255 136577023 136585103 136585207 136666623 136846975 136847039 136862271 137367550 137367551 137370623 137458687 138491883 138540909 138555211 138555215 138604270 138696031 140638079 140638206 140640255 140701618 140705787 140705789 140736507 140771322 140771327 140926700 140926833 140935167 141082495 141082559 141459455 142508031 142745305 142798559 142876365 142876383 142888173 142888285 145055455 149159929 149290975 149290988 149847775 151313911 151575999 153354231 153443823 160964319 168304191 175521791 201431037 204508158 204508159 204542971

### Families generating $`F_4`$

### Families generating $`H_3`$

### Families generating $`H_4`$

Families generating $`H_4`$ are encoded in the following way. For a family determined by $`\pm f_1,\mathrm{},\pm f_4`$ construct a symmetric matrix $`G^+=\{g_{i,j}\}`$, where $`g_{i,j}=0`$ if $`f_i`$ is orthogonal to $`f_j`$, $`g_{i,j}=1`$ if $`\mathrm{}f_if_j=\frac{\pi }{3}`$ or $`\frac{2\pi }{3}`$, $`g_{i,j}=2`$ if $`\mathrm{}f_if_j=\frac{\pi }{5}`$ or $`\frac{4\pi }{5}`$, and $`g_{i,j}=3`$ if $`\mathrm{}f_if_j=\frac{2\pi }{5}`$ or $`\frac{3\pi }{5}`$. Let $`p`$ be a decimal number which is equal to the base four number $`\overline{g_{1,2}g_{1,3}\mathrm{}g_{1,n}g_{2,3}\mathrm{}g_{2,n}\mathrm{}g_{i,i+1}\mathrm{}g_{i,n}\mathrm{}g_{n1,n}}`$. The number $`p`$ depends on the numbering of vectors $`f_1,\mathrm{}f_n`$. We choose $`p`$ the smallest possible. Then $`p`$ depends only on the family of simplices. Lemma 3 shows that different families have different matrices, unless the family diagram is a cycle with 4 vertices. Thus, in most cases one can recover the family from the number $`p`$.

81 85 86 87 91 97 99 101 102 103 106 113 114 117 118 119 127 149 159 163 165 167 177 183 191 213 218 230 234 242 245 246 344 345 346 347 348 349 350 351 364 365 413 414 415 420 422 445 447 489 490 500 503 760 761 1365 1366 1367 1370 1375 1434 1435 1439 1447 1450 1461 1471 1503 1514 1526 1535 1706 1709 1725 1789 2047 2730 4095

If the family diagram is a cycle with 4 vertices and the family generates $`H_4`$, then $`p`$ is one of the numbers 344, 348, 364, 420, 500 and 760. It is easy to check that 348 and 500 are the only numbers correspondent to two different families each.

Independent Univ. of Moscow,
e-mail: ow felikson@mccme.ru.