A strong geometric hyperbolicity property for directed graphs and monoids.
DOI10.1016/j.jalgebra.2014.08.007zbMath1315.20051arXiv1401.0752OpenAlexW2155701916MaRDI QIDQ743919
Publication date: 1 October 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0752
Cayley graphsword problemhyperbolicityhyperbolic monoidsfinitely generated left cancellative monoidsfinitely presented cancellative monoidssemimetric spaces
Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hyperbolic groups and nonpositively curved groups (20F67) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- Decision problems for word-hyperbolic semigroups
- Hyperbolicity of monoids presented by confluent monadic rewriting systems.
- Finite complete rewriting systems and the complexity of word problem
- Diagram groups and directed 2-complexes: homotopy and homology.
- Notions of hyperbolicity in monoids.
- Some undecidability results for non-monadic Church-Rosser Thue systems
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- On the definition of word hyperbolic groups.
- Automatic semigroups
- Combinatorial group theory.
- Isoperimetric and isodiametric functions of groups
- Isoperimetric functions of groups and computational complexity of the word problem
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Some decidability and undecidability results on Green's relations for automatic monoids.
- The word problem in semi-groups with cancellation
- QUASI-ISOMETRY AND FINITE PRESENTATIONS OF LEFT CANCELLATIVE MONOIDS
- THE THOMPSON–HIGMAN MONOIDS Mk,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY
- A ŠVARC–MILNOR LEMMA FOR MONOIDS ACTING BY ISOMETRIC EMBEDDINGS
- HYPERBOLIC GROUPS AND COMPLETELY SIMPLE SEMIGROUPS
- THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID Mk, 1 AND THEIR COMPLEXITY
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- On the hyperbolicity of small cancellation groups and one-relator groups
- Word hyperbolic semigroups
- CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS
- Groups acting on semimetric spaces and quasi-isometries of monoids
- Recursive Unsolvability of a problem of Thue
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A strong geometric hyperbolicity property for directed graphs and monoids.
