Home Mathematics The Hoffman–Singleton manifold
Article Open Access

The Hoffman–Singleton manifold

  • Daniel Pellicer and Yesenia Villicaña Molina EMAIL logo
Published/Copyright: October 28, 2025
Become an author with De Gruyter Brill

Abstract

We introduce the Hoffman–Singleton manifold based on a particular subgraph of the Hoffman–Singleton graph. This manifold is motivated in a combinatorial fashion, and it is defined rigorously in geometric terms. We also present a few geometric properties of this manifold.

MSC 2010: 05C25; 51M10; 57N10

1 Introduction

Most of our research as mathematicians follows directions that have already been defined, where only one, two or three areas of mathematics are known to be relevant. Many of us find it pleasant when we are made aware of unexpected connections between seemingly far away topics of mathematics.

It seems like the most natural way to construct hyperbolic manifolds is as quotients of the hyperbolic space ℍ3 by torsion free Kleinian groups. In this paper we construct a hyperbolic 3-manifold from a substructure of the famous Hoffman–Singleton graph. This is the only graph with diameter 2, girth 5 and valency 7. Even if in the formal construction of the manifold we pass through a subgroup of a hyperbolic reflection group, the key of the construction is the combinatorial structure of a certain subgraph of the Hoffman–Singleton graph.

The Hoffman–Singleton graph has been an object of extensive study; it is to be expected that some of its interesting combinatorial properties translate into interesting geometric properties of the manifold. For example, many automorphisms of this graph are preserved as isometries of the resulting manifold.

The paper is organized as follows. We describe the Hoffman–Singleton graph and some of its features in Section 2. Then, in Section 3 we formally construct a hyperbolic 3-manifold that is motivated by a substructure of the Hoffman–Singleton graph. In Section 4 we provide some geometric properties of this manifold.

2 Construction from the Hoffman–Singleton graph

Before proceeding to the construction of a manifold we recall some basic properties of the Hoffman–Singleton graph HSG; see for example [1], [5], [6], [7].

The Petersen graph (see Figure 1) and the HSG are the only graphs known to exist with diameter 2, girth 5 (the girth is the length of a shortest cycle) and minimum degree at least 3. In fact, any other such graph must have all its vertices of degree 57, and it is a long-standing problem to determine whether there exist any more.

Figure 1 
					Petersen graph.
Figure 1

Petersen graph.

The HSG is a connected graph with 50 vertices and 175 edges. Every vertex has valency 7 and any pair of vertices that are not adjacent have a neighbor in common. In fact, these properties constitute an alternative equivalent set of properties that completely determine the HSG. It has 252, 000 automorphisms under which all vertices (or edges or arcs) are equivalent. To highlight how symmetric the HSG is, it suffices to compare with the 10 vertices, 15 edges and only 120 automorphisms of the Petersen graph.

The properties of the HSG graph imply that it has no triangles and no squares, and that every path with 3 edges can be completed to a unique pentagon. The following lemma is not obvious, but it can easily be verified either directly (by using the high degree of symmetry of the HSG), or with the help of computer software.

Lemma 2.1

Given any pentagon P of the HSG and an edge e incident to a vertex of P but not belonging to P, there is a unique Petersen graph contained in the HSG that contains P and e.

The uniqueness in Lemma 2.1 (in case such a Petersen graph exists) follows easily from the facts that the HSG has diameter 2 and girth 5. However, the existence of such a Petersen graph does not seem to be derived directly from these properties.

Given an edge e = uv of the HSG, we may label the other neighbors of u and of v by {u1, . . . , u6} and {v1, . . . , v6}, respectively. If

W = V ( H S G ) u , v , u i , v i : i { 1 , , 6 }

then every wW is adjacent exactly to one vertex ui and to one vertex vj . Conversely, the diameter and girth of the HSG imply that there is exactly one vertex in W that is adjacent to a given vertex ui and to a given vertex vj . This justifies to label the element of W adjacent to ui and to vj by the pair (i, j) in (ℤ6)2. The subgraph GW of the HSG induced by W is known as the Sylvester graph; see for example [2, Theorem 7.5.3].

The edges of the HSG between pairs of vertices in W satisfy the following properties, all of them consequences of the degrees of the vertices together with the diameter and girth of the HSG.

  • There is no edge between two vertices having the same first entry, or having the same second entry.

  • Each vertex (i, j) is adjacent to exactly one vertex (iʹ , jʹ) for each iʹi, and adjacent to one vertex (iʹʹ , jʹʹ) for each jʹʹj.

  • The subgraph of the HSG induced by W contains no triangles and no squares.

Furthermore, Lemma 2.1 implies the following two results.

Lemma 2.2

With the notation above, if there is an edge of the HSG between the vertices (i, j) and (k, m) of W, then also (i, m)(k, j) is an edge of the HSG.

Proof. By Lemma 2.1 there is a unique Petersen graph H containing the pentagon with vertices u, v, ui , vj and (i, j) of the HSG as well as the edge (i, j)(k, m). Recall that the Petersen graph has diameter 2. Then H must contain the unique common neighbors uk and vm of (k, m) and u, and of (k, m) and v, respectively. It also must contain the common neighbor (k, j) of uk and vj and the common neighbor (i, m) of ui and vm. The only missing edge to complete the Petersen graph is (i, m)(k, j) and therefore it must be an edge of the subgraph of HSG.

