The Word Problem for Hyperbolic Groups
Tyler Taylor, Atish Mitra
Abstract
Tyler Taylor, Atish Mitra
Abstract
Max Dehn's word problem asks us the following: Given a finitely generated group in terms of generators and relations, is there an algorithmic procedure to determine if an arbitrary word represents the identity element? In this undergraduate research project, we define the notion of hyperbolicity of a metric space and present a geometric proof that all hyperbolic groups have solvable word problems.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Max Dehn's word problem asks us the following: Given a finitely generated group in terms of generators and relations, is there an algorithmic procedure to determine if an arbitrary word represents the identity element? In this undergraduate research project, we define the notion of hyperbolicity of a metric space and present a geometric proof that all hyperbolic groups have solvable word problems.
Key concepts: Word (group theory), Word problem (mathematics education), Word length, Hyperbolic group, Group (periodic table), Relatively hyperbolic group, Mathematics, Element (criminal law)