Related papers: Hamiltonian Groups with Perfect Order Classes

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound…

Let $\chi(x)\in \mathbb{Z}[x]$ be a monic polynomial whose roots are distinct integers. We study the ideal class monoid and the ideal class group of the ring $\mathbb{Z}[x]/(\chi(x))$. We obtain formulas for the orders of these objects, and…

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 perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

An exact product of two finite groups $H$ and $K$ is a finite group $X$ which contains $H$ and $K$ as subgroups, satisfying $X=HK$ and $H\cap K=\{1_X\}$. In this paper, we provide a classification of the exact products of two dihedral…

A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generalization of Hamiltonian groups. In this paper, the properties of finite metahamiltonian $p$-groups are investigated.

Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…

In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.

We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…

We show that there is a class of finite groups, the so-called perfect groups, which cannot exhibit anomalies. This implies that all non-Abelian finite simple groups are anomaly-free. On the other hand, non-perfect groups generically suffer…

A topological group $G$ is {\em sequentially $h$-complete} if all the continuous homomorphic images of $G$ are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the…

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…

Let G be a group. Two elements x,y are said to be in the same z-class if their centralizers are conjugate in G. Let V be a vector space of dimension n over a field F of characteristic different from 2. Let B be a non-degenerate symmetric,…

Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…