The previous lemma can be reinterpreted as follows. Consider the subgraph GW of the HSG induced by W and arrange the vertices as a 6 × 6 grid. When taking two rows i and k as well as two columns j and m, either GW contains as edges the two diagonals of the rectangle formed by the four intersections of those rows and columns, or GW contains none of the diagonals as edges; see Figure 2.

Figure 2 
					Either the two diagonals of each rectangle or none are part of GW.
Figure 2

Either the two diagonals of each rectangle or none are part of GW.

Lemma 2.3

With the notation above, the subgraph H3 induced by the vertices of three rows of W is the union of three disjoint hexagons. Furthermore, each hexagon has a vertex in each column.

Proof. When restricting ourselves to three rows of W, the properties of the subgraph induced by W forces every vertex to have degree 2, and therefore H3 is union of cycles.

Once again we use Lemma 2.1 to find the unique Petersen graph containing the pentagon with vertices u, ui , uj , (i, m1), (j, m2) and the edge between u and uk (here {i, j, k} = {1, 2, 3} indicate the three rows being considered in H3, while m1 and m2 are some elements of {1, . . . , 6}). It must contain the common neighbors (k, m3) and (k, m4) of uk and (i, m1) and of uk and (j, m2). The two remaining vertices of H must be the neighbor of (k, m3) in row j (and so it is also a neighbor of uj ), and the neighbor of (k, m4) in row i (and so it is also a neighbor of ui ). The only way to complete the Petersen graph is if the last two vertices are also adjacent, completing the hexagon. Since we started with any arbitrary edge (i, m1)(j, m2), it follows that all connected components of H3 are hexagons. Since H3 has 18 vertices, all with degree 2, there must be precisely three connected components. The fact that each hexagon has a vertex in each column follows directly from the properties of the subgraph induced by W.

Up to relabeling of the columns, the subgraph H3 in Lemma 2.3 is the one in Figure 3, where hexagons are distinguished in gray, blue and green. The symmetry properties of the HSG guarantee that any choice of three rows result in the same graph up to relabeling of columns (or equivalently, the neighbors of v).

Figure 3 
					The graph H3 induced by 3 rows is the union of 3 hexagons.
Figure 3

The graph H3 induced by 3 rows is the union of 3 hexagons.

We now construct a map on a surface in the following way. We take the three hexagons of H3 described in Lemma 2.3, each with vertex set {1, . . . , 6} (we only retain the column index j of each vertex (i, j) as a vertex of a hexagon). We consider them as 2-dimensional entities with boundary, not just as vertices and edges. Then Lemma 2.2 together with the properties of the subgraph induced by W force every edge to belong to precisely two such hexagons. Gluing the three hexagons along the edges in common we obtain the desired map; the underlying surface is a torus. The map arising from the hexagons in Figure 3 is illustrated in Figure 4; it was denoted by {6, 3}(1,1) in [3].

Figure 4 
					The map on the torus induced by the three hexagons in Figure 3. Pairs of edges in the boundary with the same vertices are to be identified. Black, red and green edges indicate edges between vertices in the bottom two rows, in the bottom and top row, and in the top two rows, respectively.
Figure 4

The map on the torus induced by the three hexagons in Figure 3. Pairs of edges in the boundary with the same vertices are to be identified. Black, red and green edges indicate edges between vertices in the bottom two rows, in the bottom and top row, and in the top two rows, respectively.

Next, we consider the subgraph H4 of W induced by four of its rows; distinct choices of quadruples of rows yield isomorphic graphs, and hence the rest of the construction does not depend on this choice. The graph H4 is the subgraph of the HSG mentioned in the abstract. From H4 we automatically obtain four isomorphic maps on the torus, all with the same vertex set {1, . . . , 6}. Each of these four maps corresponds to a choice of three rows out of the four considered in H4. Every edge e belongs to precisely two maps on the torus, that correspond to the two choices of the third row of that map, besides the two that involve e. One of these maps is the one in Figure 4; the other three are illustrated in Figure 5 (again, up to relabeling of rows and columns).

Figure 5 
					The remaining three maps on the torus induced by four rows of W. Blue, yellow and purple edges indicate edges between vertices in the first and fourth rows, in the second and fourth rows, and in the third and fourth rows, respectively.
Figure 5

The remaining three maps on the torus induced by four rows of W. Blue, yellow and purple edges indicate edges between vertices in the first and fourth rows, in the second and fourth rows, and in the third and fourth rows, respectively.

For each triple of rows in H4 we consider the three hexagons described in Lemma 2.3 to obtain a total of 12 hexagons, each arising from three rows of H4. Each edge of these 12 hexagons belongs to two of these 12 hexagons. It follows that again we can build a surface out of these hexagons. This surface turns out to be connected and again to be a torus. The resulting map with 12 hexagons is that in Figure 6, up to relabeling the vertices; it was denoted {6, 3}(2,2) in [3].

Figure 6 
					The map on the torus with 12 hexagons obtained from H4. Colors of the edges are explained in Figures 4 and 5.
Figure 6

The map on the torus with 12 hexagons obtained from H4. Colors of the edges are explained in Figures 4 and 5.

We label by X, Y, Z and W the four rows in H4, and label the torus given by three of them by the juxtaposition of the names of the rows. With this understanding the map in Figure 4 corresponds to the torus XYZ, while those in Figure 5 are in the tori XYW, XZW and YZW, respectively.

