Related papers: On the Number of Hamiltonian Groups

For every finite abelian group $G$, there are positive integers $n$ and $d$ such that $G$ is isomorphic to the multiplicative group of $d$-th powers of reduced residues modulo $n$.

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

In this short note, we describe the finite groups $G$ having $|G|-1$ cyclic subgroups. This leads to a nice characterization of the symmetric group $S_3$.

The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…

Hougthon's groups H_n is a family of groups where each H_n consists of `translations at infinity' on n rays of discrete points emanating from the origin on the plane. Brown shows H_n has type FP_n-1 but not FP_n by constructing infinite…

Using already known resuls concerning the structure of (normal) subgroups of a $U_{6n}$ group we provide a dynamical programming algoritm for counting the number of all (normal) fuzzy subgroups of $U_{6n}$ with respect to M.…

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

The target of this article is to discuss the concept of \textit{commuting probability} of finite groups which, in short, is a probabilistic measure of how abelian our group is. We shall compute the value of commuting probability for many…

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

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)$…

In the paper new criteria of existence and conjugacy of Hall subgroups of finite groups are given.

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

In this paper, we summarize the work on the characterization of finite simple groups and the study on finite groups with the set of element orders and two orders (the order of group and the set of element orders). Some related topics, and…

We find all finite Ockham algebras that admit only finitely many compatible relations (modulo a natural equivalence). Up to isomorphism and symmetry, these Ockham algebras form two countably infinite families: one family consists of the…

Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

A countable band $B$ is called homogeneous if every isomorphism between finitely generated subbands extends to an automorphism of $B$. In this paper we give a complete classification of all the homogeneous bands. We prove that a homogeneous…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

We study a family of finitely generated residually finite groups. These groups are doubles $F_2*_H F_2$ of a rank-$2$ free group $F_2$ along an infinitely generated subgroup $H$. Varying $H$ yields uncountably many groups up to isomorphism.

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…