Related papers: Finding non-trivial elements and splittings in gro…

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…

We answer a conjecture of Bauer, Catanese and Grunewald showing that all finite simple groups other than the alternating group of degree 5 admit unmixed Beauville structures. We also consider an analog of the result for simple algebraic…

In this paper, we find some exotic fusion systems which have non-trivial strongly closed subgroups, and we prove these fusion systems are also not realizable by p-blocks of finite groups.

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with…

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Given a class $\mathcal{P}$ of groups we say that a group $G$ is fully residually $\mathcal{P}$ if for any finite subset $F$ of $G$, there exists an epimorphism from $G$ to a group in $\mathcal{P}$ which is injective on $F$. It is known…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…

We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…

Motivated by the difficulty in presenting computational results, especially when the results are a collection of atoms in a logical language, to users, who are not proficient in computer programming and/or the logical representation of the…

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We…

Let $G$ be a finite group and let $p$ be a prime. We continue the search for generic constructions of free products and free monoids in the unit group $\mathcal{U}(\mathbb{Z}G)$ of the integral group ring $\mathbb{Z}G$. For a nilpotent…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…