We have now 5 maps on the torus with the property that every hexagon belongs to two of them: it belongs to the map induced by the three rows containing its edges, and also to the map with 12 hexagons. These 5 maps form a structure of rank 4 (it has four kinds of elements, namely vertices, edges, hexagons and maps) denoted by ‘maniplex’ in [13]. When identifying these 5 maps along the common hexagons, the edges of the map with 12 hexagons get identified by pairs, and the topological space carrying those 12 hexagons is no longer a surface. The underlying graph of the entire structure is the complete graph with vertex set {1, 2, 3, 4, 5, 6} with double edges between 1 and 2, between 3 and 4 and between 5 and 6.

Now we have the ingredients to construct a hyperbolic 3-manifold, which will be called in the following HS-manifold. Intuitively, we construct a cusp based on each of these five tori and glue them by pairs along the common hexagons. Formally, we may take the paracompact hyperbolic honeycomb {6, 3, 4}. The building blocks of this honeycomb are ‘tessellations’ of horospheres by hexagons (the vertices are in the horosphere but the interiors of the edges are not) where every vertex belongs to precisely three hexagons. The honeycomb is constructed so that every edge belongs to precisely four tessellations of horospheres. The symmetry group of {6, 3, 4} is the Coxeter group [6, 3, 4] and it acts transitively on the quadruples consisting of incident vertex, edge, hexagon and tessellation. The quotient of a suitable subgroup of [6, 3, 4] will produce a manifold with 5 cusps, each over a map on the torus like the ones described above. The details of the honeycomb {6, 3, 4} and of this construction of the HS-manifold will be given in the next section. Alternatively, the HS-manifold can also be understood as the underlying topological space of the corresponding combinatorial map in the sense of [12, Section 2], or as the order complex of the maniplex consisting of the five tori, in the sense of [9, Section 2C].

3 Geometric construction of the HS-manifold

As we mentioned before, in this section we describe the details of the HS-manifold that was intuitively constructed in the previous section. From now on, we consider the upper half-space model for ℍ3.

Indeed, let 𝒯 be the hyperbolic tetrahedron with an ideal vertex at ∞and its other three vertices at

v 0 = 2 3 , 0 , 1 3 , v 1 = 3 2 2 , 1 2 2 , 1 2  and  v 2 = ( 0 , 0 , 1 ) .

Its dihedral angles are ∠𝒜𝒞 = ∠𝒜𝒟 = ∠ℬ𝒟 = π/2, ∠ℬ𝒞 = π/3, ∠𝒞𝒟 = π/4 and ∠𝒜ℬ = π/6 (see Figure 7), where 𝒜 = △(v1, v2, ∞), ℬ = △(v0, v2, ∞), 𝒞 = △(v0, v1, ∞) and 𝒟 = △(v0, v1, v2) are the faces of 𝒯 (here △(a, b, c) symbolizes the hyperbolic triangle with vertices a, b and c).

Figure 7 
					The hyperbolic tetrahedron T.
Figure 7

The hyperbolic tetrahedron T.

We denote by R𝒳 the reflection with respect to the plane that contains the face 𝒳 and we consider the Coxeter group

[ 6 , 3 , 4 ] = R A , R B , R C , R D .

Through [6, 3, 4]𝒯, we obtain a paracompact tessellation by tetrahedra of the space ℍ3; see [4]. From this tessellation, we define vertices, edges, hexagons and tessellations of horospheres as follows:

  • Vertices: [6, 3, 4]v0. Note that not all the vertices of the tessellation by tetrahedra are vertices using our definition, only those in the orbit of v0.

  • Edges: [6, 3, 4]a0, where a0 is the geodesic segment between v0 and R𝒜(v0). Note that all edges defined here are the union of two edges of different tetrahedra.

  • Hexagons: [6, 3, 4]h0, where h0 is the hexagon  R𝒜, Ra0.

  • Tessellations: [6, 3, 4]t0, where t0 =  R𝒜, R, R𝒞h0 is the ‘tessellation’ by hexagons (honeycomb) with vertices in the horizontal horosphere at height 1 (the edges are not in the horosphere, but we shall still abuse notation and call t0 a tessellation of that horosphere). Note that for each g ∈ [6, 3, 4], the element g(t0) is a tessellation by hexagons of the horosphere that is centered on g(∞), and that contains all vertices of g(t0).

Given the vertices of a hexagon of t0, we call upward hexagonal cone the convex hull of the point at infinity and these 6 points, and we call downward hexagonal cone the convex hull of these 6 points and the perpendicular projection inℂ ⊂ 3 of the center of the hexagon (see Figure 8).

Figure 8
Figure 8

To construct the HS-manifold, we consider the downward and upward hexagonal cones associated to the 12 hexagons of the map in Figure 6 (see a scale of its geometric realization in Figure 9). From now on, wedenote by ℛ the union of these cones, and we identify its walls according to the combinatorics described in Section 2. Indeed, the identifications of the walls of the upward hexagonal cones are simple, since the walls that are next to each other coincide (and can be understood as identified with each other), and the remaining pairs of boundaries of the upward cones are identified by the three translations zz + 6λ, zz + 6λω and zz + 6λ(1 + ω) (one of them is a composition of the other two), where λ=2/3 and ω = e/3 is the standard 6th root of unity.

Figure 9 
					The map of Figure 6 with coordinates on a scale of 
								1:λ(=2/3),
								$1: \lambda(=\sqrt{2 / 3}),$ where ω = eiπ/3 is a standard 6th root of unity.
