Related papers: Embeddable partial groups

A semigroup amalgam (S; T1, T2) is known to be non-embeddable if T1 and T2 are both groups (completely regular semigroups, Clifford semigroups) but S is not such. We prove some non-embeddability conditions for semigroup amalgams (S; T1, T2)…

When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…

In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are…

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…

We show that the category of partial comodules over a Hopf algebra $H$ is comonadic over ${\sf Vect}_k$ and provide an explicit construction of this comonad using topological vector spaces. The case when $H$ is finite dimensional is treated…

Suppose that $Y_1,Y_2,Y_3$ are finite sets and $P\subseteq Y_1\times Y_2\times Y_3$. We say that $P$ embeds in a group $G$ if there exist injective maps $\phi_i\colon Y_i\rightarrow G$ for $i=1,2,3$ such that…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…

We prove a rigidity theorem for semi-arithmetic Fuchsian groups: If $\Gamma_1$, $\Gamma_2$ are two semi-arithmetic lattices in $\mathrm{PSL}(2,\mathbb{R})$ virtually admitting modular embeddings and $f\colon\Gamma_1\to\Gamma_2$ is a group…

There are many examples of `binary' partial groups in the literature: sets equipped an identity and a partially-defined binary operation, such that each element admits an inverse. We show that many of these may be regarded as partial groups…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We prove that every finitely presented self-similar group embeds in a finitely presented simple group. This establishes that every group embedding in a finitely presented self-similar group satisfies the Boone-Higman conjecture. The simple…

We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…