The number of string C-groups of high rank

From MaRDI portal



Abstract: If G is a transitive group of degree n having a string C-group of rank rgeq(n+3)/2, then G is necessarily the symmetric group Sn. We prove that if n is large enough, up to isomorphism and duality, the number of string C-groups of rank r for Sn (with rgeq(n+3)/2) is the same as the number of string C-groups of rank r+1 for Sn+1. This result and the tools used in its proof, in particular the rank and degree extension, imply that if one knows the string C-groups of rank (n+3)/2 for Sn with n odd, one can construct from them all string C-groups of rank (n+3)/2+k for Sn+k for any positive integer k. The classification of the string C-groups of rank rgeq(n+3)/2 for Sn is thus reduced to classifying string C-groups of rank r for S2r−3. A consequence of this result is the complete classification of all string C-groups of Sn with rank n−kappa for kappain1,ldots,6, when ngeq2kappa+3, which extends previously known results. The number of string C-groups of rank n−kappa, with ngeq2kappa+3, of this classification gives the following sequence of integers indexed by kappa and starting at kappa=1: (1,1,7,9,35,48) This sequence of integers is new according to the On-Line Encyclopedia of Integer Sequences. It will be available as sequence number A359367.














This page was built for publication: The number of string C-groups of high rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6421630)