The number of string C-groups of high rank
Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans

TL;DR
This paper investigates the structure and classification of string C-groups of high rank for symmetric groups, establishing a recursive approach to classify them and providing a new integer sequence related to their counts.
Contribution
It introduces a method to classify high-rank string C-groups of symmetric groups by reducing the problem to smaller cases, and fully classifies those with rank close to the degree.
Findings
Number of string C-groups of rank r for S_n matches that of rank r+1 for S_{n+1} for large n.
Complete classification of string C-groups of rank n-κ for κ=1 to 6 when n is large enough.
New integer sequence A359367 enumerates these string C-groups, extending known results.
Abstract
If is a transitive group of degree having a string C-group of rank , then is necessarily the symmetric group . We prove that if is large enough, up to isomorphism and duality, the number of string C-groups of rank for (with ) is the same as the number of string C-groups of rank for . 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 for with odd, one can construct from them all string C-groups of rank for for any positive integer . The classification of the string C-groups of rank for is thus reduced to classifying string C-groups of rank for . A consequence of this result is the complete classification of all string C-groups of with…
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
TopicsAlgorithms and Data Compression · semigroups and automata theory · Natural Language Processing Techniques
