相关论文: Diassociativity in Conjugacy Closed Loops

Every finite group whose order is divisible by a prime $p$ has at least $2 \sqrt{p-1}$ conjugacy classes.

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that…

It is proved that the following conditions are equivalent for an infinite non-associative commutative Moufang loop $Q$: 1) $Q$ satisfies the minimum condition for subloops; 2) if the loop $Q$ contains a centrally solvable subloop of class…

Let $G$ be a finite group and $A$ be a normal subgroup of $G$. We denote by $ncc(A)$ the number of $G$-conjugacy classes of $A$ and $A$ is called $n$-decomposable, if $ncc(A)=n$. Set ${\cal K}_G = \{ncc(A)| A \lhd G \}$. Let $X$ be a…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

We say that $(x,y,z)\in Q^3$ is an associative triple in a quasigroup $Q(*)$ if $(x*y)*z=x*(y*z)$. Let $a(Q)$ denote the number of associative triples in $Q$. It is easy to show that $a(Q)\ge |Q|$, and we call the quasigroup maximally…

For $p$ a prime, $G$ a finite group and $A$ a normal subset of elements of order $p$, we prove that if $A^2 = \{ab \mid a, b \in A\}$ consists of $p$-elements then $Q = \langle A \rangle$ is soluble. Further, if $O_p(G) = 1$, we show that…

For a finite loop $Q$, let $P (Q)$ be the set of elements that can be represented as a product containing each element of $Q$ precisely once. Motivated by the recent proof of the Hall-Paige conjecture, we prove several universal…

Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…

Let $p>q$ be odd primes. We classify Bol loops and Bruck loops of order $pq$ up to isotopism. When $q$ does not divide $p^2-1$, the only Bol loop (and hence the only Bruck loop) of order $pq$ is the cyclic group of order $pq$. When $q$…

Let G be a connected reductive group over an algebraically closed field. We define a decomposition of G into finitely many strata such that each stratum is a union of conjugacy classes of fixed dimension; the strata are indexed by a set…

Although little can be gleaned about a loop with the property that its squares are, say, left nuclear ($xx\cdot yz = (xx\cdot y)z$), if its squares are also, say, middle nuclear ($(x\cdot yy)z = x(yy\cdot z)$), then the loop exhibits more…

Finite groups are of the greatest importance in science. Loops are a simple generalization of finite groups: they share all the group axioms except for the requirement that the binary operation be associative. The least loops that are not…

We classify the conjugacy classes of p-cycles of type D in alternating groups. This finishes the open cases in arXiv:0812.4628. We also determine all the subracks of those conjugacy classes which are not of type D.

Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this…

Two constructions due to Dr\'apal produce a group by modifying exactly one quarter of the Cayley table of another group. We present these constructions in a compact way, and generalize them to Moufang loops, using loop extensions. Both…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

We use groups with triality to construct a series of nonassociative Moufang loops. Certain members of this series contain an abelian normal subloop with the corresponding quotient being a cyclic group. In particular, we give a new series of…