Related papers: Generation of finite groups with cyclic Sylow subg…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

The classification of finite groups under monoidal equivalence is a fundamental topic in the study of finite quantum groups. While a complete classification has been established for all groups of order strictly less than 64, the case for…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

In order to induce a family of mixing patterns of leptons which accommodate the experimental data with a simple mathematical construct, we construct a novel object from the hybrid of two elements of a finite group with a parameter $\theta$.…

We define a family of groups that include the mapping class group of a genus g surface with one boundary component and the integral symplectic group Sp(2g,Z). We then prove that these groups are finitely generated. These groups, which we…

In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…

We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

A p-local finite group is an algebraic structure with a classifying space which has many of the properties of p-completed classifying spaces of finite groups. In this paper, we construct a family of 2-local finite groups, which are exotic…

We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum…

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

In recent work, Pomerance and Shparlinski have obtained results on the number of cycles in the functional graph of the map $x \mapsto x^a$ in $\mathbb{F}_p^*$. We prove similar results for other families of finite groups. In particular, we…

A general sieve method for groups is formulated. It enables one to "measure" subsets of a finitely generated group. As an application we show that if $\Gamma$ is a finitely generated non virtually-solvable linear group of characteristic…

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

We prove the conjugacy of Sylow $p$-subgroups of linear pseudofinite groups under the assumption of the existence of a finite Sylow $p$-subgroup. We also give an example of a linear pseudofinite group with non-conjugate Sylow $2$-subgroups.