Balanced finite presentations of the trivial group
classification
🧮 math.GR
math.MG
keywords
finitetrivialbalancedgrouppresentationsconstructdemonstrateelement
read the original abstract
We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial element grows faster than the tower of exponentials of any fixed height of the length of the finite presentation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.