Symbolic computation of Schur multipliers with an application to the groups of order dividing $p^6$
Bettina Eick, Taleea Jalaeeyan Ghorbanzadeh

TL;DR
This paper presents an algorithm for computing Schur multipliers of nilpotent Lie p-rings, enabling the analysis of p-groups of order up to p^6, which advances understanding of their structure.
Contribution
The paper introduces a symbolic computation algorithm for Schur multipliers of nilpotent Lie p-rings, applicable to p-groups of order up to p^6.
Findings
Computed Schur multipliers for all p-groups of order dividing p^6
Demonstrated the algorithm's effectiveness on a broad class of nilpotent Lie p-rings
Enhanced understanding of the structure of p-groups of small order
Abstract
We describe an algorithm to compute the Schur multipliers of all nilpotent Lie -rings in the family defined by a symbolic nilpotent Lie -ring. Symbolic nilpotent Lie -rings can be used to describe the isomorphism types of -groups of order for and all primes . We apply our algorithm to compute the Schur multipliers of all -groups of order dividing .
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
TopicsFinite Group Theory Research · Advanced Algebra and Geometry · Algebraic Geometry and Number Theory
