The finitary andrews-curtis conjecture

Alexandre V. Borovik, Alexander Lubotzky, Alexei G. Myasnikov

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

8 Scopus citations

Abstract

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent importance for computational group theory. It also resolves a question asked in [5] and shows that a computation in finite groups cannot lead to a counterexample to the classical conjecture, as suggested in [5].

Original languageEnglish
Title of host publicationProgress in Mathematics
PublisherSpringer Basel
Pages15-30
Number of pages16
DOIs
StatePublished - 2005

Publication series

NameProgress in Mathematics
Volume248
ISSN (Print)0743-1643
ISSN (Electronic)2296-505X

Bibliographical note

Publisher Copyright:
© 2005, Birkhäuser Verlag Basel/Switzerland.

Keywords

  • Andrews-Curtis conjecture
  • Finite group
  • Generators

Fingerprint

Dive into the research topics of 'The finitary andrews-curtis conjecture'. Together they form a unique fingerprint.

Cite this