Relational systems with trivial endomorphisms and polymorphisms
From MaRDI portal
A finitary relation \(\rho\) and a finitary function \({\mathfrak f}\) on some set A are said to be compatible one with the other if \(\rho\) is a subalgebra of a suitable direct power of (A,\({\mathfrak f})\). In this paper properties for relational systems (A,Q) are derived in order to guarantee that every (finitary) function compatible with all relations of Q must be a projection or constant. The connection to interpolation properties is demonstrated and some open problems are stated.
Recommendations
- scientific article; zbMATH DE number 3946472
- Closure properties for relational systems with given endomorphism structure
- Relational systems with involution
- Equivalence systems with finitely many relations
- scientific article; zbMATH DE number 5978026
- Quotients and homomorphisms of relational systems
- Endolocality meets homomorphism-homogeneity: A new approach in the study of relational algebras
- Automorphisms and semi-automorphisms of relational systems
- Towards finite homomorphism-homogeneous relational structures
- On finite reflexive homomorphism-homogeneous binary relational systems
Cites work
- scientific article; zbMATH DE number 3650557 (Why is no real title available?)
- scientific article; zbMATH DE number 3677917 (Why is no real title available?)
- scientific article; zbMATH DE number 3710238 (Why is no real title available?)
- scientific article; zbMATH DE number 3775601 (Why is no real title available?)
- scientific article; zbMATH DE number 3561174 (Why is no real title available?)
- scientific article; zbMATH DE number 3603343 (Why is no real title available?)
- scientific article; zbMATH DE number 3614832 (Why is no real title available?)
- scientific article; zbMATH DE number 3443743 (Why is no real title available?)
- scientific article; zbMATH DE number 3240401 (Why is no real title available?)
- scientific article; zbMATH DE number 3307508 (Why is no real title available?)
- Strongly rigid relations
- Unary polynomials in algebras. I
Cited in
(17)- Universal algebras
- A projection property
- Perpendicular orders
- The number of orthogonal permutations
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- On the maximal number of non-\(C\)-endorigid equivalence relations
- Rigid relational systems: A general approach
- Semirigid sets of diamond orders
- Orthogonal countable linear orders
- Relations compatible with near unanimity operations
- scientific article; zbMATH DE number 3851095 (Why is no real title available?)
- All centralising monoids with majority witnesses on a four-element set
- Generalized quasiorders and the Galois connection End-gQuord
- The order on the rationals has an orthogonal order with the same order type
- The minimal closed monoids for the Galois connection \(\mathrm{End}\)-\(\mathrm{Con}\).
- Unary polynomials in algebras. I
- Weak orders admitting a perpendicular linear order
This page was built for publication: Relational systems with trivial endomorphisms and polymorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762526)