Answers are grounded in this paper and cite their sources.
The Word Problem is that of determining when two elements of F (or two 'words') represent the same element of G, or, equivalently, when a given element W of F lies in R, and so can be written in the form (1). Magnus has solved this problem for the case n = 1, of a single defining relation.3 A complementary problem is that of uniqueness for expressions of the form (1), or more simply that of determining all identities among the relations R,, * **, Rn Xof the form
No takes yet. Share an insight, caveat, or question.
Roger C. Lyndon (1950) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: