On the geometry of semigroup presentations

DOI10.1016/0001-8708(80)90018-3MaRDI QIDQ1141761zbMATH OpenOpenAlexFDO

Authors John H. Remmers

Publication date 1980

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0001-8708(80)90018-3

zbMATH Keywords

generators and relationsfree semigroupsembedding semigroups into groupscancellation propertiesfinite directed planar graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Free semigroups, generators and relations, word problems (20M05)

Cites work

• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3263291 (Why is no real title available?)
• scientific article; zbMATH DE number 3285231 (Why is no real title available?)
• scientific article; zbMATH DE number 3416078 (Why is no real title available?)
• On Dehn's algorithm
• On Dehn's algorithm and the conjugacy problem
• Visualizing the word problem, with an application to sixth groups

Cited in

(38)

• The word problem for one-relator semigroups
• Space functions and space complexity of the word problem in semigroups.
• Asphericity results for ribbon disk complements via alternate descriptions
• Two cancellative commutative congruences and group diagrams.
• Tesselations ofS²and equations over torsion-free groups
• Factorization theory: from commutative to noncommutative settings.
• The word problem for some classes of Adian inverse semigroups
• A generalization of Adjan's theorem on embeddings of semigroups.
• A solvable conjugacy problem for finitely presented semigroups satisfying \(C(2)\) and \(T(4)\)
• Homotopy reduction systems for monoid presentations
• Generic complexity of finitely presented monoids and semigroups
• A new approach to the word and conjugacy problems in the braid groups
• Groupes de Garside
• On uniform decision problems and abstract properties of small overlap monoids.
• Presentations of groups and monoids
• Small overlap monoids. I: The word problem.
• Small overlap monoids. II: Automatic structures and normal forms.
• A cancellativity criterion for presented monoids
• Ends of semigroups
• On conjugate elements in a semigroup and semigroup diagrams
• DECISION AND SEPARABILITY PROBLEMS FOR BAUMSLAG–SOLITAR SEMIGROUPS
• The word problem for one-relation monoids: a survey
• Diagram groups and directed 2-complexes: homotopy and homology.
• The subword reversing method.
• Thickness of Feathers
• Adjan's theorem and conjugacy in semigroups
• A Švarc-Milnor lemma for monoids acting by isometric embeddings.
• Right-orderability versus left-orderability for monoids
• Gcd-monoids arising from homotopy groupoids
• DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS
• A structural property of Adian inverse semigroups
• Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
• Automatic Structures for Torus Link Groups
• Complete positive group presentations.
• Semigroups presented by one relation and satisfying the Church-Rosser property
• Products of conjugacy classes in a free group: a counterexample
• A note on the definition of small overlap monoids.
• GROUPS AND SEVERAL EQUATIONS IN ONE VARIABLE

This page was built for publication: On the geometry of semigroup presentations

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