String C-groups of order 4 p m
A \textit{string \(C\)-group} is a pair \((G, S)\), where \(G\) is a finite group and \(S := (\rho_0, \ldots, \rho_{n-1})\) is a generating set consisting of \(n\) involutions, satisfying the following:\N\begin{itemize}\N\item For each \(i,j \in \{0,\ldots,n-1\}\) with \(|i-j| > 1\), we have \(\rho_i \rho_j = \rho_j \rho_i\);\N\item For each \(I, J \subseteq \{0, \ldots, n-1\}\), the intersection of the generated subgroups satisfies \(\langle \rho_i \mid i \in I \rangle \cap \langle \rho_j \mid j \in J \rangle = \langle \rho_k \mid k \in I \cap J \rangle\).\N\end{itemize}\NThe cardinality of \(S\) is called the \textit{rank of \((G,S)\)}. These objects are of combinatorial interest because they provide a group-theoretic framework for constructing abstract regular polytopes.\N\NIn this paper, the authors investigate rank~\(3\) string \(C\)-groups of order \(4p^m\), where \(p\) is an odd prime and \(m \geq 2\), with particular focus on the Schläfli type \(\{k_1, k_2\}\), where \(k_i = o(\rho_{i-1} \rho_i)\) and on the structure of the Sylow \(p\)-subgroup \(P\) of \(G\). The proofs rely on standard techniques for solvable groups containing a large Sylow \(p\)-subgroup.\N\NTheorem 1.1 describes the group-theoretic structure of such groups, proving that:\N\begin{itemize}\N\item \(G\) is isomorphic to the semidirect product \(P \rtimes \langle \rho_0, \rho_2 \rangle\); \item\(p\) divides both \(k_1\) and \(k_2\) and one of them is even;\N\item the minimal number of generators of \(P\) is \(2\).\N\end{itemize}\NTheorem~1.2 establishes that \(P\) is abelian if and only if the group is \textit{tight} (that is, \(|G| = 2k_1k_2\)) -- actually, such a tight string\N\(C\)-group is unique. Theorem 1.3 presents an infinite family of examples with non-abelian \(P\) of Schläfli type \(\{p, 2p\}\). The construction uses the structure of a \(p\)-group whose Hughes subgroup coincides with a maximal abelian subgroup and highlights how its structure relates to certain binomial coefficient identities.
- A Course in Enumeration
- Abstract Regular Polytopes
- All alternating groups \(A_n\) with \(n\geq 12\) have polytopes of rank \(\lfloor\frac{n-1}{2}\rfloor\)
- Almost simple groups of Suzuki type acting on polytopes
- Almost simple groups with socle PSL\((2,q)\) acting on abstract regular polytopes
- An atlas of abstract regular polytopes for small groups
- An atlas of small regular abstract polytopes
- An extension of the classification of high rank regular polytopes
- Classification of tight regular polyhedra
- Corrigendum to ``Polytopes of high rank for the symmetric groups
- Endliche Gruppen I
- Existence of regular 3-polytopes of order \(2^n\)
- Groups of order at most 6,000 generated by two elements, one of which is an involution, and related structures
- Groups of prime power order. Vol. 1.
- Groups of Ree type in characteristic 3 acting on polytopes
- Groups of type L 2(q) acting on polytopes
- Highest rank of a polytope for An
- scientific article; zbMATH DE number 3739805 (Why is no real title available?)
- On a special class of p-groups
- On regular polytopes of 2-power order
- On the ranks of string C-group representations for symplectic and orthogonal groups
- Partial Difference Sets
- Polytopes of high rank for the alternating groups
- Polytopes of high rank for the symmetric groups
- Polytopes of large rank for \(\mathrm{PSL}(4,\mathbb{F}_q)\)
- Polytopes with groups of type \(\text{PGL}_2(q)\)
- Problems on polytopes, their groups, and realizations
- String C-group representations of almost simple groups: A survey
- String C-groups of order 1024
- The H_p-problem and the structure of H_p-groups
- The groups of order at most 2000
- The Magma algebra system. I: The user language
- The number of string C-groups of high rank
- The smallest regular polytopes of given rank
- Three-dimensional classical groups acting on polytopes
This page was built for publication: String C-groups of order 4 p m
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969120)
