The complexity of balanced presentations and the Andrews-Curtis conjecture
<p>Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new understanding of how Dehn functions of groups behave under cert...
| Hovedforfatter: | |
|---|---|
| Format: | Journal article |
| Udgivet: |
2016
|