On the Andrews-Curtis conjecture and algorithms from topology
| dc.creator | Gadgil, Siddhartha | |
| dc.date | 2001-08-08 | |
| dc.date.accessioned | 2026-07-07T04:42:54Z | |
| dc.date.available | 2026-07-07T04:42:54Z | |
| dc.description | 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. | |
| dc.description | 12 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/math/0108053 | |
| dc.identifier | http://arxiv.org/abs/math/0108053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61987 | |
| dc.subject | Group Theory | |
| dc.subject | Geometric Topology | |
| dc.subject | 20F05; 57M07 | |
| dc.title | On the Andrews-Curtis conjecture and algorithms from topology | |
| dc.type | text |