On isomorphism testing of a class of 2-nilpotent groups (Q1174452): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(91)90012-t / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053269728 / rank | |||
Normal rank |
Latest revision as of 11:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On isomorphism testing of a class of 2-nilpotent groups |
scientific article |
Statements
On isomorphism testing of a class of 2-nilpotent groups (English)
0 references
25 June 1992
0 references
Let \(G\) be a group. A 3-tuple \((x_ 1,x_ 2,x_ 3)\) of elements of \(G\) satisfies \(P_ 3\) if there exists a nontrivial permutation \(\sigma\) of its components such that \(x_ 1x_ 2x_ 3=x_{\sigma(1)} x_{\sigma(2)} x_{\sigma(3)}\). \(G\) satisfies \(P_ 3\) if every 3-tuple of elements of \(G\) satisfies \(P_ 3\). This paper provides a polynomial time isomorphism test for finite \(P_ 3\)-groups given by means of generators and relations. It is also shown that graph isomorphism testing is uniformly reducible to the word problem of a finitely presented group.
0 references
isomorphism problem
0 references
nilpotent groups
0 references
permutation property
0 references
polynomial time isomorphism test
0 references
finite \(P_ 3\)-groups
0 references
generators
0 references
relations
0 references
graph isomorphism testing
0 references
word problem
0 references
finitely presented group
0 references
0 references
0 references