The bounded and precise word problems for presentations of groups /

The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Ivanov, Sergeĭ, 1972- (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Providence, RI : American Mathematical Society, [2020]
Colección:Memoirs of the American Mathematical Society ; no. 1281.
Temas:
Presentations of groups (Mathematics)
Word problems (Mathematics)
Présentations de groupes (Mathématiques)
Problèmes des mots (Mathématiques)
Representaciones de grupos
Lenguaje y lenguas-Frecuencia de palabras
Group theory and generalizations > Special aspects of infinite or finite groups > Generators, relations, and presentations.
Group theory and generalizations > Special aspects of infinite or finite groups > Cancellation theory; application of van Kampen diagrams [See also 57M05].
Group theory and generalizations > Special aspects of infinite or finite groups > Word problems, other decision problems, connections with logic and automata [See also 03B25, 03D05, 03D40, 06B25, 08.
Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section > 04 in that area} > Theory of computing > Analysis of algorithms and problem com.
Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section > 04 in that area} > Computing methodologies and applications > Computer graphics.
Convex and discrete geometry > Polytopes and polyhedra > Combinatorial properties (number of faces, shortest paths, etc.) [See also 05Cxx].
Group theory and generalizations > Special aspects of infinite or finite groups > Geometric group theory [See also 05C25, 20E08, 57Mxx].
Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section > 04 in that area} > Algorithms {For numerical algorithms, see 65-XX; for combinat.
Acceso en línea:Texto completo
Descripción
Sumario:The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and th.
Notas:"March 2020, volume 264, number 1281 (fourth of 6 numbers)."
Descripción Física:1 online resource (v, 106 pages) : illustrations
Bibliografía:Includes bibliographical references.
ISBN:9781470458041
1470458047

Ejemplares similares