The Triviality problem for profinite completions
dc.creator | Bridson, Martin R | |
dc.creator | Wilton, Henry John | |
dc.date.accessioned | 2018-11-24T23:26:22Z | |
dc.date.available | 2015-02-25T12:19:09Z | |
dc.date.available | 2018-11-24T23:26:22Z | |
dc.date.issued | 2015-02-24 | |
dc.identifier | https://www.repository.cam.ac.uk/handle/1810/246916 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3814 | |
dc.description.abstract | We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this property remains undecidable among the fundamental groups of compact, non-positively curved square complexes. We deduce that many other properties of groups are undecidable. For hyperbolic groups, there cannot exist algorithms to determine largeness, the existence of a linear representation with infinite image (over any infinite field), or the rank of the profinite completion. | |
dc.language | en | |
dc.publisher | Springer | |
dc.publisher | Inventiones Mathematicae | |
dc.title | The Triviality problem for profinite completions | |
dc.type | Article |
Files in this item
Files | Size | Format | View |
---|---|---|---|
BridWiltInvent3.pdf | 414.0Kb | application/pdf | View/ |