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

Ruvim Lipyanski, Natalia Vanetik

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for some class of finite-dimensional 2-step nilpotent Lie algebras over a field and for some class of finite p-groups. We show that the isomorphism problem for graphs is harder than the two latter isomorphism problems in the sense of Borel reducibility. A computable analogue of Borel reducibility was introduced by S. Coskey, J. D. Hamkins, and R. Miller (2012). A relation of the isomorphism problem for undirected graphs to the well-known problem of classifying pairs of matrices over a field (up to similarity) is also studied.

Original languageEnglish
Article number1550078
JournalJournal of Algebra and its Applications
Volume14
Issue number5
DOIs
StatePublished - 25 Jun 2015

Keywords

  • Borel reducibility
  • Wild problems
  • graphs
  • nilpotent algebras
  • nilpotent groups

Fingerprint

Dive into the research topics of 'On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups'. Together they form a unique fingerprint.

Cite this