Solvable word problems in semigroups

DOI10.1007/BF02573520MaRDI QIDQ1346307zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 28 September 1995

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/135382

zbMATH Keywords

\(C(n)\) semigroupsfinitely presented semigroupspresentationssmall cancellation theorysolvable word problemstar graphs

Mathematics Subject Classification ID

Cancellation theory of groups; application of van Kampen diagrams (20F06) Free semigroups, generators and relations, word problems (20M05)

Review text

A semigroup \(S\) with presentation \((X;R)\) is a \(C(n)\) semigroup \((n \geq 1)\) if no \(R\)-word is a product of fewer than \(n\) pieces (a piece being a word which is a common factor of \(R\)-words in at least two distinct ways). Every finitely presented \(C(n)\) semigroup has a solvable word problem for all \(n \geq 3\) (for background and details see the reviewer's book `Techniques of Semigroup Theory' [Oxf. Univ. Press, 1982; Zbl 0744.20046]). In this paper the analogy with the small cancellation theory of groups is completed by showing that \(S\) has a solvable word problem if \(S\) is finitely presented and the presentation satisfies \(C(2)\) and \(T(4)\), where \(T(4)\) is a condition which forbids the occurrence of four particular subgraphs in the so-called star graph of the presentation.

Recommendations

• A solvable conjugacy problem for finitely presented \(C(3)\) semigroups.
• A solvable conjugacy problem for finitely presented semigroups satisfying \(C(2)\) and \(T(4)\)
• On the invariance of small overlap hypotheses
• On the solvability of word problem by Adian graphs.
• SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS

Cites work

• scientific article; zbMATH DE number 52907 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• On the T(q)-conditions of small cancellation theory

Cited in

(14)

• On the problem of embedding elements of groups in subsemigroups
• On satisfiability of the \(C'(1/3)\) and \(C(4)\) conditions for special homogeneous semigroups with defining word-powers
• A solvable conjugacy problem for finitely presented semigroups satisfying \(C(2)\) and \(T(4)\)
• A solvable conjugacy problem for finitely presented \(C(3)\) semigroups.
• On the solvability of word problem by Adian graphs.
• Semigroups with a Context-Free Word Problem
• On conjugate elements in a semigroup and semigroup diagrams
• scientific article; zbMATH DE number 5155120 (Why is no real title available?)
• scientific article; zbMATH DE number 4116803 (Why is no real title available?)
• DECISION AND SEPARABILITY PROBLEMS FOR BAUMSLAG–SOLITAR SEMIGROUPS
• Presentations and word problem for strong semilattices of semigroups.
• Thickness of Feathers
• The membership problem for \(\langle a,b:bab^2=ab\rangle\)
• On the invariance of small overlap hypotheses

This page was built for publication: Solvable word problems in semigroups

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