Low-complexity computations for nilpotent subgroup problems
Low-complexity computations for nilpotent subgroup problems
We solve the following algorithmic problems using [Formula: see text] circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and isolator of a subgroup, coset intersection, and computing the torsion subgroup. Additionally, if any …