Related papers: Coset enumeration for certain infinitely presented…
Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\rm Isolated}(G)$ the set of isolated subgroups of $G$. In this note, we describe finite groups $G$ such that $|{\rm Isolated}(G)|=|L(G)|-k$, where…
We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore,…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…
We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…
We prove that every finitely presented self-similar group embeds in a finitely presented simple group. This establishes that every group embedding in a finitely presented self-similar group satisfies the Boone-Higman conjecture. The simple…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
Recently, we have introduced and studied the topic of sub-indices and sub-factors of groups. During those studies, an algorithm for obtaining the sub-factors of a finite group was stated and proved, which has a particular case for…
We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a…
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…