A note on the Poénaru condition

DOI10.1515/jgth.2001.036zbMath0996.20018OpenAlexW2317588150MaRDI QIDQ2776805

Ilya Kapovich

Publication date: 24 July 2002

Published in: Journal of Group Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d7eebae9ebc77af8b1ddc36d38031e35add10c6

zbMATH Keywords

computational complexityfinitely generated groupsCayley graphsfinitely presented groupsgroups with recursive isoperimetric functionsgroups with solvable word problemPoénaru condition

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Topological methods in group theory (57M07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

A Cayley graph for F2 × F2 which is not minimally almost convex ⋮ Tame combing and almost convexity conditions.

Cites Work

• On discrete solvgroups and Poénaru's condition
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the Poénaru condition