The rank of the endomorphism monoid of a uniform partition. (Q2391158): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00233-008-9122-0 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977841303 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0807.1214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative ranks in the monoid of endomorphisms of an independence algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating countable sets of endomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranks of Semigroups Generated by Order-Preserving Transformations with a Fixed Partition Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: On idempotent ranks of semigroups of partial transformations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating continuous mappings with Lipschitz mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nilpotent ranks of certain semigroups of transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ranks of certain semigroups of order-preserving transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators and factorisations of transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Idempotent rank in finite full transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relative ranks of full transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rank of the semigroup \(T_E(X)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nilpotent ranks of semigroups of partial transformations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank properties in finite inverse semigroups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00233-008-9122-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:03, 18 December 2024

scientific article
Language Label Description Also known as
English
The rank of the endomorphism monoid of a uniform partition.
scientific article

    Statements

    The rank of the endomorphism monoid of a uniform partition. (English)
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    The authors prove that the minimal possible cardinality for a generating set of the semigroup of all transformations of a finite set of cardinality at least three that leave a nontrivial uniform partition invariant equals four. For two other semigroups of all transformations which preserve (in a certain sense) the equivalence relation determined by a uniform partition as above it is shown that the minimal possible cardinality for a generating set is three.
    0 references
    transformation semigroups
    0 references
    generating sets
    0 references
    endomorphism monoids
    0 references
    uniform partitions
    0 references
    wreath products
    0 references
    relative ranks
    0 references
    0 references
    0 references

    Identifiers