Figure 9

The map of Figure 6 with coordinates on a scale of 1:λ(=2/3), where ω = e/3 is a standard 6th root of unity.

The identifications in the downward hexagonal cones are a bit more complicated. Figure 10 shows the correspondence between the hexagons with (6)(12)/2=36 identifications of the triangles of their downward cones. Indeed, on the left side four configurations appear and each one has three hexagons. We identify the faces of the three downward hexagonal cones in each configuration as it is indicated by the numbering of the endpoints of each edge. Then, we identify each of these hexagons with its corresponding hexagon in the configuration on the right (see their letter labels). For example, in Figure 11 we represent the identifications that come from the configuration of the three hexagons labeled with A, B and C as follows: each triangle in Figure 11 represents the ideal triangular face of its downward hexagonal cone adjacent to the respective edge, and we identify faces whose respective triangles are of the same color (just as their respective edges are identified in the map on the torus in Figure 4).

Figure 10
Figure 10
Figure 11
Figure 11
Figure 12
Figure 12

These 36 identifications can easily be written as a composition of two inversions on unit spheres, translations by λ and λω and maybe one rotation by π around a vertical geodesic in ℍ3. For instance, we can identify the ideal triangles associated to the yellow triangles in Figure 11 as follows. Specifically, we will send the vertices (4λ(ω+1),1/3),(λ(3ω+4),1/3) and (3λ(ω + 1), 0) to the vertices (λ(ω2),1/3),(2λ,1/3) and (λ(ω − 1), 0), respectively, through the composition of three functions:

  1. Translation that sends the hexagon A into the hexagon F:

    ( z , t ) ( z 3 λ ( ω + 2 ) , t ) .

    (This sends the triangle with the vertices (4λ(ω+1),1/3),(λ(3ω+4),1/3) and (3λ(ω+1),1) to the triangle with the vertices (λ(ω2),1/3),(2λ,1/3) and (−3λ, 1).)

  2. Inversion in the unit sphere associated to the hexagon F. (This sends the triangle with the vertices (λ(ω2),1/3),(2λ,1/3) and (−3λ, 1) to the triangle with the vertices (λ(ω2),1/3),(2λ,1/3) and∞.)

  3. Inversion in the unit sphere associated to the hexagon C. (This sends the triangle with the vertices (λ(ω2),1/3),(2λ,1/3) and ∞ to the triangle with the vertices (λ(ω2),1/3),(2λ,1/3) and (λ(ω − 1), 0).)

Note that this procedure is not sufficient in some cases. However, it is enough to add a rotation by π around a vertical geodesic in ℍ3. For instance, in order to identify the brown faces in Figure 11, the translation (z, t) → (z+λ(ω−1), t) sends the hexagon B into the hexagon L, then the rotation by π around a vertical geodesic passing through the center of the hexagon C sends the hexagon L into the hexagon K. Finally, to achieve our objective, it is enough to apply the inversion on the sphere associated to K followed by the inversion on the sphere associated to C. Any of the 36 identifications mentioned above can be carried out by a procedure analogous to one of the two previous examples.

Now let us verify that indeed with this construction we obtain a 3-manifold. That is, after these identifications, we must verify that there are balls around the border points of the given fundamental region.

  • Since the walls of 𝒦 are identified two by two and since they are contained in hyperbolic planes, we know that such a ball exists around the points inside the walls.

  • We will study the points inside the edges in two cases: the orange edges and the blue edges in Figure 8 b).

    • A fan of 8 tetrahedra intersects at the orange edges: 4 of them correspond to upward hexagonal cones and the other 4 to downward hexagonal cones. (Recall that every edge appears twice in the torus with 12 hexagons.) Furthermore, the dihedral angles of the tetrahedra that intersect at these edges are all π/4, since they are isometric images of the angle ∠𝒞𝒟 of Figure 7.

    • At the blue edges a fan of 6 tetrahedra intersects: two for the lower cone of each of the three hexagons in the corresponding configuration with three hexagons. The dihedral angles of the tetrahedra at such edges are π/3, since they are isometric images of the angle ∠ℬ𝒞 of Figure 7. Therefore, in both cases, they add up to 2π.

  • 48 tetrahedra intersect around each vertex and all of them are isometric to 𝒯 (see Figure 7). The faces of each tetrahedron that coincide at a given vertex are copies of the faces ℬ, 𝒞, and 𝒟 of Figure 7. This is because in the fundamental region ℛ, 4 vertices are identified and in each of the vertices 12 tetrahedra intersect: 4 tetrahedra for each hexagon (two in the upward hexagonal cone and two in the downward hexagonal cone). Finally, it is a known fact that in the tessellation [6, 3, 4] these same 48 tetrahedra intersect in the same fashion.

The group generated by the last 36 isometries and the 3 isometries that we described before to identify all the walls of the upward and downward hexagonal cones, respectively, is the Kleinian group associated to the HS-Manifold, which we denote by 𝒢HS; equivalently, the HS-Manifold is the quotient ℍ3/𝒢HS.

Moreover, it is possible to express 20 of the 36 identifications in the downward hexagonal cones as a composition of the other 16, and one of the three identifications in the upward hexagonal cones as a composition of the other two. Therefore, 𝒢HS is generated by at most 18 of the 39 isometries discussed above.

4 Some geometric properties of the HS-manifold

4.1 Cusps and volume

