2021
DOI: 10.1080/26375451.2021.1904735
|View full text |Cite
|
Sign up to set email alerts
|

The B B Newman spelling theorem

Abstract: This article aims to be a self-contained account of the history of the B B Newman Spelling Theorem, including the historical context in which it arose. First, an account of B B Newman and how he came to prove his Spelling Theorem is given, together with a description of the author's efforts to track this information down. Following this, a highlevel description of combinatorial group theory is given. This is then tied in with a description of the history of the word problem, a fundamental problem in the area. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 34 publications
0
3
0
Order By: Relevance
“…However, Pride reports on a counterexample to this statement, discovered by Newman. In fact, the example appears already in Newman's Ph.D. thesis (see [67] for the story of how this thesis was uncovered): where we use the convention that a b = bab −1 . In particular, as H is hyperbolic, being a finite index subgroup of a hyperbolic group (or applying Corollary 1.4), the Diophantine problem is decidable in the torsion-free one-relator group Gp a, b, c | a b a c = a .…”
Section: Torsion Subgroupsmentioning
confidence: 99%
“…However, Pride reports on a counterexample to this statement, discovered by Newman. In fact, the example appears already in Newman's Ph.D. thesis (see [67] for the story of how this thesis was uncovered): where we use the convention that a b = bab −1 . In particular, as H is hyperbolic, being a finite index subgroup of a hyperbolic group (or applying Corollary 1.4), the Diophantine problem is decidable in the torsion-free one-relator group Gp a, b, c | a b a c = a .…”
Section: Torsion Subgroupsmentioning
confidence: 99%
“…For example, one cannot even decide if a finitely presented group is trivial or not! For more details, we refer the reader to the author's English translation [53] of the articles on this subject by Adian and Markov. Notably, Tseytin [72] also contributed to this subject, providing a slight extension (focussed on the number of generators).…”
Section: Encodingsmentioning
confidence: 99%
“…Semigroup presentations go back to the mid-twentieth century, and again have proven a crucial tool in the above fields. For some early studies, see for example [1,2,100,101], and for early papers with connections to logic see [84,102,116]; some historical information can be found in [97].…”
Section: Introductionmentioning
confidence: 99%