On \(F\)-inverse covers of inverse monoids. (Q2581279): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jpaa.2005.05.006 / rank
Normal rank
 
Property / cites work
 
Property / cites work: INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braids and self-distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry monoid of left self-distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroup expansions using the derived category, kernel, and Malcev products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTIAL ACTIONS OF GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular representation of groupoid C* -algebras and applications to inverse semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: E-unitary inverse monoids and the Cayley graph of a group presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: F-Inverse Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON A GROUPOID CONSTRUCTION FOR ACTIONS OF CERTAIN INVERSE SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categories as algebra: An essential ingredient in the theory of monoids / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JPAA.2005.05.006 / rank
 
Normal rank

Latest revision as of 08:43, 19 December 2024

scientific article
Language Label Description Also known as
English
On \(F\)-inverse covers of inverse monoids.
scientific article

    Statements

    On \(F\)-inverse covers of inverse monoids. (English)
    0 references
    0 references
    0 references
    9 January 2006
    0 references
    An inverse monoid \(F\) in which every class with respect to the smallest group congruence has a maximal element in the natural partial order is called an \(F\)-inverse monoid. Such a monoid \(F\) is an \(F\)-inverse cover of an inverse monoid \(M\) if there is an idempotent-separating onto homomorphism \(F\to M\). While it is well known that every inverse monoid admits an \(F\)-inverse cover, it remains an open problem whether every finite inverse monoid admits a finite \(F\)-inverse cover. One of the difficulties in trying to solve the problem is that the only construction of an \(F\)-inverse cover which is known involves monoids over free groups. This paper proposes an approach to the problem by examining conditions on a variety \(\mathcal U\) of groups which ensure that a given inverse monoid \(M\) admits an \(F\)-inverse cover over \(\mathcal U\). For instance, as an application of results on Burnside varieties of groups, the authors show that, if a monoid \(M\) admits an \(E\)-unitary cover over a periodic group then it also admits an \(F\)-inverse cover over a periodic group. They also give several necessary and sufficient conditions for a finite inverse monoid \(M\) to have a finite \(F\)-inverse cover, such as: (a) there exists a prime \(p\) such that, for every elementary Abelian \(p\)-group \(H\), the Margolis-Meakin expansion \(M(H)\) has a finite \(F\)-inverse cover; (b) for every positive integer \(n\) there exists a positive integer \(m\) such that, for every arrow \(x\) of the free category in the variety of categories generated by the Kostrikin-Zelmanov variety \({\mathcal K}_m\) of exponent \(m\), freely generated by the Hasse diagram of the Boolean lattice of \(2^n\) elements, directed upward, every term in a certain recursively defined sequence of subgraphs associated with \(x\) contains the terminal vertex of~\(x\).
    0 references
    inverse monoids
    0 references
    inverse covers
    0 references
    prehomomorphisms
    0 references
    premorphisms
    0 references
    Margolis-Meakin expansions
    0 references
    free categories
    0 references
    Kostrikin-Zelmanov varieties
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references