Since the HS-manifold is an orientable non-compact hyperbolic 3-manifold of finite volume, it has finitely many disjoint cusps, that is, unbounded ends of finite volume which are diffeomorphic to T × (0, ∞), where T is a flat torus. The geometry of a cusp is completely determined by the geometry of the flat torus, since the shape of T × {t} does not depend on t, that is to say, they are represented by the same element on the moduli space of tori.

In this case, note that in the fundamental region explained in the previous section, there are 5 different orbits in (ℍ3), which correspond to the 5 cusps of HS-manifold. Moreover, all of these cusps have the same shape  1, e/3 , although different volume: 4 of them are small cusps and they are isometric with each other, and the other one is a big cusp. In fact the volume of the maximal big cusp is 4 times the volume of any of the maximal small cusps. Indeed, with each configuration of Figure 10 we will construct a cusp, so that the 4 isometric cusps will correspond to the 4 small configurations and the other cusp will correspond to the big configuration.

The big cusp is the quotient of the horoball {(z, t) ∈ ℍ3 : t > 1} by the following group of isometries:  zz + 6λ, zz + 6λω  (the cusp shape is the blue shaded part in the big configuration of Figure 10). The above is equivalent to considering the intersection of the horoball {(z, t) ∈ ℍ3 : t > 1} with the fundamental region ℛ and quotient it with the group 𝒢HS.

We proceed analogously with the small cusps. Each of them corresponds to one of the configurations of three hexagons in Figure 10. For example, we are going to build the cusp associated with the 3 hexagons with labels A, B and C. These three hexagons correspond to 3 downward hexagonal cones, whose walls are identified according to the colors of the Figure 11, and therefore, vertical projections at (ℍ3) of the centers of the three hexagons are identified (by identifying the yellow faces, for example, we identify vertical projections of the centers of the hexagons A and C, and by identifying the pink faces, the centers of the hexagons A and B). In fact, by construction, this cusp is isometric to the intersection of the space {(z, t) ∈ ℍ3 : t > 1} with the union of the 3 upward hexagonal cones over the 3 hexagons labeled A, B and C, of the small configuration from the upper left corner in Figure 10, after identifying their walls with the translations zz + 3λ and zz + 3λω.

Figure 13
Figure 13

The volume of the tetrahedron 𝒯 (see Figure 7) is well-known; see [10] or [11]. Since the HS-manifold is the union of 288 tetrahedra, and all of them are isometric with each other, its volume is

288 5 6 0 π / 3 log | 2 sin t | d t 81.1953.

4.2 The full group of isometries

Next we determine the full isometry group (isometries that preserve and isometries that reverse orientation). We start by considering the three hyperbolic reflections R0, R1 and R2 by planes perpendicular to the horospheres based at the ideal point of the big cusp. The intersections of R0, R1 and R2 with the configuration of 12 hexagons are indicated as the green, orange and blue lines in Figure 14, respectively.

Figure 14 
						The isometry group of the HS-manifold contains a group isomorphic to [4, 3].
Figure 14

The isometry group of the HS-manifold contains a group isomorphic to [4, 3].

Proposition 4.1

The groupR0, R1, R2is a subgroup of the group of isometries of the HS-manifold, and it is isomorphic to the full isometry group of the cube.

Proof. To verify that each of the reflections is an isometry it suffices to note that it permutes the vertices, the edges, the hexagons and the four small cusps (all of them fix the big cusp). In doing so, it permutes the 288 ideal tetrahedra from which the maniplex was constructed, since the corners of each tetrahedron are a vertex, a midpoint of edge, a center of hexagon, and the ideal point of a cusp. For instance, the reflection indicated in blue in Figure 14 induces the permutation (1, 4)(2, 3) on the vertex set whereas it transposes the tori XYZ and XZW, and fixes each of the tori XYW and YZW. The permutations of the edges and of the hexagons can be derived from those of the vertices and tori. In contrast, the hyperbolic reflection whose reflection plane intersects the large configuration in the blue line in Figure 15 does not induce an isometry of the maniplex, since otherwise the vertex 6 should be swapped with vertex 1 and also with vertex 2, which is impossible (consider the images of the pink points in Figure 15).

Figure 15 
						There is no reflection of the configuration along the blue line.
Figure 15

There is no reflection of the configuration along the blue line.

Next we show that the group  R0, R1, R2  generated by the plane reflections mentioned above is isomorphic to the Coxeter group [4, 3] with the presentation

ρ 0 , ρ 1 , ρ 0 : ρ 0 2 = ρ 1 2 = ρ 2 2 = ρ 0 ρ 2 2 = ρ 0 ρ 1 4 = ρ 1 ρ 2 3 ,

which is the full symmetry group of the cube; see [8]. The angle between the reflection planes Π1 and Π2 of R1 and R2 is π/3, and hence R1R2 has order 3. Next we consider the halfturn T = R0R2 about the intersection ℓ of the reflection planes of R0 and R2. Clearly, T commutes with R2, and hence the order of TR2 is 2. Now, the isometry TR1 is a glide reflection about the plane perpendicular to Π1 that contains ℓ with translation component given by twice the distance from Π1 to ℓ. The order of this glide reflection TR1 is 4 since the translation by 4 times the translation component of TR1 is the sum of two of the translations that determine the identifications of the torus. It follows that  R0, R1, R2  =  T, R1, R2  is a subgroup of [4, 3]. On the other hand, the triangle comprised by the reflection lines in Figure 14 (a) does not tile the region consisting of the 12 hexagons. A standard procedure shows that the smaller triangles in Figure 14 (b) are in fact fundamental regions of the group of isometries of the torus generated by those three line reflections. Since there are precisely 48 small triangles and also 48 elements in [4, 3] we can conclude that  R0, R1, R2 ≅ [4, 3].

