A method of finding automorphism groups of endomorphism monoids of relational systems.
From MaRDI portal
Publication:879337
Recommendations
Cites work
- scientific article; zbMATH DE number 3164651 (Why is no real title available?)
- scientific article; zbMATH DE number 3170321 (Why is no real title available?)
- scientific article; zbMATH DE number 3847439 (Why is no real title available?)
- scientific article; zbMATH DE number 3914601 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 48991 (Why is no real title available?)
- scientific article; zbMATH DE number 165076 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3384042 (Why is no real title available?)
- scientific article; zbMATH DE number 3420807 (Why is no real title available?)
- scientific article; zbMATH DE number 3026066 (Why is no real title available?)
- scientific article; zbMATH DE number 3075813 (Why is no real title available?)
- scientific article; zbMATH DE number 3082585 (Why is no real title available?)
- A Fisher type inequality
- A Note on Generalized Equivalence Relations
- A question of B. Plotkin about the semigroup of endomorphisms of a free group
- Algebraic geometry in varieties of algebras with the given algebra of constants
- Automorphism groups of centralizers of idempotents.
- Automorphisms of categories of free algebras of varieties
- Automorphisms of endomorphism semigroups of reflexive digraphs
- Automorphisms of normal partial transformation semigroups
- Automorphisms of normal transformation semigroups
- Automorphisms of the endomorphism semigroup of a free monoid or a free semigroup
- Automorphisms of transformation semigroups
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Dense relations are determined by their endomorphism monoids.
- Lattice Theory of Generalized Partitions
- Multicolored lines in a finite geometry
- Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- On definability of hypergraphs by their semigroups of homomorphisms
- On groups associated with transformation semigroups
- On the inner automorphisms of finite transformation semigroups
- Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups
- Packing nearly-disjoint sets
- Semigroup structures for families of functions, I. Some Homomorphism Theorems
- Semigroups and rings of endomorphisms of linear spaces. I
- Semigroups of mappings on graphs
- Subsets of a finite set that intersect each other in at most one element
- The chromatic index of simple hypergraphs
Cited in
(10)- Computing automorphisms of semigroups.
- Automorphisms of Endomorphism Monoids of 1-Simple Free Algebras
- Endomorphisms of some groupoids of order \(k+k^2\)
- The classification of partition homogeneous groups with applications to semigroup theory
- Directed graphs of inner translations of semigroups
- The monoid of holomorphic endomorphisms of a group and its automorphisms.
- Orbits of primitive \(k\)-homogeneous groups on \((n-k)\)-partitions with applications to semigroups
- The largest subsemilattices of the endomorphism monoid of an independence algebra.
- Centralizers in the full transformation semigroup.
- Automorphism groups of circulant digraphs with applications to semigroup theory
This page was built for publication: A method of finding automorphism groups of endomorphism monoids of relational systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879337)
