On disjoint unions of finitely many copies of the free monogenic semigroup. (Q372354): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00233-013-9468-9 / rank
Normal rank
 
Property / author
 
Property / author: Nikola Ruškuc / rank
Normal rank
 
Property / author
 
Property / author: Nikola Ruškuc / rank
 
Normal rank
Property / review text
 
The free monogenic semigroup \(N_a\) is the free semigroup on one generator \(a\), and this is isomorphic to the semigroup of natural numbers with addition. A semigroup \(S\) is said to be finitely presented if it admits a presentation \(\langle A\mid R\rangle\) where both the alphabet \(A\) and the set of relations \(R\) are finite. If any distinct elements \(s\) and \(t\) in \(S\) can be separated by some finite image of \(S\), i.e. there exists a finite semigroup \(T\) and a morphism \(\Phi\) from \(S\) onto \(T\) such that \(s\Phi\neq t\Phi\), one says that \(S\) is residually finite. While the disjoint union of a finite number of finitely presented [residually finite] groups is also finitely presented [residually finite], it is known that the same may not happen if one takes semigroups. Let \(N\) be a semigroup which is the disjoint union of \(n\) subsemigroups, each one of them a copy of the free monogenic semigroup. The main result in this paper states that \(N\) is finitely presented and residually finite. The proof of the first part also provides a positive answer for the decidability of the word problem for these semigroups. To conclude the paper the authors list a number of interesting questions with respect to ``being finitely presented or residually finite''.
Property / review text: The free monogenic semigroup \(N_a\) is the free semigroup on one generator \(a\), and this is isomorphic to the semigroup of natural numbers with addition. A semigroup \(S\) is said to be finitely presented if it admits a presentation \(\langle A\mid R\rangle\) where both the alphabet \(A\) and the set of relations \(R\) are finite. If any distinct elements \(s\) and \(t\) in \(S\) can be separated by some finite image of \(S\), i.e. there exists a finite semigroup \(T\) and a morphism \(\Phi\) from \(S\) onto \(T\) such that \(s\Phi\neq t\Phi\), one says that \(S\) is residually finite. While the disjoint union of a finite number of finitely presented [residually finite] groups is also finitely presented [residually finite], it is known that the same may not happen if one takes semigroups. Let \(N\) be a semigroup which is the disjoint union of \(n\) subsemigroups, each one of them a copy of the free monogenic semigroup. The main result in this paper states that \(N\) is finitely presented and residually finite. The proof of the first part also provides a positive answer for the decidability of the word problem for these semigroups. To conclude the paper the authors list a number of interesting questions with respect to ``being finitely presented or residually finite''. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Gracinda M. S. Gomes / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20M05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6213691 / rank
 
Normal rank
Property / zbMATH Keywords
 
free monogenic semigroup
Property / zbMATH Keywords: free monogenic semigroup / rank
 
Normal rank
Property / zbMATH Keywords
 
finitely presented semigroups
Property / zbMATH Keywords: finitely presented semigroups / rank
 
Normal rank
Property / zbMATH Keywords
 
residually finite semigroups
Property / zbMATH Keywords: residually finite semigroups / rank
 
Normal rank
Property / zbMATH Keywords
 
word problem
Property / zbMATH Keywords: word problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067447502 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.6169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generators and relations for unions of semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residual finiteness of finitely generated commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On residual finiteness of monoids, their Schützenberger groups and associated actions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Theorem of Malcev / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations for subgroups of monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic and Rees indices of subsemigroups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00233-013-9468-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:38, 9 December 2024

scientific article
Language Label Description Also known as
English
On disjoint unions of finitely many copies of the free monogenic semigroup.
scientific article

    Statements

    On disjoint unions of finitely many copies of the free monogenic semigroup. (English)
    0 references
    0 references
    0 references
    7 October 2013
    0 references
    The free monogenic semigroup \(N_a\) is the free semigroup on one generator \(a\), and this is isomorphic to the semigroup of natural numbers with addition. A semigroup \(S\) is said to be finitely presented if it admits a presentation \(\langle A\mid R\rangle\) where both the alphabet \(A\) and the set of relations \(R\) are finite. If any distinct elements \(s\) and \(t\) in \(S\) can be separated by some finite image of \(S\), i.e. there exists a finite semigroup \(T\) and a morphism \(\Phi\) from \(S\) onto \(T\) such that \(s\Phi\neq t\Phi\), one says that \(S\) is residually finite. While the disjoint union of a finite number of finitely presented [residually finite] groups is also finitely presented [residually finite], it is known that the same may not happen if one takes semigroups. Let \(N\) be a semigroup which is the disjoint union of \(n\) subsemigroups, each one of them a copy of the free monogenic semigroup. The main result in this paper states that \(N\) is finitely presented and residually finite. The proof of the first part also provides a positive answer for the decidability of the word problem for these semigroups. To conclude the paper the authors list a number of interesting questions with respect to ``being finitely presented or residually finite''.
    0 references
    free monogenic semigroup
    0 references
    finitely presented semigroups
    0 references
    residually finite semigroups
    0 references
    word problem
    0 references

    Identifiers