Construction of long root SL(2,q)-subgroups in black box groups
Sukru Yalcinkaya

TL;DR
This paper introduces algorithms for constructing long root SL(2,q)-subgroups and determining the triviality of the p-core in black-box groups, aiding the analysis of finite simple groups of Lie type.
Contribution
It provides a Monte Carlo algorithm for constructing specific subgroups and a method to determine the p-core's triviality in black-box groups, addressing open questions in group theory.
Findings
Algorithm constructs long root SL(2,q)-subgroups in finite simple groups of Lie type.
Algorithm determines whether the p-core of a black-box group is trivial.
Addresses a question posed by Babai and Shalev regarding the p-core.
Abstract
We present a one sided Monte--Carlo algorithm which constructs a long root -subgroup in , where is a black-box group and is a finite simple group of Lie type defined over a field of odd order for some . Our algorithm is based on the analysis of the structure of centralizers of involutions and can be viewed as a computational version of Aschbacher's Classical Involution Theorem. We also present an algorithm which determines whether the -core (or "unipotent radical") of a black-box group is trivial or not, where is a finite simple classical group of odd characteristic . This answers a well-known question of Babai and Shalev.
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 · Coding theory and cryptography
