On Congruence Permutable G-sets
classification
🧮 math.GR
keywords
alphabetacirccongruencearbitrarypermutablesemigroupalgebraic
read the original abstract
An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For an arbitrary $G$-set $X$ with $G\cap X=\emptyset$, we define a semigroup $(G,X,0)$ with a zero $0$ ($0\notin G\cup X$), and give necessary and sufficient conditions for the congruence permutability of the $G$-set $X$ by the help of the semigroup $(G,X,0)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.