Generation of infinite factorizable inverse monoids. (Q444663): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00233-011-9339-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014826388 / rank
 
Normal rank

Revision as of 01:26, 20 March 2024

scientific article
Language Label Description Also known as
English
Generation of infinite factorizable inverse monoids.
scientific article

    Statements

    Generation of infinite factorizable inverse monoids. (English)
    0 references
    0 references
    16 August 2012
    0 references
    Let \(M\) be an inverse monoid, \(E\) its semilattice of idempotents and \(G\) its group of units. Then \(GE\) is a submonoid of \(M\) called the `factorizable part' of \(M\). The paper under review studies the factorizable parts for the symmetric inverse monoid and the dual symmetric inverse monoid on an infinite set. The author computes the rank (i.e. the minimal cardinality for a generating set), the relative rank related to the group of units, and the Sierpiński rank for these two monoids. Finally, it is shown that neither of these monoids has the semigroup Bergman property (having this property means that for any generating set the length function on the semigroup is bounded).
    0 references
    0 references
    factorizable inverse monoids
    0 references
    factorizable parts of symmetric inverse monoids
    0 references
    dual symmetric inverse monoids
    0 references
    generators
    0 references
    generating sets
    0 references
    relative ranks
    0 references
    Bergman property
    0 references
    idempotents
    0 references
    0 references