Now we have a lower bound on the number of isometries of the HS-manifold. Next we give a tool to obtain an upper bound of this number.

Proposition 4.2

Every isometry of the HS-manifold permutes the 288 ideal tetrahedra described in Section 3. Furthermore, every isometry maps a corner of a given type (vertex, midpoint of edge, center of hexagon or ideal point) to a corner of the same type.

Proof. For each cusp ci with i ∈ {1, 2, 3, 4, 5} we may construct a fundamental region 𝒳i ⊆ ℍ3 of the Kleinian group 𝒢HS described in Section 3, where ci has only one point Pi at infinity. We consider the set of all horospheres centered at Pi whose intersection with 𝒳i is a topological torus. This set is bounded by a horosphere ℋi whose intersection with 𝒳i is a quotient of a torus by the identification of only finitely many points. When ci is the cusp over the large configuration these points are the midpoints of the 18 edges; each of them appears twice in the configuration (note that these are the only points of the edges in that horosphere). However, if ci is the cusp over one of the small configurations, say XYZ, then the intersection of 𝒳i with any horosphere containing a vertex or any point of an edge of the configuration is still a topological torus. It only stops being so when the horosphere contains the midpoint of one edge (in fact, of all nine edges) of the large configuration that is not in XYZ. From here it follows that

  1. The cusp over the large configuration must be preserved by every isometry.

  2. The group of isometries must permute the midpoints of the edges when the HS-manifold is constructed as in Section 3.

Next we take spheres centered at the midpoints of edges, whose radius is half the length of the edge. The 6 vertices are recovered as the only 6 points of the manifold that belong to precisely 6 of those spheres. In fact, each such sphere contains only two of those 6 points, which are precisely the endpoints of the edge containing the center of the sphere. In this way we recover the vertices and edges. From there the hexagons are recovered easily, since each pair of edges incident at a given vertex with an angle of π/2 can be extended to a unique planar regular hexagon having angle π/2 between each pair of consecutive edges.

The previous discussion shows that the isometry group permutes each of the following sets: the set of vertices, the set of midpoints of edges, the set of hexagons (and hence, also the set of their centers), and the set of cusps. This allows us to recover the 288 ideal tetrahedra in a unique way and the proposition follows.

We are ready to specify the group of isometries of the HS-manifold.

Theorem 4.1

The full isometry group of the HS-manifold is isomorphic to the full isometry group of the cube.

Proof. In view of Proposition 4.1 we only need to show that the isometry group of the HS-manifold is precisely the group generated by the plane reflections R0, R1 and R2 defined above. Furthermore, we know from Proposition 4.2 that it must permute the 288 tetrahedra that were used as building blocks of the HS-manifold.

Given an isometry R and a tetrahedron 𝒯0, the four tetrahedra that share a triangular face with 𝒯0 must be mapped by R to four tetrahedra that share a triangular face with RT0. The connectivity of the HS-manifold forces the image of each tetrahedron to be uniquely determined by the image of 𝒯0. It follows that the action of the isometry group on the trahedra is free and therefore the number of isometries is a divisor of 288. Furthermore, every isometry fixes the cusp over the large configuration, and so the 144 tetrahedra in that cusp must be preserved. This implies that the number of isometries is a divisor of 144. Proposition 4.1 already exhibits 48 isometries, and from its proof it follows that a tetrahedron cannot be mapped to its image under the reflection indicated with blue in Figure 15. Then the number of isometries must be a multiple of 48 that is a proper divisor of 144. We can conclude that  R0, R1, R2  is the entire group of isometries.

Remark 4.1

There are two orbits of hexagons under the symmetry group. One orbit (green hexagons in Figure 14a) contains the 4 hexagons invariant under 6 plane reflections, while the other one (purple hexagons in Figure 14a) contains the 8 hexagons invariant only under 3 plane reflections. The edges of the hexagons in the first orbit constitute one orbit of edges, while the other orbit consists of the edges whose endpoints are vertices of distinct hexagons in the first orbit. The second orbit of edges are precisely the double edges; for example, the two edges between vertices 3 and 4 (the black one and the brown one) are not contained in any hexagon in the first orbit.

Remark 4.2

The full isometry group of the HS-manifold is the group of combinatorial automorphisms of the underlying combinatorial model. In comparison, the automorphism group of the toroidal map {6, 3}(2,2) with 12 distinct vertices (instead of the six vertices of the current model) has 144 automorphisms, but only one third of them map the set of double edges of the model of the HS-manifold to itself.

4.3 Some geodesics

