In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [23] known for this problem. We solve a more general problem of computing the orders o...

Sets with a self-distributive operation (in the sense of ( ◃ b ) c = ), in particular quandles, appear knot and braid theories, Hopf algebra classification, study Yang–Baxter equation, other areas. An important invariant quandles is their structure group. The group finite quandle known to be either “boring” (free abelian), or “interesting” (non-abelian torsion). In this paper we explicitly desc...

Using covering graph techniques, a structural result about connected cubic simple graphs admitting an edge-transitive solvable group of automorphisms is proved. This implies, among other, that every such graph can be obtained from either the 3-dipole Dip3 or the complete graph K4, by a sequence of elementary-abelian covers. Another consequence of the main structural result is that the action of...

A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said to be Abelian if for every term t(x, ȳ) and for all elements a, b, c̄, d̄, we have the following implication: t(a, c̄) = t(a, d̄) −→ t(b, c̄) = t(b, d̄). It is shown that every finite simple Abelian universal algebra is strictly simple. This generalizes a well known fact about Ab...

We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R n-trees. We first prove that Sela's limit groups do have a free action on an R n-tree. We then prove that a finitely generated group having a free action on an R n-tree can be obtained from free abelian groups and surface groups by a finite sequence of free products and amalgamations over cyclic ...

We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R n-trees. We first prove that Sela's limit groups do have a free action on an R n-tree. We then prove that a finitely generated group having a free action on an R n-tree can be obtained from free abelian groups and surface groups by a finite sequence of free products and amalgamations over cyclic ...