Schur's exponent conjecture II
Michael Vaughan-Lee

TL;DR
This paper advances the understanding of Schur's exponent conjecture by providing bounds and computational results for the exponent of the Schur multiplier in finite groups of specific exponents and nilpotency classes, extending Moravec's 2007 work.
Contribution
It refines bounds on the exponent of Schur multipliers for finite groups, computes specific cases for groups of exponent 8 and 9, and explores the order of commutators in Schur covers.
Findings
Bound e ≥ n for groups of exponent n=8,9.
e_{p^{k},p^{2}-p-1} divides p for all prime powers p^{k}.
e_{2^{k},c} and e_{3^{k},c} have specific values depending on c.
Abstract
Primoz Moravec published a very important paper in 2007 where he proved that if is a finite group of exponent then the exponent of the Schur multiplier of can be bounded by a function depending only on . Moravec does not give a value for , but actually his proof shows that we can take where is the order of in the Schur multiplier of . (Here is the largest finite two generator group of exponent , and we take to be the generators of .) It is an easy hand calculation to show that for , and it is a straightforward computation with the -quotient algorithm to show that for . The groups and are way out of range of the -quotient algorithm, even with a modern supercomputer. But we are able toshow that for . Moravec's proof also…
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
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
