Stable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction
Abstract
Recent work by Shehper et al. (2024) demonstrated that the well-known Akbulut-Kirby AK(3) balanced presentation of the trivial group is stably AC-equivalent to the trivial presentation. This result eliminates AK(3) as a potential counterexample to the stable Andrews-Curtis conjecture. In this paper, we present an alternative proof of this result using an automated deduction approach. We provide several transformation sequences, derived from two different proofs generated by the automated theorem prover Prover9, that certify the stable AC-equivalence of AK(3) and the trivial presentation. We conclude by proposing a challenge to develop computational methods for searching stable AC-transformations.
Cite
@article{arxiv.2501.18601,
title = {Stable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction},
author = {Alexei Lisitsa},
journal= {arXiv preprint arXiv:2501.18601},
year = {2025}
}
Comments
7 pages, supplementary data is available at zenodo.org