Related papers: Applications of computational tools for finitely p…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…
Modeling of physical systems includes extensive use of software packages that implement the accurate finite element method for solving differential equations considered along with the appropriate initial and boundary conditions. When the…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…
In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…
The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…
A structure theorem is proved for strongly holonomic modules over a quantum torus (a crossed product of a field with a free abelian group in which the field is central). This can be applied to give a structure theorem for finitely presented…
For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
Groups that can be approximated by finite groups have been the center of much research. This has led to the investigations of the subgroups of metric ultraproducts of finite groups. This paper attempts to study the dual problem: what are…