WorksMathematics
Flatness and Tightness in Hypertopes
Abstract
A hypertope is a thin, residually connected incidence geometry. For each pair of types , the residues of that type must be polygons, and if all residues of that type are the same type of polygon, then we can record this information in a diagram . Given such a diagram, we prove a lower bound on the number of chambers of a hypertope with that diagram. A hypertope that achieves this bound is called tight. We prove that a hypertope is tight if and only if its diagram is a forest and, for every pair of types that is not an edge of , every -element is incident to every -element. This generalizes a previously known result about abstract polytopes. Finally, we describe a combinatorial method and an algebraic method for constructing tight hypertopes.
Introduction
The theory of abstract polytopes is rich and by now well-established. It combines elements of geometry, combinatorics and group theory. Abstract polytopes are usually defined as posets satisfying a set of defining properties inspired by those of convex polytopes. From the point of view of incidence geometry, an abstract polytope is defined as a thin, residually connected geometry with a linear Buekenhout diagram [1]. The linearity of the diagram induces a partial order on the elements and allows for the use of many geometrical tools. Nonetheless, much of the underlying combinatorics and group theory remains valid regardless of the diagram. Hypertopes, first introduced in [9], are the objects obtained by dropping the linearity condition on the diagram of a polytope. They are thus thin, residually connected geometries.
A hypertope is called regular when it has the highest degree of symmetry, meaning that its automorphism group acts transitively on its chambers. It turns out that regular hypertopes can always be constructed from smooth quotients of Coxeter groups. From this point of view, allowing nonlinear diagrams is a natural step. It brings into consideration geometries associated with arbitrary Coxeter groups, allowing for new behaviours and symmetries while preserving a considerable amount of the structure of polytopes. This broader setting also connects the theory to other well-known objects,
E-mail addresses: [email protected], [email protected], [email protected].
Date: November 20, 2026. such as hypermaps and Coxeter complexes. Moreover, nonlinear diagrams allow for other interactions between the different types of elements, and in particular for symmetry phenomena that cannot occur in the linear setting, such as trialities or higher order correlations [11, 12].
Even when focusing on polytopes, it can be beneficial to distinguish between properties that are intrinsically related to the linearity of the diagram, and thus to the natural partial order on the faces, and those that are more combinatorial or group-theoretical in nature. We therefore believe that studying hypertopes can help deepen our understanding of thin, residually connected geometries and thus, in particular, of abstract polytopes.
As with hypertopes, the study of abstract polytopes is primarily concentrated on those that are regular or otherwise highly symmetric. A natural way to remove this symmetry requirement while still insisting on some degree of homogeneity is to study equivelar polytopes, which are precisely polytopes that have a Buekenhout diagram where every edge is labeled with a single number . In other words, these are the polytopes such that residues of each type () are -gons. Once we fix a diagram, a simple counting argument establishes a lower bound on the number of chambers ([3 Proposition 3.3]). A polytope that achieves this lower bound is called tight. Several papers have explored the structure of tight polytopes, whether in the presence of high symmetry [2, 4, 7, 8] or without it [3]. There are two important general results. The first is that the diagram of a tight polytope cannot have two odd labels in a row [3 Proposition 3.9]. The second is that an -polytope is tight if and only if it is -flat for each (that is, every -element is incident to every -element) [3 Theorem 4.4].
In this paper, we seek to extend the machinery from [3] to hypertopes. First, we give a lower bound on the number of chambers of a hypertope with a given diagram . A hypertope that meets this lower bound is called tight. We investigate two questions:
If a hypertope is tight, what restrictions does that put on its diagram ?
Is there a relation between tightness and flatness, analogous to the situation with polytopes?
This culminates in Theorem 4.14, where we find that a hypertope is tight if and only if its diagram is a forest and, for every non-edge of , every -element is incident to every -element.
We also describe two constructions for building tight hypertopes. The first is combinatorial, adapting the techniques of [5]. Indeed, the construction more generally can be used to build “small” extensions of an existing hypertope, and the properties of this extension are collected in Theorem 5.7. The second construction is algebraic and uses the techniques described in [15] to build tight regular hypertopes.
We start by giving background on incidence systems and hypertopes in § 2. Then we generalize the notion of flatness from polytopes to incidence systems in § 3. In § 4, we establish a lower bound on the size of a hypertope with a given diagram, and we derive several structural results on those hypertopes that meet the lower bound (tight hypertopes). Finally, we describe constructions for flat and tight hypertopes in § 5 and § 6.
Background
Incidence systems
Incidence systems. Incidence systems are a mathematical concept that encodes a great many of the geometrical and combinatorial structures that one may encounter in mathematics. We give here a brief account of the main definitions and terminology of incidence systems. For a more detailed introduction to incidence geometry, we refer to [1].
A triple is called an incidence system over if
is a set whose elements are called the elements of ,
is a symmetric and reflexive relation (called the incidence relation) on , and
is a map from to , called the type map of , such that distinct elements with satisfy .
Elements of are called the elements of type . The rank of , denoted as , is the cardinality of the type set , which we will assume is finite for the remainder of the paper. A flag in an incidence system over is a set of pairwise incident elements. The type of a flag is , that is the set of types of the elements of . The rank of a flag is the cardinality of , while its corank is rank. A chamber is a flag of type . An incidence system is an incidence geometry if all its maximal flags are chambers. We will denote the set of chambers of by .
Let be a flag of . An element is incident to if for all . The residue of with respect to , denoted by , is the incidence system formed by all the elements of incident to but not in . The rank of the residue is equal to , the corank of . The type of a residue is the set ; equivalently, it is the cotype of . Thus, a residue of type is the residue of a flag of cotype . Said another way, the type of a residue is the set of types that remains.
The incidence graph of is a graph with vertex set and where two elements and of different types are connected by an edge if and only if . An incidence geometry is connected if its incidence graph is connected. It is residually connected if all its residues of rank at least two are connected. An incidence geometry is thin if all its residues of flags of corank one contain exactly two elements.
A thin residually connected incidence geometry is called a hypertope. Unless otherwise stated, we will assume that our hypertopes are finite.
An automorphism of an incidence geometry is a bijection of respecting the incidence relation and such that for all . The group of all automorphisms of is denoted by .
The incidence geometry is said to be flag-transitive if the action of on the set of flags of each type is transitive. It is said to be incidence-transitive if, for each , the action of is transitive on pairs such that , , and . A flag-transitive hypertope is also called regular.
Coset incidence systems
Highly symmetric incidence geometries can be constructed from a group together with a set of subgroups of as described in [16].
A coset incidence system , denoted also as , is the incidence system over the type set where:
The elements of type are left cosets of the form , .
The incidence relation is given by non-empty intersection. More precisely, the element is incident to the element if and only if .
We usually refer to the subgroups as the (standard) maximal parabolic subgroups. For , we define (standard) parabolic subgroups as , and define . When , we say that are the minimal parabolic subgroups, and we will denote them as . Finally, the subgroup is called the Borel subgroup of .
Any incidence system that contains a chamber and is incidence-transitive can be constructed as a coset incidence system.
Lemma 2.1. [1 Lemma 1.8.2] Let be an incidence system such that acts incidence-transitively on . Let be a chamber of . Then, we have where is the stabilizer of in .
Chamber systems
The concept of chamber system was invented by Tits in [17]. A chamber system over is a pair consisting of a set , whose members are called chambers, and a collection of equivalence relations on , indexed by . Two chambers and are called -adjacent if . For , each -equivalence class is called an -panel. The rank of is . The chamber system is called thin if every -panel is of size exactly 2.
For , we denote by the union of all with . A connected component of the graph of is called a -cell of . For , the -cells are called -elements of (called -objects in [1 Definition 3.2.2]). In this article, we will only deal with thin chamber systems. In that case, the chamber system over can be thought of as an -valent graph with a proper -coloring of its edges. The vertices of this graph correspond to the chambers of and two distinct chambers are connected by an -colored edge if and only if they are -adjacent. Whenever is thin, it guarantees that there is exactly one edge of each color at each vertex. In this context, a -cell of is a connected component of the graph obtained by deleting all edges of color in .
A chamber system over is residually connected if, for every subset of and every system of -elements , one for each , with the property that any two have a non-empty intersection, it follows that is an -cell.
It is always possible to construct an incidence system from a chamber system. Beware that in general, information can be lost in the process. If is a chamber system, the incidence system of , denoted by , is the incidence system over determined as follows. Its -elements, for are the pairs with an -element of ; two elements and of are incident if and only if in , i.e., and have a chamber in common. (The pairs contain the type because it may happen that for some , an -element and a -element consist of the same chambers, and we need to distinguish the corresponding elements in the incidence system.)
The next theorem is a simplified version of Theorem 3.4.6 in [1]. Please refer to the original textbook for the more precise statement, which requires a bit more background that what is given in this section.
Theorem 2.2. Let be the collection of all residually connected geometries over and let be the collection of all residually connected chamber systems over . There is a bijective homomorphism preserving structures between the collections and . Thus, each residually connected geometry over corresponds to a unique residually connected chamber system over (up to isomorphism), with the same automorphism group, and vice versa.
Therefore, when considering only residually connected incidence geometries and residually connected chamber system, one can freely go back and forth between the two view points.
Diagrams
Francis Buekenhout introduced a diagram associated to incidence geometries [1]. The main idea is that local information, given by rank two residues, often imposes global conditions on the whole geometry. The definition of diagram holds for any incidence geometry. Here, we will give the definition in the context of hypertopes only, for simplicity.
Let be a hypertope, that is, a residually connected and thin incidence geometry. We have seen in § 2.3 that we can also consider as a chamber system. Let be the type set of . For any , since is thin, any rank two residue of type of must be the geometry of an -gon, for some integer . From the point of view of thin chamber systems, the graph obtained from the chamber graph of by deleting all edges of color not equal to or must be a cyclic graph of length with edges of alternating colors. Of course, the integer usually depends on the rank two residue we chose, and not only on the types and . The integer is called the parameter of the residue.
In this paper, a diagram is a labeled graph whose vertex set is and whose edges are labeled by integers strictly greater than two. By convention, a missing edge in should be understood as an edge with label 2. We say that belongs to , or that has diagram , if, for every , all rank two residues of type of have the same parameter (that is, the residues are -gons), and that this parameter is exactly the label of the edge of .1
Note that a hypertope belonging to a linear diagram is an abstract polytope (see [18]). In fact, it is an equivelar polytope, which is to say that it has a Schläfli symbol. Thus, we may think of hypertopes that belong to a diagram as being a generalization of equivelar abstract polytopes.
Diagrams for more general incidence geometries are more detailed, because the rank two residues are much more varied. In this paper, our results that involve diagrams of incidence geometries only need information about the underlying graph, so will not worry about these additional parameters.
The diagram of a hypertope provides an easy lower bound on the number of -elements for each :
Proposition 2.3. In a hypertope with diagram , the number of -elements is at least .
Proof. In order for the residue of type to be a -gon, there must be at least -elements.
In other words, if we look at node in the diagram, then there are at least as many -elements as the largest label among all edges incident to . Recall that if there is no edge between and in the diagram, we consider that the same as there being an edge of label 2, so that in this case.
Note that if is regular, it is incidence-transitive, and thus can be constructed as a coset geometry (see Lemma 2.1). The thinness of , together with residual-connectedness, forces the minimal parabolic subgroups to be cyclic groups of order two. Hence for some involution . Then, when is regular, the integer can also be understood as the order of in . Therefore, in the context of highly symmetric hypertopes, the Buekenhout diagram of is equivalent to the Coxeter diagram of .
For some diagrams, the incidence relation gains some degree of transitivity (not to be confused with incidence-transitivity, which is about the action of on incident pairs). Though we are mainly interested in hypertopes, the following result applies to any incidence geometry with a diagram.
Lemma 2.4. Let be a residually connected incidence geometry with diagram . Suppose that is an -element, is a -element, and is a -element such that and . If and are in separate connected components of , then .
Proof. Both and are in the residue , and the diagram of is a subgraph of , and so has and in separate components. It follows that every -element of is incident to every -element by [1 Theorem 2.1.6], and so .
Direct sums
There is a natural notion of the direct sum of incidence geometries [1 Definition 2.1.8]. Specifically, suppose is a collection of pairwise disjoint sets, and consider a collection of incidence geometries over , where the sets are pairwise disjoint. Then the direct sum of these is an incidence geometry over , where and the type function is defined by . Incidence is defined by requiring , and then setting for all for . That is, incidence between two elements in the same remains unchanged, and every pair of elements from different sets and is incident.
For as defined above, if the individual summands have diagram , then has diagram . The converse is true for hypertopes:
Proposition 2.5. [1 Corollary 2.1.10] If is a hypertопe with diagram , and has connected components , then is isomorphic to the direct sum of , where is the hypertopе corresponding to (that is, the induced geometry with all elements of the types in ).
Flatness
In the theory of abstract polytopes, a polytope is said to be -flat if every -face (-element) is incident to every -face (see [13 Section 4E]). It makes sense to extend this definition to arbitrary incidence systems (though we will primarily be concerned with hypertopes):
Definition 3.1. For types , an incidence system is -flat if every -element is incident to every -element. If an incidence system is -flat for some choice of and , then we also say simply that it is flat.
Equivalently, an incidence system is -flat if the subgraph of the incidence graph that is induced by all nodes of types and is a complete bipartite graph.
Proposition 3.2. Suppose that is an incidence system that is -flat. Then the residues of that contain types and are -flat. Furthermore, if is an incidence geometry with diagram , then and are not adjacent in .
Proof. The first part is clear: every -element is incident to every -element, and this incidence persists in the residue. When is an incidence geometry, being -flat means that the residues of type are generalized digons ([1 Definition 2.1.1]). Thus, and are not adjacent in the diagram of .
Next, we prove an analogue of [13 Lemma 4E3] for hypertopes, which is a partial converse to Proposition 3.2.
Proposition 3.3. Let be a residually connected incidence geometry with diagram . Consider types , , and such that and are in separate connected components of . If the residue of every -element of is -flat, then is -flat.
Proof. Let be an -element and be a -element of . Since is residually connected, there is a sequence
such that each is a -element, each is a -element, and every pair of adjacent elements is incident (see [1 Lemma 1.6.3]). Now, is an -element that is incident to and is a -element that is incident to so that and are in the residue . Since the residue at every -element is -flat, it follows that is incident to . Furthermore, is incident to . Then by Lemma 2.4, it follows that is incident to . Then again by flatness of every -residue, we get that is incident to , and continuing in this way we establish that is incident to , and so is -flat. □
Proposition 3.4. Let be an -hypertotope with diagram . Suppose that for some and , the number of -elements is exactly . Then:
is -flat for each .
for each . In particular, in the diagram , is either an isolated node or a leaf node connected only to type .
Proof. Suppose the number of -elements is and let be a -element of . For any flag of type containing , the residue is a -gon. Hence, all -elements appear in this residue and therefore, we get that is incident to all -elements of . Therefore, every -element is incident to every -element, so is -flat.
The second part follows from the first and Proposition 3.2. □
Corollary 3.5. Let be an -hypertotope with diagram . The number of -elements of is if and only if is -flat for each .
Proof. Proposition 3.4 shows one direction. For the other, suppose is -flat for each , and consider a residue of type . Since in every -element is incident to every -element for every , it follows that every -element is in this residue. On the other hand, the residue is a -gon, so there are exactly -elements. □
Tightness in hypertopes
Our next goal will be to establish a lower bound on the size of hypertopes with a given diagram, and to further characterize those hypertopes that meet the lower bound. Let us start by reviewing the situation for polytopes (hypertopes with a linear diagram).
An equivelar polytope of type has at least chambers [3 Proposition 3.3], and when has exactly that many chambers, it is called tight. In rank 3 there is an obvious necessary condition that follows from the fact that the number of chambers must be a multiple of 4, and this condition turns out to be sufficient:
Theorem 4.1 ([3 Theorem 5.1]). There is a tight polyhedron (3-polytope) of type if and only if and are not both odd.
If we are looking for tight regular (flag-transitive) polyhedra, then the situation is more nuanced. The result below follows from [2 Theorem 3.4] and [7 Theorem 5.10].
Theorem 4.2. There is a tight regular polyhedron of type if and only if one of the following is true:
and are even.
is odd and is an even divisor of or is odd and is an even divisor of .
is an odd multiple of 3 and or is an odd multiple of 3 and .
The lower bound for the size of equivelar polytopes follows from a simple chamber-counting argument, so let us try the same idea for hypertopes. To begin, we make the following definition: if is a tree with edge labels, then the weight of , denoted , is the product of the edge labels. The weight of a single isolated vertex is defined to be 1. The weight of a forest is defined to be . Thought of another way, given a forest consisting of trees, we can turn it into a tree by adding edges with label 2, and then is the weight of this new tree.
Proposition 4.3. If is a hypertope with connected diagram , and is a maximum-weight spanning tree of , then has at least chambers.
Proof. It suffices to prove the bound for all spanning trees of . When , the diagram is a single node, which has weight 1, and must be the geometry of an edge, with two chambers. When , must be a polygon and the result is also true. Now suppose and that the result is true for -hypertopes. Let be a spanning tree of , and let be one of the leaf nodes. Suppose an edge of weight connects to . Then we may specify a chamber of by picking an element of type , and then picking a chamber in the residue of . There are at least choices of element (by Proposition 2.3), and since is a spanning tree of , the residue has at least chambers, by inductive hypothesis. The result follows.
We will be discussing spanning forests of a diagram in this section, by which we will always mean a collection of spanning trees, one per connected component of . (For example, we are not considering taking a spanning tree of a connected graph and then just removing one edge.)
Corollary 4.4. If is a spanning forest of the diagram of , then .
Proof. Since is a spanning forest with trees, has diagram , where is a spanning tree of for each . Then, since is residually connected, is the direct sum of the geometries corresponding to each (by Proposition 2.5), and the number of chambers is at least the product of the number of chambers from each geometry. So the number of chambers is at least
Notice that if has a linear diagram, then this is precisely the same bound as what was already known for polytopes.
With this new size bound for hypertopes, we make the following definition:
Definition 4.5. If is a hypertope with diagram , we say that is tight if for a maximum-weight spanning forest of .
Proposition 4.6. Suppose has diagram . Then is the direct sum of hypertopes , and is tight if and only if each is tight.
Proof. That is a direct sum follows from Proposition 2.5. Furthermore, since every element of is incident to every element of whenever , it follows that
Then is tight if and only if , where is a max weight spanning forest of . Now, Proposition 4.3 says that
and we get equality only when for each , and the result follows.
Proposition 4.7. Suppose that is a tight -hypertope with , and let be a leaf of a maximum-weight spanning forest .
(a) If is isolated, then there are two -elements, and otherwise the number of -elements is equal to the weight of the edge at .
(b) The residue of at every -element is tight.
(c) For every type not adjacent to in , the hypertope is -flat.
Proof. Let be the number of -elements. Let be the label of the unique edge at , or 2 if there is no label. We can pick a chamber of by first picking an -element and then picking a chamber in the residue . By Proposition 4.4, the residue has at least chambers, so
On the other hand, by assumption we have
and so . Since we also have by Proposition 2.3, it follows that . Then it also follows that , which means that is tight. The last part follows from the first part and from Proposition 3.4. □
Now we come to our first big structural result about tight hypertopes.
Theorem 4.8. If is a tight hypertope with connected diagram , then is a tree.
Proof. We prove the result by induction on , the rank of the hypertope. It is trivially true for . Suppose that and that the result is true for -hypertopes. Let be a maximum-weight spanning tree for the diagram . Let be one of the leaf nodes of , and let be the neighbor of in . Then by Proposition 4.7(c), the hypertope is -flat for each , and by Proposition 3.2, that implies that for . In other words, the only proper edge in that involves is the edge between and . Now, by Proposition 4.7(b), any residue with an -element is tight, and so by inductive hypothesis, the diagram is a tree. Since is obtained from by adding a leaf node that is attached to a tree, no new cycles are created, and so is itself a tree. □
Corollary 4.9. All tight 3-hypertopes are polytopes (polyhedra).
Proof. A tight 3-hypertope either has a disconnected diagram, or a tree diagram which must then be linear, and a hypertope with such a diagram is precisely an abstract polytope. □
Now we can extend Theorem 4.7 to show that every residue of a tight hypertope is tight.
Corollary 4.10. If is a tight -hypertope with , then every residue of is tight.
Proof. It suffices to prove that the residue at any element of type is tight. By Proposition 4.6 and Theorem 4.8, we may assume that the diagram of is a forest. Let be the connected components of the diagram . Since is residually connected, is a direct sum of hypertopes with these diagrams. For each , we can obtain by successively deleting leaves from , and so Proposition 4.7(b) proves that each is tight. It follows that itself is tight. □
All together, Theorem 4.8, Corollary 4.9, and Corollary 4.10 tell us that tight hypertopes are made by suitably gluing together tight polyhedra such that the diagram is a tree. Thus, restrictions on tight polyhedra yield restrictions on tight hypertopes of all ranks.
Proposition 4.11. If is a tight hypertope with connected diagram , then is a tree with no adjacent odd labels.
Proof. Two adjacent edges in determine a residue that must be a tight polyhedron, and the result follows from Theorem 4.1. □
Proposition 4.12. If is a tight regular hypertope with connected diagram , then each edge with an odd label is only adjacent to edges with labels that are even divisors of , unless is a multiple of and is adjacent only to edges with labels and .
Proof. This follows from Theorem 4.2 considering that every rank residue of a tight regular hypertope must be a tight regular polyhedron.
Having worked out several necessary conditions for tight hypertopes, we will describe some constructions for them in the next section. First, though, let us work out more of the combinatorial information of tight hypertopes. First, we determine the number of elements of each type.
Proposition 4.13. Suppose is a tight -hypertotope with diagram . Then the number of -elements is
Proof. If is disconnected, so that is a direct sum (see Proposition 2.5), then the number of -elements of is the same as the number of -elements of the hypertope that corresponds to the connected component of in . Thus, we may assume that is connected. Then since is tight, is a tree, and . On the other hand, we can specify a chamber by first picking an -element , and then picking a chamber in the residue of . Thus
where is the number of -elements. Now, is tight by Corollary 4.10. The diagram of consists of connected components, trees , so we have
Now,
and so
Now we can relate tightness to flatness in a way that extends [3 Theorem 4.4].
Theorem 4.14. A hypertope is tight if and only if it has a forest diagram and, for every non-edge of , is -flat.
Proof. We prove the result by induction on the rank . The result is trivial for , since every polygon is tight. Suppose and that the result is true for -hypertopes.
First, suppose is tight. Proposition 4.6 and Theorem 4.8 establish that has a forest diagram . Now consider types and not joined by an edge in . If and are in separate connected components of , by [1 Theorem 2.1.6], every -element is incident to every -element, so is -flat. Otherwise, we may suppose that and are in the same connected component.
If either or is a leaf node, then Proposition 4.7(c) says that is -flat. Otherwise, there is some node that is adjacent to and not on the unique path between and . Now, for every -element , the residue is a tight hypertope (by Corollary 4.10). Since the diagram of is , and there is no edge in , it follows that is -flat by inductive hypothesis. Note that removing node from would disconnect from ; otherwise there would be a cycle. Thus Proposition 3.3 implies that itself is -flat.
Conversely, suppose that has a forest diagram and is -flat whenever is not an edge of . Consider a leaf node of , connected by an edge of label to some type . By assumption,
is -flat for each , and so by Corollary 3.5, the number of -elements is . Now, note that the residue at any given -element also satisfies our hypotheses, and so is tight by inductive hypothesis. It follows that
with the last equality following from the fact that the only edge weight missing from compared to is the edge of weight at type . Thus, is tight. □
Flat extensions of hypertopes
Let be an -hypert ope. We say that the -hypert ope is an extension of if there is a type such that all residues of of cotype are isomorphic to . Suppose we start with and want to build an extension . How can we accomplish this?
One way that always works is to add a new type to the types of , make exactly two elements of that type, and then make those two elements incident to every other element of . Indeed, this is merely the direct sum of with a -hypert ope. It is straightforward to show that this yields a hypert ope. We will call hypertopes obtained this way trivial extensions. Note that, due to thinness, we cannot try to do the same thing with three or more elements (that is, we cannot add three new elements and make them incident to every element of ).
What other “small” extensions can we try? Suppose we want to have -elements such that is isomorphic to . While we cannot make these elements incident to all other elements of , could we pick a single type of and make each -element incident to all elements of other than the -elements? In other words, we want to be -flat for . By Theorem 3.2, this requires that , which is to say that type is not connected to type in the diagram of . So the diagram of consists of the diagram of , with a single node added and connected to a single type of with an edge labeled . We will call an extension of this type a flat extension of . Without loss of generality, we will usually assume that has types and that . (Though let us emphasize that the linear order of types has no bearing here.)
In Flat extensions of abstract polytopes, the first author considered this problem in the context of polytopes [5]. The idea was to take several copies of the flag graph (chamber system) of the -polytope and then add a new perfect matching corresponding to the new type. The new polytope had facets (the residues of the new elements) isomorphic to , and it was -flat. The same construction works here with very little modification; let us describe it.
Fix an -hypert ope with chamber system . For , let be the permutation of the chambers of induced by edges of color . If is a chamber of and , we will use to denote the image of under . We start with copies of , with an even integer, so that our chambers can be written as with being the layer of the chamber. We want to add edges of color such that the resulting chamber system is a hypert ope and such that the diagram is the diagram of but with an extra leaf node of type connected to type with a branch of label . Then the induced permutation must commute with for since the -residue must be a digon for each . This implies that once we determine where sends a chamber , we know where it sends for every .
Let us now follow the idea of the construction in [5 Section 3.1]. Suppose that is -element bipartite, meaning that it is possible to color the chambers of with colors red and blue such that adjacent chambers are different colors if and only if they are -adjacent. Color each copy of according to such a (single) coloring. Then we will match with if is red, and we will match with otherwise. We will denote this new graph by , and the resulting incidence system by . Clearly is a chamber system with copies of as its -elements. We need to show that the result is a hypert ope with the desired diagram.
Proposition 5.1. If is even and is the chamber system of a hypert ope, then so is .
Proof. Clearly is thin, so we need only to show that it is residually connected. To do so, we make use of [1 Lemma 3.4.9(ii)]. Let () be a -cell (-cell, -cell) such that they have pairwise nonempty intersection; we need to show that is a -cell. Set and similarly define and . Note that since only affects the second coordinate of a chamber , a -cell of induces a -cell of . Indeed, every -cell is contained in a set of the form , where is a -cell.
First, suppose , and suppose without loss of generality that . Then is a subset of for some , and since has nonempty intersection with and , then these cells also intersect . It follows that . Since is a hypertope, is a -cell of , which is a -cell of since .
Next, suppose but . Then is a subset of (with the choice of or depending on the color of the chambers in ). Indeed, since , all chambers in must have the same color. Thus and also intersect this same set. Furthermore, from the definition of we see that . Again, is a hypertope, so is a -cell of , and since the matching commutes with every other matching with , it follows that is a -cell; that is, a -cell.
Finally, suppose that and . If or , the same argument as above holds symmetrically. Thus, we can assume . Then contains chambers of both colors, and it follows that , and similarly for and . Thus , and the argument is similar to before. □
Thus, if is a hypertope, then , the incidence system associated to , is also a hypertope. We will occasionally blur the line between these two ideas, mostly by using to compute things about .
Proposition 5.2. If is a hypertope with diagram and is even, then has a diagram obtained from by adding a new node connected to type with an edge of label .
Proof. It is clear from the construction that the -elements of are isomorphic to , so we only need to show that the -cells of are digons if and -gons if . This is clear from the construction: every -cell has 4 chambers if and chambers if . □
Proposition 5.3. If is a hypertope and is even, then is -flat for every , and it is tight if and only if is tight.
Proof. The -elements of are the copies of , and the -elements correspond to the connected components of after we remove all edges of label . We note that, for every chamber of , each -cell intersects every copy of (that is, every -element). Hence, for , since each -element contain -cells, every -element intersects every -element, which is to say that is -flat.
For the second part, the necessity follows from Proposition 5.2 and Proposition 4.7(b). Conversely, if is tight, then since has times as many chambers and has a spanning forest for its diagram with one additional edge labeled , it follows that is tight. □
Next, let us show that the extensions we build this way are as symmetric as we could hope for.
Proposition 5.4. , where is the dihedral group of order .
Proof. We will work with and directly. Let us first show how to extend an automorphism of to an automorphism of . Recall that is -element bipartite; let us fix a bicoloring of (say, using red and blue) and color each copy of in by the same bicoloring. For , we define by
if is color-preserving, and
if is color-reversing. It is clear that commutes with for . Next, if is color-preserving, we have
where the third equality follows since the color of is the same color as , so acts on the second coordinate of and in the same way. On the other hand, if is color-reversing, we have
where the third equality follows since has the opposite color of . So every automorphism of induces an automorphism of that fixes layer 0.
Now, from the structure of it is clear that there is an automorphism that sends each to and an automorphism that sends each to . These are involutions whose product composition sends to , and so they generate a dihedral group of order .
The rest of the argument is essentially the same as that of [5 Proposition 3.9]; every element of fixes the first coordinate of every pair , and so it is a normal subgroup, and every automorphism of can be written as a product of some with an element of .
Corollary 5.5. is regular if and only if is.
Proof. The necessity is obvious. Conversely, if is regular, then Proposition 5.4 implies that acts transitively on chambers, and so is regular.
Finally, let us show that the construction can be iterated.
Proposition 5.6. Let be a positive even integer. Then is -element bipartite, and for every , if is -element bipartite then so is .
Proof. Since is even and changes the layer of a chamber by , it is clear that every closed path in uses -edges an even number of times. Furthermore, if is -element bipartite, then the induced bipartition on (where every layer is bipartitioned in the same way) is a witness that is -element bipartite.
Putting everything together, we have proven the following.
Theorem 5.7. Suppose is a hypertope with diagram that is -element bipartite. Then:
is a hypertope.
The diagram of is obtained from by adding a new node connected to type with an edge of label .
is tight if and only if is.
is regular if and only if is.
is -element bipartite and is -element bipartite for each such that is -element bipartite.
Corollary 5.8. Suppose is a tree. Suppose that has only even labels, or that it has the form

