Related papers: Finite Semihypergroups Built From Groups
This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
In this paper is proved that the group of automorphisms of semigroup End(P[X]), if P is algebraically closed field, is generated by semi-inner automorphisms.
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
A complex Lie supergroup can be described as a real Lie supergroup with integrable almost complex structure. The necessary and sufficient conditions on an almost complex structure on a real Lie supergroup for defining a complex Lie…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…
In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.
We study the structure of discrete subgroups of the group $G[[r]]$ of complex formal power series under the operation of composition of series. In particular, we prove that every finitely generated fully residually free group is embeddable…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
A finite group $G$ is called an F-group if for every $x, y \in G \setminus Z(G)$, $C(x) \leq C(y)$ implies that $C(x) = C(y)$. On the otherhand, two elements of a group are said to be $z$-equivalent or in the same $z$-class if their…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…
We construct the first examples of residually finite non-exact groups. The construction is based on author's earlier construction of groups containing isometrically expanders using a graphical small cancellation.