Polynomial-time proofs that groups are hyperbolic
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 269496450
- Type
- D - Journal article
- DOI
-
10.1016/j.jsc.2020.08.003
- Title of journal
- Journal of Symbolic Computation
- Article number
- -
- First page
- 419
- Volume
- 104
- Issue
- -
- ISSN
- 0747-7171
- Open access status
- Access exception
- Month of publication
- August
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
A - Artificial Intelligence
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Finite presentations are a natural, but implicit way of describing abstract groups, arising in many applications. Most significant questions about them are undecidable in general, so any technique for analysing the structure of groups given in this way must sometimes fail, but such techniques have nevertheless been central in computational group theory since the 1930s. This paper introduces, analyses and evaluates the first entirely new technique in this area since the 1990s combining ideas from geometrical group theory with the theory of pregroups.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
