Filters compatible with isomorphism testing
From MaRDI portal
Publication:2200949
DOI10.1016/J.JPAA.2020.106528zbMATH Open1459.20031arXiv1805.03732OpenAlexW3048676907MaRDI QIDQ2200949FDOQ2200949
Authors: Joshua Maglione
Publication date: 24 September 2020
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Abstract: Like the lower central series of a nilpotent group, filters generalize the connection between nilpotent groups and graded Lie rings. However, unlike the case with the lower central series, the associated graded Lie ring may share few features with the original group: e.g. the associated Lie ring may be trivial or arbitrarily large. We determine properties of filters such that the Lie ring and group are in bijection. We prove that, under such conditions, every isomorphism between groups is induced by an isomorphism between graded Lie rings.
Full work available at URL: https://arxiv.org/abs/1805.03732
Recommendations
Finite nilpotent groups, (p)-groups (20D15) Nilpotent groups (20F18) Associated Lie structures for groups (20F40)
Cites Work
- Testing isomorphism of graded algebras
- Groups and Rings Having Automorphisms without Non-Trivial Fixed Elements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur les groupes nilpotents et les anneaux de Lie
- Automorphism group computation and isomorphism testing in finite groups
- A connection between the Baker-Hausdorff formula and a problem of Burnside
- Title not available (Why is that?)
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Title not available (Why is that?)
- Non-unique factorizations: a survey
- Longer nilpotent series for classical unipotent subgroups
- Efficient characteristic refinements for finite groups
- More characteristic subgroups, Lie rings, and isomorphism tests for \(p\)-groups.
- Computing isometry groups of Hermitian maps
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Über Gruppen und zugeordneten Liesche Ringe.
- Special polycyclic generating sequences for finite soluble groups.
- Isomorphism testing for \(p\)-groups
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Title not available (Why is that?)
- Most small \(p\)-groups have an automorphism of order 2
- Title not available (Why is that?)
- Computing subgroups by exhibition in finite solvable groups
- Algorithms for Group Isomorphism via Group Extensions and Cohomology
Cited In (3)
Uses Software
This page was built for publication: Filters compatible with isomorphism testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200949)