Related papers: On Congruence Permutable $G$-sets

Let $S$ be a semigroup and $\mathbb F$ be a field. For an ideal $J$ of the semigroup algebra ${\mathbb F}[S]$ of $S$ over $\mathbb F$, let $\varrho _J$ denote the restriction (to $S$) of the congruence on ${\mathbb F}[S]$ defined by the…

A semigroup $S$ is called a permutable semigroup if $\alpha \circ \beta =\beta \circ \alpha$ is satified for all congruences $\alpha$ and $\beta$ of $S$. A semigroup is called a Putcha semigroup if it is a semilattice of archimedean…

Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial…

Let $\mathbb{F}G$ denote the group algebra of the group $G$ over the field $\mathbb{F}$ with $char(\mathbb{F})\neq 2$. Given both a homomorphism $\sigma:G\rightarrow \{\pm1\}$ and a group involution $\ast: G\rightarrow G$, an oriented…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…

Let $RG$ be the group ring of a finite group $G$ over a commutative ring $R$ with $1$. An element $x$ in $RG$ is said to be skew-symmetric with respect to an involution $\sigma$ of $RG$ if $\sigma(x)=-x.$ A structure theorem for the…

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by…

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(\alpha,\beta)$-regular if $C$ induces an $\alpha$-regular subgraph and every vertex outside $C$ is adjacent to exactly $\beta$ vertices in $C$. In particular, if $C$ is an…

A double magma is a nonempty set with two binary operations satisfying the interchange law. We call a double magma proper if the two operations are distinct and commutative if the operations are commutative. A double semigroup is a double…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…