Note that the geometry of a plane in ℍ3 is the same as the geometry of the Poincaré disk. This is easy to see, since there is an isometry between any plane in ℍ3 and the vertical plane y = 0 in ℍ3, which is trivially isometric with ℍ2. Finally, it is known that ℍ2 and the Poincaré hyperbolic disk 𝔻2 are isometric. Then, each hexagon can be represented in 𝔻2 since each hexagon belongs to a hyperbolic plane in ℍ3. Furthermore, such a plane is tessellated by congruent hexagons, which is part of the paracompact tessellation that we explained in Section 3. In that tessellation of the hyperbolic plane there are 4 hexagons around each vertex. Indeed, by reflecting through the planes containing the faces in the orbits of 𝒞 and 𝒟 that contain the edge 𝒞 ∩ 𝒟, we get copies of the tetrahedron 𝒯 that share this edge; see Figure 7. Since ∠𝒞𝒟 = π/4, we know that there are 8 copies of 𝒯, and hence four copies of 𝒞 and four of 𝒟; one of the copies of 𝒟 is coplanar to the original 𝒟. By proceeding similarly with the edge ℬ ∩ 𝒟 we obtain 4 copies of 𝒯 forcing the only copy of 𝒟 to be coplanar to 𝒟. Finally, the spherical angle in 𝒟 at the vertex v0 is π/4 and therefore, after proceeding in an analogous way with the appropriate edges, we get 8 copies of 𝒟 all of them coplanar that share the vertex v0. This results in four coplanar hexagons containing v0.

Figure 16 shows the tessellations of a hyperbolic plane centered at a purple hexagon and at a green hexagon of {6, 3, 4}; see Remark 4.1. We call them type I tessellation and type II tessellation, respectively. Recall that the graph embedded in the HS-manifold is the complete graph in the vertex set {1, . . . , 6}, with double edges between 1 and 2, between 3 and 4, and between 5 and 6. Purple hexagons alternate between single and double edges, whereas green hexagons only have single edges. Since the hyperbolic line of ℍ3 containing an edge between preimages under 𝒢HS of vertices 1 and 2 (respectively 3 and 4 or 5 and 6) is tessellated by edges between preimages of vertices 1 and 2 (respectively 3 and 4 or 5 and 6), every hexagon of a tessellation of type I is purple, and every hexagon of a tessellation of type II is green.

Figure 16 
						Some closed simple geodesics of the HS-manifold, viewed in the tessellations of a plane which contains a hexagon.
Figure 16

Some closed simple geodesics of the HS-manifold, viewed in the tessellations of a plane which contains a hexagon.

For the next result, a diagonal will be a geodesic segment in 𝔻2 with end points at opposite vertices of a hexagon, and a height a geodesic segment with end points at the midpoints of opposite edges of a hexagon.

Proposition 4.3

Some closed simple geodesics of the HS-manifold are:

  1. The union of two consecutive diagonals which are part of the same geodesic in 𝔻2. The length of such a geodesic is 2ln(5+26).

  2. The union of two consecutive heights which are part of the same geodesic in a type II tessellation of 𝔻2. The length of a geodesic of this type is 4ln(1+2).

  3. The union of four consecutive edges which are part of the same geodesic in a type II tessellation of 𝔻2. In the case of type I tessellations, some of them are the union of only two consecutive edges (two distinct edges between the same pair of vertices). The lengths of geodesics of this type are 2ln(23)or4ln(23), depending on the type of tessellation.

Proof. As we verified before, there are 6 vertex orbits and the degree of each vertex is 6. Moreover, from Figure 10 we can determine the labels of all neighboring vertices of each of the vertices, see Figure 17, and therefore we can label the vertices of the tessellations in Figure 16.

We will focus on the first item for tessellations of type II. Since all diagonals of a hexagon in a tessellation of type II are equivalent under the symmetry group, we only consider one of them. Let γʹ be the geodesic segment formed by the two green diagonals (see Type II tessellation of Figure 16), that is the geodesic segment with endpoints v61:=312i and v62:=26313i when considered in 𝔻2 (both labeled with the number 6). Let γ be the complete geodesic in 𝔻2 that contains γʹ, that is the geodesic with endpoints i and −i in the absolute plane. Let v51:=132i be the vertex labeled with 5 which is the midpoint between v61 and v62.

