The Bounded and Precise Word Problems for Presentations of Groups

DOI10.1090/MEMO/1281OpenAlexW2473896820MaRDI QIDQ5113919FDOQ5113919

S. V. Ivanov

Publication date: 19 June 2020

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.08036

Recommendations

• scientific article
• Publication:3033961
• Finitely presented solvable groups and Lie algebras with unsolvable word problem
• On the difficulty of presenting finitely presentable groups.
• The word problem for geometrically finite groups
• The word problem and the isomorphism problem for groups
• A Bound on the Presentation Rank of a Finite Group
• scientific article; zbMATH DE number 895294
• ON THE WORD PROBLEM IN PERIODIC GROUP VARIETIES
• On the word problem for groups defined by periodic relations

zbMATH Keywords

presentations of groupsdiagramsword problemspolygonal curvespolylogarithmic space

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Research exposition (monographs, survey articles) pertaining to group theory (20-02)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Complexity
• Relationships between nondeterministic and deterministic tape complexities
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Title not available (Why is that?)
• Word Problems Solvable in Logspace
• Title not available (Why is that?)
• THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
• Combinatorial group theory.
• On limited nondeterminism and the complexity of the V-C dimension
• Recursive Unsolvability of a problem of Thue
• Algorithms for Loop Matchings
• The word problem
• Isoperimetric functions of groups and computational complexity of the word problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the width of elements in free groups
• An O (log( n ) ^4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
• Title not available (Why is that?)
• On the complexity of some problems on groups input as multiplication tables
• Title not available (Why is that?)
• Speeding up the dynamic algorithm for planar RNA folding
• On finding a minimum dominating set in a tournament
• Title not available (Why is that?)
• Tangent unit-vector fields: nonabelian homotopy invariants and the Dirichlet energy
• The word problem in semi-groups with cancellation
• On Dehn functions of infinite presentations of groups.
• Tangent unit-vector fields: non-abelian homotopy invariants and the Dirichlet energy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing area in presentations of the trivial group

This page was built for publication: The Bounded and Precise Word Problems for Presentations of Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113919)