A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automorphisms of endomorphism semigroups of reflexive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism groups of centralizers of idempotents. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense relations are determined by their endomorphism monoids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic geometry in varieties of algebras with the given algebra of constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A question of B. Plotkin about the semigroup of endomorphisms of a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of simple hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored lines in a finite geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3289004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups and rings of endomorphisms of linear spaces. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Theory of Generalized Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Erdös, Faber, and Lovász about <i>n</i>-Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fisher type inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of normal transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of normal partial transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inner automorphisms of finite transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On groups associated with transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroup structures for families of functions, I. Some Homomorphism Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5814826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of categories of free algebras of varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the endomorphism semigroup of a free monoid or a free semigroup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups of mappings on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definability of hypergraphs by their semigroups of homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Generalized Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsets of a finite set that intersect each other in at most one element / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5766178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing nearly-disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of transformation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654062 / rank
 
Normal rank

Latest revision as of 18:56, 25 June 2024

scientific article
Language Label Description Also known as
English
A method of finding automorphism groups of endomorphism monoids of relational systems.
scientific article

    Statements

    A method of finding automorphism groups of endomorphism monoids of relational systems. (English)
    0 references
    0 references
    0 references
    11 May 2007
    0 references
    Let \(\mathcal A\) be a mathematical structure and \(\text{End}(\mathcal A)\) denotes the semigroup of all endomorphisms of \(\mathcal A\). Describing the automorphism group of the monoid \(\text{End}(\mathcal A)\) is a known algebraic problem. The purpose of the paper under review is to describe the group \(\Aut\,\text{End}(\mathcal A)\) for the case when \(\mathcal A\) is a relational system \((A,\rho)\), where \(\rho\) is an \(n\)-ary relation on the set \(A\). Reviewer's remark: The authors mention that recently this ``problem of describing \(\Aut\,\text{End}(\mathcal A)\) has attracted an even wider attention for its links to universal algebraic topology'', but this topic developed by B. I. Plotkin is called universal algebraic geometry.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automorphism groups
    0 references
    endomorphism monoids
    0 references
    transformation semigroups
    0 references
    reflexive relations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references