2018
DOI: 10.48550/arxiv.1805.03732
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Compatible filters with isomorphism testing

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 isomorp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…We introduce a colored (hyper-)graph based on an algebraic data structure known as a recursivelyrefineable filter which identifies abelian groups and vector spaces layered together to form the structure of a finite group. Filters have been useful in several isomorphism tests [W3,M3,M1,BOW]. As the name suggests, filters can be refined, and with each refinement the cost T (n) of isomorphism testing decreases after refinement to a function in O(T (n) 1/c ), for some c 2.…”
Section: Introductionmentioning
confidence: 99%
“…We introduce a colored (hyper-)graph based on an algebraic data structure known as a recursivelyrefineable filter which identifies abelian groups and vector spaces layered together to form the structure of a finite group. Filters have been useful in several isomorphism tests [W3,M3,M1,BOW]. As the name suggests, filters can be refined, and with each refinement the cost T (n) of isomorphism testing decreases after refinement to a function in O(T (n) 1/c ), for some c 2.…”
Section: Introductionmentioning
confidence: 99%