Algorithmic and combinatorial methods for enumerating the relators of a group presentation
Group Theory
2019-08-27 v9
Abstract
The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by a factor which is over-exponential than that of classical methods using van Kampen diagrams.
Cite
@article{arxiv.0802.3544,
title = {Algorithmic and combinatorial methods for enumerating the relators of a group presentation},
author = {Carmelo Vaccaro},
journal= {arXiv preprint arXiv:0802.3544},
year = {2019}
}
Comments
This is my Ph.D. thesis, 134 pages