Chiral polytopes of order $2p^m$
Ting-Ting Kong, Yan-Quan Feng, Dong-Dong Hou, Dimitri Leemans, Hai-Peng Qu

TL;DR
This paper classifies chiral polytopes with automorphism groups of order twice a prime power, revealing their structure and conditions for tightness, and constructing examples for various parameters.
Contribution
It provides a detailed structural analysis of chiral polytopes with automorphism groups of order 2p^m, including conditions for tightness and existence of non-tight examples.
Findings
G ≅ P ⋉ Z_2 with specific properties
Characterization of tight polytopes as metacyclic groups
Existence of non-tight polytopes for certain m values
Abstract
Let be a chiral polytope with type and . Suppose , where and is an odd prime. Let be a Sylow -subgroup of . We prove that , , (so ) and up to duality, for some integral . Moreover, we show that is tight ) if and only if is metacyclic group. Furthermore, if or , then must be tight, and if , where either is odd, or is even and , there exists a non-tight chiral polytope .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Point processes and geometric inequalities
Chiral polytopes of order
Ting-Ting Kong
Ting-Ting Kong, Department of Mathematics, Shanxi Key Laboratory of Cryptography and Date Security, Shanxi Normal University, TaiYuan, 030031, P.R. China
,
Yan-Quan Feng
Yan-Quan Feng, Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, P.R. China
,
Dong-Dong Hou
Dong-Dong Hou, Department of Mathematics, Shanxi Normal University, TaiYuan, 030031, P.R. China
,
Dimitri Leemans
Dimitri Leemans, Département de Mathématique, Université Libre de Bruxelles, C.P.216, Boulevard du Triomphe, 1050 Bruxelles Belgium
and
Hai-Peng Qu
Hai-Peng Qu, Department of Mathematics, Shanxi Normal University, TaiYuan, 030031, P.R. China
Abstract.
Let be a chiral polytope with type and . Suppose , where and is an odd prime. Let be a Sylow -subgroup of . We prove that , , (so ) and up to duality, for some integral . Moreover, we show that is tight ) if and only if is metacyclic group. Furthermore, if or , then must be tight, and if , where either is odd, or is even and , there exists a non-tight chiral polytope .
Key words and phrases:
Chiral polytope, -group, automorphism group, soluble group
1991 Mathematics Subject Classification:
20B25, 20D15, 52B10, 52B15
1. Introduction
Abstract polytopes are combinatorial structures with properties that generalise those of classical polytopes. In many ways they are more fascinating than convex polytopes and tessellations. Highly symmetric examples of abstract polytopes include not only classical regular polytopes such as the well known Platonic solids, and more exotic structures such as the -cell and -cell, but also regular maps on surfaces (such as Klein’s quartic); see [14, Chapter 8] for example.
Roughly speaking, an abstract polytope is a partially ordered set (or for short) endowed with a rank function, satisfying certain conditions that arise naturally from a geometric setting (see Section 2.1 for definitions). Such objects were proposed by Branko Grünbaum in the seventies; their definition (initially as ‘incidence polytopes’) and theory were developed by Ludwig Danzer and Egon Schulte. They are closely related to ‘polyhedral geometries’ that Jacques Tits defined in 1961 [35].
An automorphism of an abstract polytope is an order-preserving permutation of the elements of , and every automorphism of is uniquely determined by its action on any maximal chain in (known as a ‘flag’ of ). The most symmetric examples of abstract polytopes are the regular ones, where the automorphism group acts transitively on the set of flags. The comprehensive book written by Peter McMullen and Egon Schulte [28] is considered the main reference on this subject.
Another interesting class of examples is the one of chiral polytopes. For these polytopes, their automorphism group has two orbits on the set of flags, with the extra property that any two flags that differ in a single element lie in different orbits. The study of chiral abstract polytopes was pioneered by Schulte and Asia Ivic Weiss (see [32, 33] for example). For quite some time, the only known finite examples of chiral polytopes had ranks 3 and 4, but then some finite examples of rank 5 were constructed by Marston Conder, Isabel Hubard and Tomaz Pisanski [12]. Daniel Pellicer was the first to show that chiral polytopes of arbitrarily large rank exist [29].
It is a natural question to try to describe all pairs , where is a chiral polytope and is the automorphism group of . Conder computed all chiral polytopes with automorphism group of order at most 1000 in 2012***These computations have recently been pushed to cover all polytopes with up to 4000 flags [8].. Roughly at the same time, Michael Hartley, Hubard and Dimitri Leemans built in [17] an atlas of all chiral polytopes whose automorphism group is an almost simple group such that and is a simple group of order less than 1 million appearing in the Atlas of Finite Groups by Conway et al. Recently, Primoz Potočnik, Pablo Spiga and Gabriel Verret computed all chiral 3-polytopes with automorphism group of order at most 12000 [30].
An interesting case consists of pairs with simple or almost simple. In 2015, Conder, Hubard, Pellicer and Eugenia O’Reilly-Regueiro [11] provided a construction of chiral 4-polytopes for and . After ten years, Conder, Hubard and O’Reilly-Regueiro extended their initial idea and proved that for every , there exists a chiral -polytope with automorphism group isomorphic to , and a chiral -polytope with automorphism group isomorphic to for all but finitely many , see [10]. Also, Wei-Juan Zhang gave some new construction for chiral -polytopes with symmetric automorphism groups [37]. Hubard and Leemans dealt with the Suzuki simple groups in [20]. In a series of papers, the case where the automorphism group of a chiral polyhedra is an almost simple group with socle has been studied [13, 16, 24, 25]. Moreover, in 2022, Leemans and Adrien Vandenschrick constructed chiral 4-polytopes with automorphism group for every prime power [26]. For chiral -polytopes, Conder, Potočnik and Jozef Širáň proved that the groups cannot be automorphism groups of such polyhedra [13]. Leemans and Martin Liebeck proved that every finite simple group acts as the automorphism group of a chiral -polytope, apart from the groups , , and maybe also and [23]. Antonio Breda and Domenico Catanalo then showed that and cannot be automorphism groups of chiral polyhedra (with the help of Leemans and Liebeck for the groups ) [6].
Another interesting case consists of the pairs with a soluble group. When it comes to soluble groups, except for abelian groups, the first families that come to mind are groups of orders or , where is an odd prime. Schulte and Weiss mentioned in [34] that the order and prove to be more difficult than others and suggested to try to classify chiral polytopes with these orders [34, Problem 30]. Zhang constructed in her PhD thesis [39] a number of chiral polytopes of types , and , with automorphism groups of orders , and , and , respectively. Recently, Zhang presented a general construction for chiral polytopes of type with rank , and , which are obtained as boolean covers of the unique tight regular polytope of the same type in [38]. Conder, Yanquan Feng and Dong Dong Hou gave two infinite families of chiral 4-polytopes of type with solvable automorphism groups [9]. In 2024, Hou, T. T. Zheng and R. R. Guo proved that for , there exists a chiral 3-polytope of type with automorphism group of order [18]. Gabe Cunningham gave some infinite families of tight chiral -polytopes of type with automorphism group of order [15].
Note that if a chiral polytope has rank at least three, the order of its automorphism group must be even. In this paper, we focus on groups acting on chiral polytopes of rank three, with , an odd prime, and a strictly positive integer. We first prove the following theorem (where is the size of a smallest generating set of ).
Theorem 1.1**.**
Let be an odd prime and be a positive integer. Let be a group of order . Let be the automorphism group of a chiral polyhedron of type . Then
- (1)
* with ;*
- (2)
Up to duality, for some positive integers ;
- (3)
* and is not abelian (so );*
- (4)
* is tight, that is , if and only if is a metacyclic group.*
We then prove the following theorem, showing that if or , then is a tight polyhedron.
Theorem 1.2**.**
Let be an odd prime and or . Let be a group of order . let be the automorphism group of a chiral polyhedron of type . Then is tight.
Remark 1.3**.**
As a by-product of the proof of Theorem 1.2, we obtain the following families of non-tight regular polyhedra:
- •
regular polyhedra of type of order ;
- •
regular polyhedra of type of order ;
- •
regular polyhedra of type of order ;
- •
regular polyhedra of type of order .
In particular, the first class and part of the second class of these polyhedra are identical to those Feng, Hou, Leemans and Qu constructed in [19].
Cunningham proved in [15] that there exists a tight chiral polyhedron of type for and . In the case where is not tight, we prove the following theorem. The proof of that theorem is constructive, meaning that we give an explicit way to construct such a polyhedron.
Theorem 1.4**.**
Let p be an odd prime. Let be an integer such that either is odd, or is even and . Then there exists a non-tight chiral poyhedron with .
Let us point out that, as in the regular case (see [19, Section 1]) chiral polytopes constructed from soluble groups are extremely rare. For example, there are 49,910,526,325 groups of order [3]. These groups are readily accessible in Magma [5] except for those of order 1024. Even though those of order 1024 are not in Magma, we know they are all soluble. One can check that out of all groups of order at most 2000, there are 49,910,525,301 that are soluble groups and 1024 that are non-soluble. According to the data collected by Conder [8], the number of chiral polyhedra having an automorphism group of order at most 2000 that is soluble (resp. non-soluble) is 2665 (resp. 165). Hence the ratio (number of chiral group representations/number of groups) is 0.000000053% for soluble groups and 16.11% for non-soluble groups. This shows that it is really not easy to find soluble groups that are the automorphism group of some chiral polytopes. More importantly, if we refine by rank, we get, in the soluble case, 2389 polytopes of rank 3, 276 of rank 4 and none of rank 5. In the non-soluble case, we get 39 polytopes of rank 3, 123 of rank 4 and three of rank 5.
The paper is organised as follows. In Section 2, we give the necessary background to understand this paper. In Section 3, we give several lemmas about finite -groups of maximal class that are useful in this paper. In Section 4, we prove Theorem 1.1. In Section 5, we prove Theorem 1.2. Finally, in Section 6, we prove Theorem 1.4.
2. Preliminaries
In this section we give some further background that may be helpful for the rest of the paper (see [2, 22, 28, 32, 36] for more details).
2.1. Abstract polytopes: definition, structure and properties
An abstract polytope of rank is a partially ordered set endowed with a strictly monotone rank function with range , which satisfies four properties (P1) to (P4) described below.
The elements of are called faces of . More specifically, the elements of of rank are called -faces, and a typical -face is denoted by . Two faces and of are said to be incident with each other if or in . A chain of is a totally ordered subset of , and is said to have length if it contains exactly faces. The maximal chains in are called the flags of . Two flags are said to be -adjacent if they differ in just one face of rank , or simply adjacent (to each other) if they are -adjacent for some . Also if and are faces of with , then the set is called a section of , and is denoted by . Such a section has rank , where and are the ranks of and respectively. A section of rank is called a -section.
We can now give the four conditions that are required of to make it an abstract polytope.
- (P1)
contains a least face and a greatest face, denoted by and , respectively.
- (P2)
Each flag of has length (so has exactly faces, including and ).
- (P3)
is strongly flag-connected, which means that any two flags and of can be joined by a sequence of successively adjacent flags , each of which contains .
- (P4)
The rank sections of have a certain homogeneity property known as the diamond condition: if and are incident faces of , of ranks and , respectively, where , then there exist precisely two -faces in such that .
An easy case of the diamond condition occurs for polytopes of rank 3 (or polyhedra). In that case, 0-faces are called vertices, 1-faces are called edges and 2-faces are called faces. If is a vertex of some face , then there are two edges that are incident with both and .
If is a face of rank , then the section is also called a facet of , while if is a face of rank 0, then the section is called a vertex-figure of at . Every -section of is isomorphic to the face lattice of a polygon. If it happens that the number of sides of every such polygon depends only on the rank of , and not on or itself, then we say that the polytope is equivelar. In this case, if is the number of edges of a -section between an -face and an -face of , for , then the ordered set is called the Schläfli type of . (For example, if has rank 3, then and are respectively the size of each face and the valency of each vertex.)
2.2. Automorphisms of polytopes
An automorphism of an abstract polytope is an order-preserving permutation of its elements. In particular, every automorphism preserves the set of faces of any given rank. Under permutation composition, the set of all automorphisms of forms a group, called the automorphism group of , and denoted by or sometimes more simply as . Also it is not difficult to use the diamond condition and strong flag-connectedness to prove that if an automorphism preserves one flag of , then it fixes every flag of and hence every element of . It follows that acts semi-regularly on flags of .
A polytope is said to be regular if its automorphism group acts transitively (and hence regularly) on the set of flags of . In this case, the number of automorphisms of is as large as possible, and equal to the number of flags of . In particular, is equivelar, and the stabiliser in of every 2-section of induces the full dihedral group on the corresponding polygon. Moreover, for a given flag and for every , the polytope has a unique automorphism that takes to its unique -adjacent flag . The automorphisms generate and satisfy the defining relations for the string Coxeter group , where the are as given in the previous subsection for the Schläfli type of . Here, the string Coxeter group , is defined as the group with presentation
[TABLE]
[TABLE]
They also satisfy an intersection condition, which follows from the diamond and strong flag-connectedness conditions. These and many more properties of regular polytopes may be found in [28].
We now turn to chiral polytopes, for which two good references are [32, 33].
A polytope said to be chiral if its automorphism group has two orbits on its set of flags, with every two adjacent flags lying in different orbits. (Another way of viewing this definition is to consider as admitting no ‘reflecting’ automorphism that interchanges a flag with an adjacent flag.) Here the number of flags of is , and acts regularly on each of the two orbits. Again is equivelar, with the stabiliser in of every 2-section of inducing the full cyclic group on the corresponding polygon if is a polyhedron and the full dihedral group otherwise.
For a given flag , denote by the -face in for each . For every , the chiral polytope admits an automorphism that fixes each with and cyclically permutes consecutive - and -faces in the -section , that is, takes to the flag which differs from in precisely its -and -faces. This automorphism is the analogue of the abstract rotation in the regular case, for each . These automorphisms generate , and if has Schläfli type , then the ’s satisfy the defining relations for the orientation-preserving subgroup of (index in) the string Coxeter group . Also they satisfy a chiral form of the intersection condition, which is a variant of the one mentioned earlier for regular polytopes.
Chiral polytopes occur in pairs (or enantiomorphic forms), such that each member of the pair is the ‘mirror image’ of the other. Suppose one of them is , and has Schläfli type . Then is isomorphic to the quotient of the orientation-preserving subgroup of the string Coxeter group via some normal subgroup . By chirality, is not normal in the full Coxeter group , but is conjugated by any orientation-reversing element to another normal subgroup which is the kernel of an epimorphism from to the automorphism group of the mirror image of .
The automorphism groups of and are isomorphic to each other, but their canonical generating sets satisfy different defining relations. In fact, replacing the elements and in the canonical generating tuple by and gives a set of generators for that satisfy the same defining relations as a canonical generating tuple for , but chirality ensures that there is no automorphism of that takes to and fixes all the other ’s.
Conversely, any finite group that is generated by elements which satisfy both the defining relations for and the chiral form of the intersection condition is the ‘rotation subgroup’ of an abstract -polytope that is either regular or chiral. Indeed, is regular if and only if admits a group automorphism of order that takes to .
We now focus our attention on the rank case. Here the generators for satisfy the canonical relations , and the chiral form of the intersection condition can be abbreviated to . Moreover, is chiral if and only if there is no with .
The following proposition is useful for the groups we will deal with in the proof of our main theorem. It is called the quotient criterion for chiral -polytopes.
Proposition 2.1**.**
[7, Lemma 3.2]* Let be a group generated by elements such that , and let be a group homomorphism taking to , such that the restriction of to either or is injective. If is a canonical generating pair for as the automorphism group of some chiral -polytope, then the pair satisfies the chiral form of the intersection condition for .*
2.3. Group theory
In this section we briefly describe some of the knowledge of group theory we need. We use standard notation for group theory, as in [2, 22, 36] for example.
Let be a group. We define the commutator of elements and of by . The group is the commutator subgroup of . We let and .
The following results are elementary and so we give them without proof.
Proposition 2.2**.**
Let be a group. Then, for any ,
- (1)
, ;
- (2)
, ;
- (3)
;
- (4)
.
A finite group is called metacyclic if it has a cyclic normal subgroup such that is also cyclic. Huppert proved the following theorem.
Theorem 2.3**.**
[22, Theorem 11.5]** Let be a -group with . Then is metacyclic.
A finite -group is a modular -group if and only if , . Iwaswa proved the following theorem.
Theorem 2.4**.**
[31, Theorem 2.3.1]** Let be a metacyclic -group with . Then is a modular -group.
Let be a group. The Frattini subgroup, denoted by , is the intersection of all maximal subgroups of . Obviously, is a characteristic subgroup†††Recall that a characteristic subgroup of a group is a subgroup that is fixed by the automorphism group of . of . The following theorem is the well-known Burnside Basis Theorem.
Theorem 2.5**.**
[2, Theorem 1.12]* Let be a -group and .*
- (1)
. Moreover, if and is elementary abelian, then .
- (2)
Every minimal generating set of contains exactly elements.
The unique cardinality of all minimal generating sets of a -group is called the rank of , and denoted by .
We will also need Sylow’s third theorem so we state it here for clarity.
Theorem 2.6** (3rd Sylow’s theorem).**
Let be a group of order with . Let be the number of Sylow -subgroup of . Then
- (1)
; 2. (2)
; 3. (3)
* where is a Sylow -subgroup of .*
Let denote the nilpotency class of a group . From the classification of finite groups of order and (see [21, Chapter 4] and [22, Theorem 12.6]) we have the following propositions.
Proposition 2.7**.**
Let be a non-abelian group of order for odd prime . Suppose is non-metacyclic. Then , and , where
[TABLE]
Proposition 2.8**.**
Let be a non-abelian group of order for odd prime . Suppose is non-metacyclic and . Then or . Furthermore, the following hold:
- (1)
if , then , and ;
- (2)
if , then , and one of the following holds:
- (a)
, ;
- (b)
, . Moreover, .
Finally, we state a proposition about binomial coefficients that will be used in the proof of one of our theorems.
Proposition 2.9**.**
[1, Chapter 1]** Let and let denote the binomial coefficient indexed by and . Then
- (1)
;
- (2)
;
- (3)
;
- (4)
;
Furthermore, if , then .
3. A few technical lemmas
In this section, we give lemmas about finite -groups of maximal class that are useful in this paper. We assume in what follows that is an odd prime and is a strictly positive integer. A group of order and nilpotency class is said to be of maximal class if . The basic material about these groups can be found in Blackburn [4, pages 83–84] or Huppert [22, Chapter 3].
Let be a group of maximal class and order . If has an abelian maximal subgroup , and any has order , then, by [36, Chapter 8, Example 8.3.4]),
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
Noting that , the group is abelian and . Moreover, we also have and . In fact, any has order . With the relations given above, it is clear that .
Define
[TABLE]
For convenience, let for and . Then
[TABLE]
[TABLE]
[TABLE]
We prove the following lemma.
Lemma 3.1**.**
.
Proof. Suppose . Since is abelian and for , by Proposition 2.2, we have
[TABLE]
In particular, . On the other hand, since , . This implies that . But this is impossible because . ∎
Lemma 3.2**.**
For any , we have
- (1)
;
- (2)
s_{k}^{\sigma}=\left\{\begin{array}[]{ll}s_{k}^{\beta^{1-k}},&k\mbox{ is odd,}\\ (s_{k}^{\beta^{1-k}})^{-1},&k\mbox{ is even.}\end{array}\right.**
Proof. (1) Since , we have . Since and , we have . It follows that
[TABLE]
[TABLE]
(2) The proof uses an induction on . For , we have . For , by Proposition 2.2, we have
[TABLE]
Hence this lemma is true for and . We now use induction on and Proposition 2.2, splitting the analysis in two cases, namely the case where is odd and the case where is even.
If is odd, then
[TABLE]
Recall that is an abelian maximal subgroup of and . It follows that and for any . Thus,
[TABLE]
If is even, then
[TABLE]
∎
Lemma 3.3**.**
If is odd , then is even and . Moreover, .
Proof. Since and and are odd, must be even. The fact that follows from the definition of . The group . Thus, we only need to show that the generating set of satisfies the same relations as in order to conclude that . Recall that is abelian and . By Lemma 3.2,
[TABLE]
Now , for . Moreover, it is easy to see that for . Thus we only need to show that , and
[TABLE]
that is, . Since is even, we have
[TABLE]
Next, by Lemma 3.2, we have
[TABLE]
Then , where comes from Table 1.
This gives . By Proposition 2.9(1), we have
[TABLE]
For , we have . For , we have
[TABLE]
By Proposition 2.9(2)$$(3), we have
[TABLE]
Together with Proposition 2.9(4), for , we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and hence
[TABLE]
[TABLE]
By Lemma 3.2 and the fact that , we have The result is now immediate since
[TABLE]
[TABLE]
[TABLE]
∎
4. Proof of Theorem 1.1
(1) Let be the number of Sylow -subgrougs of and let be a Sylow -subgroup of . By Theorem 2.6 (1), and . It follows that . Then .
Since and , . It follows that and thus . In face, since , , finishing the proof of (1).
(2) Up to duality, the Schläfli type must be one of or . Consider the quotient group , then . If , then , and hence in , which is impossible because . If , then , and . Since in , and in . Thus , which is impossible because . Therefore, , finishing the proof of (2).
(3) By Theorem 1.1, we have . Let . Then . Obviously, . Moreover, since ,
[TABLE]
Then . It follows that and . On the other hand, it is easy to see that . Thus, and .
If , then is cyclic. Since and , we have , and so or . It follows that , which is impossible because . Thus, .
Now, suppose that is abelian. Then in and hence . Since , we have
[TABLE]
It means that is tight, that is . Moreover, we claim that , where
[TABLE]
Obviously, satisfies all of the defining relations of , and so is the quotient group of . On the other hand, since , . Consider the quotient group
[TABLE]
It is easy to see that where is the dihedral group of order . Then . So , and hence . However, consider the map . It is easy to check that
[TABLE]
Then , which is impossible because is chiral. Thus, is not abelian and . This finishes the proof of (3).
- Suppose first that is tight, that is . Then and since , we have . Theorem 2.3 implies that is metacyclic group.
Now suppose that is metacyclic. By Theorem 2.4, we have . Note that , so . It follows that and hence is tight.
5. Proof of Theorem 1.2
For or , we may refer to the lists of all chiral polytopes with up to flags computed by Conder [8]. So, in the following discussion, we always assume , and .
(1) Suppose and is a non-tight chiral polyhedron. By Theorem 1.1(2), we know that . Then , which means that is generated by two elements of order . By Proposition 2.7, and hence in . Knowing how to represent these two elements of is enough to define the entire group . We claim that , where
[TABLE]
Obviously, satisfies all of the defining relations of , and hence is a quotient group of . On the other hand, since in , we have and hence . Consider the quotient group . Then . Note that the subgroup of satisfies all of the defining relations of the subgroup of , so the subgroup of has order at most . Hence . Thus, .
Consider the map . It is easy to check that
[TABLE]
meaning , which contradicts the hypothesis that is chiral. Thus, must be tight.
(2) Suppose and is a non-tight chiral polyhedron. By Theorem 1.1(4), is non-metacyclic. Moreover, by Theorem 1.1(2) and Proposition 2.7, we have , or and , meaning we have six cases to consider, that is three for each possible value of . We show for each of these six cases that they cannot happen.
Case 1: .
Subcase 1.1: . Then , and so
[TABLE]
But this is impossible by Proposition 2.8(1).
Subcase 1.2: . Then and . Moreover,
[TABLE]
This is enough to define the entire group . We claim that , where
[TABLE]
Obviously, satisfies all of the defining relations of , and hence is a quotient group of . Note that . Consider the quotient group . Then . For the subgroup group of , since , . Then
[TABLE]
It follows that , and hence .
Consider the map . It is easy to check that
[TABLE]
meaning , which contradicts the hypothesis that is chiral.
Subcase 1.3: . Then and . In a similar way, we obtain , where
[TABLE]
But this is impossible because , where taking to , contradicting the chirality of .
Case 2: . Then since ,
[TABLE]
and as ,
[TABLE]
Subcase 2.1: . Then . Since , we have
[TABLE]
for some . This is also enough to define the entire group . We claim that , where
[TABLE]
[TABLE]
Obviously, satisfies all of the defining relations of , and hence is a quotient group of . On the other hand, consider the quotient group . Then . For the subgroup of , since , we have . Let . Then . Furthermore, since , we have
[TABLE]
It follows that , and hence .
Consider the map . It is easy to check that
[TABLE]
[TABLE]
[TABLE]
Furthermore, by Proposition 2.2,
[TABLE]
Hence , which contradicts the fact that is chiral.
Subcase 2.2: . Then . Moreover,
[TABLE]
Since , we have and for some . This is enough to define the entire group . We claim that , where
[TABLE]
[TABLE]
Obviously, satisfies all of the defining relations of , and hence is the quotient group of . Moreover, the same argument as used in Case 2.1 shows that . Thus, .
Consider the map . It is easy to check that
[TABLE]
[TABLE]
[TABLE]
Furthermore, by Proposition 2.2,
[TABLE]
[TABLE]
Hence , which contradicts the fact that is chiral.
Subcase 2.3: . Then . Moreover,
[TABLE]
Since , we have and for some . In a similar way, we obtain , where
[TABLE]
[TABLE]
But this will again give an element , with , contradicting the chirality of . ∎
6. Proof of Theorem 1.4
The main purpose of this section is to prove Theorem 1.4. In order to do so, we will give a constructive proof. Let be the group and maps defined in Section 3. We have two cases to consider, namely the case where is odd and at least 5 and the case where is even and at least .
Case 1: is odd and .
Let . Then and . Let . We will show that is the automorphism group of a chiral polytope of type .
Claim 1: , and .
Obviously, . Since , . It follows that , and hence .
Next, since and , we have
[TABLE]
and hence . Moreover, since and , we have and , as claimed.
Claim 2: .
Since and , or . If , then . It follows that and hence , which is impossible because is non-abelian.
If , then . Observe that and . However, by Lemma 3.3, is even, thus . It means that , and hence . Thus, , as claimed.
Claim 3: There is no such that .
Suppose that there exists such an . Since is a characteristic subgroup of , the automorphism of induces an automorphism of , say . Note that , so . It follows that . Moreover, since , we have . Thus, takes to . Let be the inner automorphism of induced by . Then we have the following sequence:
[TABLE]
However, by Lemma 3.1, , a contradiction, and hence , as claimed.
Claims 1, 2 and 3 show that is the automorphism group of a chiral polytope of type .
Case 2: is even, and .
We define the group
[TABLE]
with the following relations:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where , and is even.
Obviously, . Let , and .
Claim 4: and .
Since , we have . Consider the quotient group . Then (which is the group defined in Case 1) and hence . We only need to prove that . Then is a central extension of by . Unfortunately, not always has order , which is why we need .
Let . It is easy to check that satisfies all of the relations of . Hence the map: induces an epimorphism from to . Moreover, . Note that , so . It follows that and hence .
From now on, let . Since is even and , we get which is fine as is even and by hypothesis.
Claim 5: , and .
The same argument as used in Case 1 shows that and . Consider the quotient group . Note that in implies that in for some . It follows that in . Then .
Claim 6: .
Let be the epimorphism from onto . Note that and . Then Proposition 2.1 implies that .
Claim 7: There is no such that .
Suppose that such an exists. Then the same argument as used in Case 1 shows that takes to . On the other hand, since and , we get . It follows that , and hence . Let . Then and . However, the same argument as used in Lemma 3.1 shows that , a contradiction.
Claims 4 to 7 above imply that is the automorphism group of a chiral polytope of type . ∎
7. Acknowledgements
This work was supported by the National Natural Science Foundation of China (12201371, 12271318,12331013,12311530692,12271024,12161141005), the 111 Project of China (B16002), an Action de Recherche Concertée grant of the Communauté Française Wallonie Bruxelles and a PINT-BILAT-M grant from the Fonds National de la Recherche Scientifique de Belgique (FRS-FNRS).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Aigner. A Course in Enumeration . Springer-Verlag, New York, 2007.
- 2[2] Y. Berkovich. Groups of Prime Power Order Vol. 1 . De Gruyter Expositions in Mathematics, 46. Walter de Gruyter, Berlin, 2008.
- 3[3] H. U. Besche, B. Eick and E. A. O’Brien. The groups of order at most 2000. Electron. Res. Announc. Amer. Math. Soc. 7:1–4, 2001.
- 4[4] N. Blackburn. On a special class of p p -groups. Acta Math. 100:45–92, 1958.
- 5[5] W. Bosma, J. Cannon and C. Playoust. The Magma Algebra System. I: the user language. J. Symbolic Comput. 24:235–265, 1997.
- 6[6] A. Breda d’Azevedo and D. A. Catalano. Strong map-symmetry of SL(3, K K ) and PSL(3, K K ) for every finite field K K . J. Algebra Appl. 20, no. 4, Paper No. 2150048, 2021.
- 7[7] A. Breda D’Azevedo, G.A. Jones, E. Schulte, Constructions of chiral polytopes of small rank, Canad. J. Math. 63:1254–1283, 2011.
- 8[8] M.D.E. Conder, Chiral polytopes with up to 4000 flags, https://www.math.auckland.ac.nz/~conder/Chiral Polytopes With Up To 4000 Flags-By Order.txt .