Figure 1.
where is odd and . Then there is a tight hypertope with diagram .
Proof. Our goal is to find a facet-bipartite, tight polyhedron to start with. If there is a single odd label with , then the tight polyhedron of type described in [3 Theorem 5.1] has a bipartite graph, so its dual is a facet-bipartite tight polyhedron of type . Similarly, if every label of is even and we pick and to be arbitrary adjacent labels, then the tight polyhedron of type described in [3 Theorem 5.1] is also facet-bipartite. Then by Theorem 5.7, we can build a tight hypertope with diagram repeatedly adding a new type and a new edge with an even label connected to this new type and an existing type.
Remark 5.9. In [6 Example 4.1], flat extensions of facet-bipartite polytopes were also described in terms of a voltage graph as follows. Start with a facet-bipartite -polytope (or more precisely, with its chamber system), and color the chambers according to a bipartition of the facets. Add semi-edges of
label to every chamber. Then take a dihedral group and give voltage to semi-edges attached to chambers of one color and voltage to the remaining semi-edges. Then the derived graph is precisely the flat extension described in [5 Section 3.1].
We expect that this same construction should work more generally here with hypertopes, but proving this is beyond the scope of this paper.
Constructing tight hypertopes using twisting
The construction of Section 5 can be applied to hypertopes regardless of any symmetry, and by Theorem 5.7, it can build tight regular -hypertopes from tight regular -hypertopes. In this section, we explore a purely algebraic way to build these regular tight hypertopes.
In order to do so, we will use a construction called twisting. The notion of twisting was originally defined in some very specific cases for polytopes (see [13]). It was extended to general coset geometries in [14], and generalized even further in [15]. As we only need a specific instance of twisting in this paper, we will introduce only a simplified version of the construction here. For more details, we advise to consult [15].
Let be a regular -hypertope. We will need some basic facts about the automorphism groups of regular hypertopes; the full details can be found in [9]. Choose a base chamber of . As is thin, for each , there is a unique chamber that is -adjacent to . Because is regular, there must then exist an automorphism sending to . Also, this automorphism is unique and must be an involution. Moreover, it turns out that . Actually, the pair forms a -group, but that is not crucial for understanding the construction (for more details on -groups and their relation with regular hypertopes, we refer to [9]).
Let be a dihedral group of order , which is the automorphism group of a regular -gon, and let be the automorphism group of a regular hypertope. Choose any and let be the map defined as follows:
If , we set to be the identity.
If , we set to be the order two automorphism switching and .
This map extends to a group homomorphism, and thus to an action of on , if and only if all relators in with respect to the generating set contain an even number of ’s. Suppose that this is the case and let .
Theorem 6.1. The group is the automorphism group of a regular -hypertope . Moreover, the diagram of is obtained from the diagram of by adding a new node connected by an edge labeled to the -node of the diagram of . Finally, the hypertope is tight if is tight.
Proof. Clearly, is generated by since can be recovered by letting act on . For ease of notations, set . The first part of the claim is proved by showing that the coset geometry is a regular hypertope. This is precisely the content of [15 Theorem 3.16, Corollary 3.17], in the specific case where and .
For the diagrams, notice that the diagram of is characterized by the orders in of the elements for . It is clear that if both and are different from , so that and are generators of , the order of in is the same as it was in . Thus, the sub-diagram of spanned by all nodes except the node is the diagram of . Finally, we need to compute the order of for . First of all, if , the generator acts trivially on and it is thus clear that and commute in . If , let us properly identify with and with in . Then, we have that . Hence, the order of must be twice the order of , which is .
Suppose now that is tight. This means that its diagram is a tree and that the number of chambers of is equal to twice the product of all labels appearing on the edges of the tree. The diagram of is also a tree , with an additional edge. The weight is thus equal to $w(T)\cdot 2m where is the label of the new edge. The number of chambers of is equal to the cardinality of which is equal to . This shows that is tight whenever is tight. □
We now note that, when starting from a regular hypertope , the flat-extension described in § 5 is exactly the construction obtained from Theorem 6.1. Let us denote by the hypertope obtained in Theorem 6.1 from and .
Theorem 6.2. Let be a regular -hypertope which is -element bipartite and with diagram . Then . Moreover, if the presentation of is , then has presentation
Proof. Let be a regular -hypertope which is -element bipartite and let be its chamber system. Let , as before. Since is -element bipartite, all closed loops starting in a chamber must cross an even number of -labeled edges. As closed loops in correspond to words on the alphabet which are sent to the identity in , this is equivalent to all relators of containing an even number of . Hence, we see that the condition for to extend to a group homomorphism is equivalent to being -element bipartite.
Let as before, and let . Since , and , we can eliminate from a presentation for to get the presentation
where and is the set of relators of with respect to . Note that can be alternatively written as and as .
Now consider the regular hypertope obtained from the construction , with automorphism group . As described in Proposition 5.4, , where is defined as the automorphism and as the automorphism . We will now prove that satisfies all the relations of . First, note that all generators and relations of are still true in . Moreover, one can easily check that , meaning that must fix every chamber. Additionally, for all with , we have that and fixes every chamber. Substituting , we get that fixes every chamber. Hence is a quotient of the group . However, since both are tight, they must have the same order and hence, are the same group. Therefore, is the same tight regular hypertope as . □
Starting from a coset geometry of -gon, with even, we can iterate the construction above to create a regular tight hypertope whose diagram is any tree with all even labels.
Corollary 6.3. Let be any labeled tree, with all labels equal to even integers. Then there exists a regular tight hypertope whose diagram is and whose automorphism group has presentation
Proof. Let be an even number and be a dihedral group of order . Then is the automorphism group of a regular -gon, which is a tight regular polytope, and thus hypertope. Notice that, since is even, every defining relation of contains an even number of and an even number of . We can thus let act on any other dihedral group via or . Doing so, by Theorem 6.1 we form a regular tight hypertope (actually a polytope in this case) whose diagram is a path of length two with labels and . Since and can be chosen arbitrarily, the theorem is proven for . As mentioned in Theorem 6.1, the choice of adds a new edge of label to the previous diagram. The automorphism group of the hypertope is , with presentation
if , otherwise
The relators for this group all contain an even number of any of the three generators since the relations introduced by semi-direct products are all of the form . Therefore, we can now use as our starting hypertope, let it act on any dihedral group and form a new regular tight hypertope whose diagram has one more edge with even label. Iterating this process, we can construct tight regular hypertopes whose diagram is any tree whose labels are all even integers. Additionally, by Theorems 6.1 and 6.2, this iteration results in the presentation given in the statement of the corollary. (Note that, if the subdiagram with vertices is not connected, then in fact the relation is already implied by the other relations.)
Note that if we are given a regular tight hypertope whose diagram has some odd labels, we can still attempt to use this process to reach bigger trees. We will only need to check that is a homomorphism. Notice that if the vertex of the diagram is the end point of any odd labeled edge, will never be a homomorphism. So we can only hope to glue more edges to vertices that only have even labeled edges to start with.
Finally, we show that whenever all labels are equal to 4, there is a unique tight regular hypertope, just as it is the case for polytopes.
Theorem 6.4. There is a unique regular tight hypertope whose diagram is a tree with all labels equal to 4.
Proof. Let be a tree whose edges are all labeled by 4. By Corollary 6.3, we know that there exists a tight regular hypertope with diagram and that its automorphism group has presentation
Notice that this group is precisely the one constructed in [11] when the underlying graph is a tree.
We now show that the automorphism group of any tight regular hypertope whose diagram is a tree all of whose labels are 4 must be isomorphic to . It is clear that is generated by involutions . Moreover, whenever and correspond to non-adjacent vertices of , it must be that and commute. We now show that for any . The only non-trivial case to check is when forms a path in . Consider the -residue of . This residue is a thin, residually connected and regular geometry whose diagram is a path of length three with labels equal to four. It must hence be the unique tight polytope of type , which is commonly denoted by . (See, for example, the data at [10].) The automorphism group of this polytope is precisely the group when is the only tree with three vertices (this can be verified in a computer algebra system). In particular, the desired commutator relation holds in . Since is a regular hypertope, this residue can be identified with the coset geometry . Therefore, we conclude that .
We have shown that the automorphism group of any tight regular hypertope with diagram is generated by involutions and that these involutions satisfy all the relations in the presentation of . Hence, the group of must be a quotient of . But since is tight and regular, . Therefore, we can indeed deduce that .
Acknowledgments
The authors thank Maria Elisa Fernandes for helpful discussions about small hypertopes and -groups.
The second author is funded by an Action de Recherche Concertée – ARC – from the Communauté Française Wallonie-Bruxelles.
The third author is a Postdoctoral Researcher of the Fonds de la Recherche Scientifique – FNRS.
References
References
- [1]Francis Buekenhout and Arjeh M Cohen. Diagram geometry: related to classical groups and buildings, volume 57. Springer Science & Business Media, 2013.DOI
- [2]Marston Conder and Gabe Cunningham. Tight orientably-regular polytopes. Ars Math. Contemp., 8(1):68–81, 2015.
- [3]Gabe Cunningham. Minimal equivelar polytopes. Ars Math. Contemp., 7(2):299–315, 2014.DOI
- [4]Gabe Cunningham. Tight chiral polyhedra. Combinatorica, 38(1):115–142, 2018.arxiv.org/abs/1508.07451
- [5]Gabe Cunningham. Flat extensions of abstract polytopes. Art Discrete Appl. Math., 4(3):Paper No. 3.06, 14, 2021.arxiv.org/abs/2001.07677
- [6]Gabe Cunningham, Elías Mochán, and Antonio Montero. Cayley extensions of maniplexes and polytopes. Journal of Combinatorial Theory, Series A, 212:106000, 2025.arxiv.org/abs/2305.11843
- [7]Gabe Cunningham and Daniel Pellicer. Classification of tight regular polyhedra. J. Algebraic Combin., 43(3):665–691, 2016.DOI
- [8]Gabe Cunningham and Daniel Pellicer. Tight chiral polytopes. J. Algebraic Combin., 54(3):837–878, 2021.arxiv.org/abs/2009.04566
- [9]Maria Elisa Fernandes, Dimitri Leemans, and Asia Ivić Weiss. Highly symmetric hypertopes. Aequationes Math., 90(5):1045–1067, 2016.arxiv.org/abs/1604.03162
- [10]M. I. Hartley. An atlas of small regular abstract polytopes. Periodica Mathematica Hungarica, 53:149–156, 2006. available online at http://www.abstract-polytopes.com/atlas/.DOI
- [11]Dimitri Leemans, Pablo Spiga, and Philippe Tranchida. Hypertopes with prescribed diagram symmetries, 2026.arxiv.org/abs/2610.09711
- [12]Dimitri Leemans, Klara Stokes, and Philippe Tranchida. Groups represented by incidence geometries. arXiv preprint arXiv:2506.10464, 2025.arxiv.org/abs/2506.10464
- [13]Peter McMullen and Egon Schulte. Abstract regular polytopes, volume 92 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2002.
- [14]Claudio Alexandre Piedade and Philippe Tranchida. From group operations to geometric structures: Amalgamations, hnn-extensions, and twisting in coset geometries. Journal of Algebra, 707:83–144, 2026.arxiv.org/abs/2505.24662
- [15]Claudio Alexandre Piedade and Philippe Tranchida. The geometry of wreath and semi-direct products. arXiv preprint arXiv:2605.04646, 2026.arxiv.org/abs/2605.04646
- [16]J. Tits. Sur les analogues algébriques des groupes semi-simples complexes. In Colloque d’algèbre supérieure, tenu à Bruxelles du 19 au 22 décembre 1956, Centre Belge de Recherches Mathématiques, pages 261–289. Etablissements Ceuterick, Louvain, 1957.
- [17]J. Tits. A local approach to buildings. In The geometric vein, pages 519–547. Springer, New York-Berlin, 1981.DOI