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

cancellation propertiesembedding semigroups into groupsfinite directed planar graphsfree semigroupsgenerators and relations

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

(41)

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

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)