In the quotient ℍ3/𝒢HS (see Section 3), we want to prove that the image of γ is a closed simple geodesic in the HS-manifold. Indeed since v61 and v62 belong to the same orbit, there is a unique isometry f ∈ 𝒢HS such that fv61=v62. Then, fv51 is a vertex at distance 2ln(1+2/3) from v62 and with label 5. This means that fv51=v51 or fv51=v52:=393774i (this is the only neighbor of v62 with label 5, other than v51. Since f cannot have fixed points in 𝔻2 we conclude that fv51=v52.

Figure 17 
						There are six vertex orbits, and each of them has the adjacencies shown in this figure. That follows from the combinatorics of Figure 10. Furthermore, any three aligned vertices correspond to a geodesic segment in ℍ3 with vertices labeled with the three numbers appearing on that line, and therefore, any two lines (two pairs of opposite vertices intersecting at another vertex) belong to a hyperbolic plane in ℍ3.
Figure 17

There are six vertex orbits, and each of them has the adjacencies shown in this figure. That follows from the combinatorics of Figure 10. Furthermore, any three aligned vertices correspond to a geodesic segment in ℍ3 with vertices labeled with the three numbers appearing on that line, and therefore, any two lines (two pairs of opposite vertices intersecting at another vertex) belong to a hyperbolic plane in ℍ3.

It follows that f(γ) is γ, and the restriction of f to the plane in consideration must be a loxodromic isometry with fixed points i and −i, whose axis of symmetry is γ.

In the remaining cases we proceed in a completely analogous way. It is only necessary to update the labels of the vertices or midpoints of edges.

Finally, in order to know the lengths of the aforementioned geodesics, it is enough to compute the lengths of a diagonal, a height, and an edge, which are ln(1+2/3),2ln(1+2) and ln(23), respectively.

There are also non-simple closed geodesics that are easy to recognize thanks to combinatorics. Examples of these are any union of 4 consecutive heights which are part of the same geodesic in a type I tessellation of 𝔻2. They are closed geodesics with one self-intersection. This is because the ends of any union of two consecutive heights that belong to the same geodesic are in the same equivalence class, and to verify that we need 4 heights to obtain the total length of the geodesic, we justify in a similar way to the procedure followed in the demonstration of the previous proposition. Consider as an example the pink geodesic of the type I tessellation in Figure 16; its endpoints and its midpoint are in the same equivalence class (all three are midpoints of the same edge between a vertex labeled with 3 and a vertex labeled with 4). The length of a geodesic of this type is 8ln(1+2).

On the other hand, as we mentioned before, there are 5 different orbits in (ℍ3) by the action of the group 𝒢HS which correspond to the five cusp of the HS-manifold. We call cusp point any element in any of these orbits. Then unicuspid and bicuspid geodesics are easy to define; a bicuspid geodesic is one that is a projection of a geodesic whose ends are cusp points, and a unicuspid geodesic is one that is a projection of a geodesic whose ends are a cuspid point and a non-cusp point. In our case, the cusp points are the elements in the orbits of the point at infinity or some of the orthogonal projections of the centers of the hexagons; see Figure 9. Therefore, the vertical geodesics in ℍ3 that pass through the center of each hexagon are examples of bicuspid geodesics.

5 Conclusions

Besides its relationship with the HSG, the manifold presented in this work has a rather large group of isometries with respect to its volume. These were two of the original motivations to describe this object. This first introduction to the HS-manifold describes only few of its properties. Nevertheless, they show that this manifold is interesting from the perspectives of geometry of hyperbolic manifolds, topology of hyperbolic manifolds, group theory related to hyperbolic Coxeter groups, and combinatorics of CW-complexes. We believe that a deeper study will uncover deeper connections among these areas, and perhaps include some others.

Funding statement: This paper was supported by CONACYT “Fondo Sectorial de Investigación para la Educación” under grant A1-S-10839.

  1. Communicated by: T. Grundhöfer

References

[1] C. T. Benson, N. E. Losey, On a graph of Hoffman and Singleton. J. Combin. Theory Ser. A 11 (1971), 67–79. MR281658 Zbl 0223.5001910.1016/0095-8956(71)90015-3Search in Google Scholar

[2] A. E. Brouwer, A. M. Cohen, A. Neumaier, Distance-regular graphs. Springer 1989. MR1002568 Zbl 0747.0507310.1007/978-3-642-74341-2Search in Google Scholar

[3] H. S. M. Coxeter, W. O. J. Moser, Generators and relations for discrete groups. Springer 1965. MR174618 Zbl 0133.28002Search in Google Scholar

[4] M. W. Davis, The geometry and topology of Coxeter groups, volume 32 of London Mathematical Society Monographs Series. Princeton Univ. Press 2008. MR2360474 Zbl 1142.20020Search in Google Scholar

[5] C. Godsil, G. Royle, Algebraic graph theory. Springer 2001. MR1829620 Zbl 0968.0500210.1007/978-1-4613-0163-9Search in Google Scholar

[6] P. R. Hafner, The Hoffman–Singleton graph and its automorphisms. J. Algebraic Combin. 18 (2003), 7–12. MR2002216 Zbl 1021.0504610.1023/A:1025136524481Search in Google Scholar

[7] A. J. Hoffman, R. R. Singleton, On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4 (1960), 497–504. MR140437 Zbl 0096.3810210.1147/rd.45.0497Search in Google Scholar

[8] J. E. Humphreys, Reflection groups and Coxeter groups. Cambridge Univ. Press 1990. MR1066460 Zbl 0725.2002810.1017/CBO9780511623646Search in Google Scholar

[9] P. McMullen, E. Schulte, Abstract regular polytopes, volume 92 of Encyclopedia of Mathematics and its Applications. Cambridge Univ. Press 2002. MR1965665 Zbl 1039.5201110.1017/CBO9780511546686Search in Google Scholar

[10] R. Meyerhoff, A lower bound for the volume of hyperbolic 3-orbifolds. Duke Math. J. 57 (1988), 185–203. MR952231 Zbl 0664.5700510.1215/S0012-7094-88-05708-0Search in Google Scholar

[11] J. Murakami, M. Yano, On the volume of a hyperbolic and spherical tetrahedron. Comm. Anal. Geom. 13 (2005), 379–400. MR2154824 Zbl 1084.5100910.4310/CAG.2005.v13.n2.a5Search in Google Scholar

[12] A. Vince, Combinatorial maps. J. Combin. Theory Ser. B 34 (1983), 1–21. MR701167 Zbl 0491.0505310.1016/0095-8956(83)90002-3Search in Google Scholar

[13] S. Wilson, Maniplexes: Part 1: maps, polytopes, symmetry and operators. Symmetry 4 (2012), 265–275. MR2949129 Zbl 1351.5201010.3390/sym4020265Search in Google Scholar

Received: 2025-01-08
Revised: 2025-06-10
Published Online: 2025-10-28
Published in Print: 2025-10-27

© 2025 Walter de Gruyter GmbH, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 27.1.2026 from https://www.degruyterbrill.com/document/doi/10.1515/advgeom-2025-0027/html
Scroll to top button