Decomposition techniques for finite semigroups, using categories. I (Q1825289): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5570933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homomorphism theorem for finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition techniques for finite semigroups, using categories. II / rank
 
Normal rank

Latest revision as of 10:13, 20 June 2024

scientific article
Language Label Description Also known as
English
Decomposition techniques for finite semigroups, using categories. I
scientific article

    Statements

    Decomposition techniques for finite semigroups, using categories. I (English)
    0 references
    0 references
    1989
    0 references
    A surjective morphism of semigroups \(\theta\) : \(S\to T\) is said to be a maximal proper surmorphism if \(\theta\) is not an isomorphism and, for any factorization \(\theta =\theta_ 1\theta_ 2\), one the factors \(\theta_ 1\) and \(\theta_ 2\) is an isomorphism. The paper presents a refinement of the classification of maximal proper surmorphisms of finite semigroups obtained by \textit{J. Rhodes} [Math. Syst. Theory 1, 289-304 (1967; Zbl 0204.033)].
    0 references
    surjective morphism of semigroups
    0 references
    factorization
    0 references
    classification of maximal proper surmorphisms
    0 references
    finite semigroups
    0 references
    0 references

    Identifiers