On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups

DOI10.1142/S0219498815500784zbMath1309.05128arXiv0812.4158OpenAlexW2963741605WikidataQ115245659 ScholiaQ115245659MaRDI QIDQ4983072

Natalia Vanetik, Ruvim Lipyanski

Publication date: 14 April 2015

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.4158

zbMATH Keywords

nilpotent groupsnilpotent algebrasBorel reducibilitywild problems

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite nilpotent groups, (p)-groups (20D15) Solvable, nilpotent (super)algebras (17B30) Other degrees and reducibilities in computability and recursion theory (03D30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice

Cites Work

• The problems of classifying pairs of forms and local algebras with zero cube radical are wild.
• Graph algebras
• Graph isomorphism, general remarks
• Schur multipliers and the Lazard correspondence.
• Complexity of matrix problems
• Complexity of ring morphism problems
• Problems of classifying associative or Lie algebras and triples of symmetric or skew-symmetric matrices are wild
• A Borel reductibility theory for classes of countable structures
• Strong isomorphism reductions in complexity theory
• Problems of classifying associative or Lie algebras over a field of characteristic not two and finite metabelian groups are wild
• Finite Model Theory

This page was built for publication: On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups