On the Andrews-Curtis conjecture and algorithms from topology
Siddhartha Gadgil
Abstract
We relate the Andrews-Curtis conjecture to the triviality problem for balanced presentations of groups using algorithms from 3-manifold topology. Implementing this algorithm could lead to counterexamples to the Andrews-Curtis conjecture.
Create a lesson
Related papers
Property R∞ for Artin and Coxeter groups whose outer automorphisms are length-preserving
Ignat Soroko
DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
Pallabi Manna, Santanu Mandal
On p-groups with one nonlinear codegree
Jiwei Zheng, Heng Lv
Classes of Subgroups of a finite group with isomorphic quotient groups
Tushar Halder, Sachin Ballal
Cohomology and multiplicative gaps for quasi-isometries of nilpotent groups
Mayukh Mukherjee, Soumyadeb Samanta, Soumyadip Thandar
On the number of conjugacy classes of finite solvable groups of order divisible by p2
Thomas Michael Keller