String C-groups of 2-power order project onto a common string C-group
Pith reviewed 2026-05-21 02:39 UTC · model grok-4.3
The pith
Every finite string C-group of rank d and 2-power order has the automorphism group of Conder's polytope C_d as a quotient.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
String C-groups are precisely the automorphism groups of abstract regular polytopes. The regular d-polytope C_d with automorphism group of order 2^{2d-1}, discovered by Conder and known to have the smallest number of flags among regular d-polytopes of high ranks, is the unique minimal d-polytope with respect to combinatorial covering among all finite regular d-polytopes with 2-power automorphism groups. Consequently the automorphism group of C_d is a quotient of every finite string C-group of rank d and 2-power order, and every finite regular d-polytope with a 2-power automorphism group covers C_d.
What carries the argument
The regular d-polytope C_d with automorphism group of order 2^{2d-1}, which functions as the unique minimal element under combinatorial covering for the entire class of finite regular d-polytopes whose groups have 2-power order.
If this is right
- Every finite regular d-polytope with 2-power automorphism group covers C_d.
- The automorphism group of C_d is a quotient of every finite string C-group of rank d and 2-power order.
- A unique minimal element exists in the poset of string C-groups of 2-power order and fixed rank ordered by quotients.
- The covering relation is inherited by all larger 2-power string C-groups of the same rank.
Where Pith is reading between the lines
- Explicit presentations or coset enumerations of larger 2-power string C-groups could be reduced to quotients of the known group of C_d.
- The same minimality phenomenon may or may not appear for string C-groups whose orders are powers of other primes.
- Computational searches for small regular polytopes of 2-power order can now be organized by checking coverings of the single known minimal object.
Load-bearing premise
That Conder's polytope C_d has the smallest number of flags among regular d-polytopes of high ranks, which is invoked to prove the unique minimal covering property.
What would settle it
An explicit finite regular d-polytope whose automorphism group has 2-power order but does not cover C_d combinatorially would falsify the claim.
read the original abstract
String C-groups are precisely the automorphism groups of abstract regular polytopes. A certain regular d-polytope C_d with an automorphism group of order 2^{2d-1}, discovered by Conder and shown to have the smallest number of flags among all regular d-polytopes of high ranks, also has the important extremal property to be the unique minimal d-polytope, with respect to combinatorial covering, among all finite regular d-polytopes with 2-power automorphism groups. In other words, the automorphism group of C_d is a quotient group of every finite string C-group of rank d and 2-power order; and every finite regular d-polytope with an automorphism groups of 2-power order covers C_d. The existence of a unique minimal element among string C-groups of 2-power order and given rank is remarkable in itself.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript asserts that the automorphism group of the regular d-polytope C_d, discovered by Conder with order 2^{2d-1}, serves as a common quotient for all finite string C-groups of rank d and 2-power order. This implies that every finite regular d-polytope with a 2-power automorphism group covers C_d, making C_d the unique minimal element in the covering poset for such polytopes.
Significance. If correct, this finding is significant as it reveals a universal structural property among string C-groups of 2-power order, providing a minimal object that all others map onto. This could facilitate further classifications and understanding of the relations in these groups. The result builds upon existing work on minimal flag counts and adds the covering aspect, which is a strong contribution to the field of abstract regular polytopes.
major comments (1)
- The central claim requires establishing a surjective homomorphism from any finite string C-group G of rank d and 2-power order to Aut(C_d). While the minimal order of Aut(C_d) is cited from Conder, the manuscript should explicitly show how the Coxeter-type relations and intersection properties in G imply the specific relations that define Aut(C_d). Without this explicit step, the quotient property does not follow from order minimality alone, as incomparable 2-groups can exist even when one has smaller order.
Simulated Author's Rebuttal
We thank the referee for the careful reading of the manuscript and the positive assessment of its significance. We address the major comment below and will revise the manuscript accordingly to strengthen the exposition of the central claim.
read point-by-point responses
-
Referee: The central claim requires establishing a surjective homomorphism from any finite string C-group G of rank d and 2-power order to Aut(C_d). While the minimal order of Aut(C_d) is cited from Conder, the manuscript should explicitly show how the Coxeter-type relations and intersection properties in G imply the specific relations that define Aut(C_d). Without this explicit step, the quotient property does not follow from order minimality alone, as incomparable 2-groups can exist even when one has smaller order.
Authors: We agree that an explicit derivation of the surjective homomorphism would clarify the argument and address the possibility of incomparable 2-groups. In the revised manuscript we will insert a new subsection (immediately following the statement of the main theorem) that proceeds as follows: starting from the string Coxeter presentation and the intersection property for any rank-d string C-group G of 2-power order, we use the fact that the order is at least 2^{2d-1} (by Conder) together with the explicit generators and relations of Aut(C_d) to construct a homomorphism by mapping the standard generators of G onto those of Aut(C_d) and verifying that all additional relations of Aut(C_d) are forced to hold in G. This step relies on the intersection property to control the subgroup generated by consecutive generators and thereby collapse the group onto the minimal-order quotient. We believe this explicit construction removes any reliance on order minimality alone. revision: yes
Circularity Check
No circularity: central claim rests on external Conder result plus independent group-theoretic proof
full rationale
The manuscript attributes both the existence of the polytope C_d and its flag-minimality to prior work by Conder (an external author). The new claim—that Aut(C_d) is a quotient of every finite rank-d string C-group of 2-power order—is presented as a theorem proved inside the paper via the Coxeter relations and intersection properties of string C-groups. No equation or step equates a derived quantity to a fitted parameter by construction, and no load-bearing premise reduces to a self-citation chain. The derivation therefore remains self-contained against the cited external benchmark and the paper's own arguments.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption String C-groups are precisely the automorphism groups of abstract regular polytopes.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking (D=3 forcing) unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 4.2(d): G/C is a string C-group of order 2^{2d-1} and G/C ≅ G(C_d)
-
IndisputableMonolith/Foundation/ArithmeticFromLogic.leanLogicNat initial Peano object unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
G(C_d) nilpotency class 2 with central (ρ_i ρ_{i+1})^2
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Y. Berkovich and Z. Janko,Groups of Prime Power Order, Vol. 1, De Gruyter Expositions in Mathe- matics 46, De Gruyter, Berlin, 2008
work page 2008
-
[2]
P. A. Brooksbank and D. Leemans, Polytopes of large rank forP SL(4,F q),J. Algebra452 (2016), 390–400
work page 2016
-
[3]
P. A. Brooksbank and D. A. Vicinsky, Three-dimensional classical groups acting on polytopes,Discrete Comp. Geom.44 (2010), no. 3, 654–659
work page 2010
-
[4]
P. J. Cameron, M. E. Fernandes, D. Leemans and M. Mixer, Highest rank of a polytope forA n,Proc. Lond. Math. Soc.(3) 115 (2017), no. 1, 135–176
work page 2017
-
[5]
P. J. Cameron, M. E. Fernandes and D. Leemans, The number of string C-groups of high rank,Adv. Math.453 (2024), Article ID 109832
work page 2024
-
[6]
Conder, The smallest regular polytopes of given rank,Adv
M. Conder, The smallest regular polytopes of given rank,Adv. Math.236 (2013), 92–110
work page 2013
- [7]
-
[8]
H. S. M. Coxeter and W. O. J. Moser,Generators and Relations for Discrete Groups, 4th Edition, Springer, 1980
work page 1980
-
[9]
G. Cunningham, Y.-Q. Feng, D.-D. Hou and E. Schulte, Regular and semiregular polytopes with prescribed 3-sections and groups of 2-power order (title tentative), in preparation
-
[10]
G. Cunningham, Y.-Q. Feng, D.-D. Hou and E. Schulte, Symmetric polytopes whose automorphism groups are 2-groups, J. Algebra 698 (2026), 349–372
work page 2026
-
[11]
M.-E. Fernandes, D. Leemans and A. Ivic-Weiss, Highly symmetric hypertopes,Aequationes Math.90 (2016), 1045–1067
work page 2016
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
-
[18]
Hubard, Two-orbit polyhedra from groups,European Journal of Combinatorics, 31 (2010), 943–960
I. Hubard, Two-orbit polyhedra from groups,European Journal of Combinatorics, 31 (2010), 943–960
work page 2010
-
[19]
I. Hubard and E. Schulte, Two-orbit polytopes, arXiv:2604.00185 [math.CO]
-
[20]
G. A. Jones and D. Singerman, Belyi functions, hypermaps, and Galois groups,Bull. London Math. Soc.28 (1996), 561–590
work page 1996
-
[21]
D. Leemans and E. Schulte, Groups of typeL 2(q) acting on polytopes,Adv. Geom.7 (2007), no. 4, 529–539
work page 2007
-
[22]
P. McMullen and E. Schulte,Abstract Regular Polytopes, Cambridge University Press, 2002
work page 2002
-
[23]
B. Monson and E. Schulte, Semiregular polytopes and amalgamated C-groups,Adv. Math.229 (2012), 2767–2791
work page 2012
-
[24]
Pellicer,Abstract Chiral Polytopes, Cambridge University Press, 2025
D. Pellicer,Abstract Chiral Polytopes, Cambridge University Press, 2025
work page 2025
-
[25]
E. Schulte and A. I. Weiss, Problems on polytopes, their groups, and realizations,Periodica Mathe- matica Hungarica, (Special Issue on Discrete Geometry) 53 (2006), 231–255. Dong-Dong Hou, Shanxi Key Laboratory of Cryptography and Data Security, Depart- ment of Mathematics, Shanxi Normal University, Taiyuan, 100044, P.R. China Email address:holderhandsome...
work page 2006
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.