Related papers: Algorithms determining finite simple images of fin…

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…

We construct an explicit infinite family of pairwise non-isomorphic infinite simple groups of type $\mathrm{F}_\infty$ (in particular, they are finitely presented) that act faithfully on the circle by orientation-preserving homeomorphisms,…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

We investigate whether a finitely generated profinite group G could have a finitely generated infinite image. A result of Dan Segal shows that this is impossible if G is prosoluble. We prove that such an image does not exist if G is…

The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed…

We construct a projective variety with discrete, non-finitely generated automorphism group. As an application, we show that there exists a complex projective variety with infinitely many non-isomorphic real forms.

We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…

The spectrum of a finite group is the set of its elements orders. Groups are said to be isospectral if their spectra coincide. For every finite simple exceptional group $L=E_7(q)$, we prove that each finite group isospectral to $L$ is…

We consider the natural Lie algebra structure on the (associative) group algebra of a finite group $G$, and show that the Lie subalgebras associated to natural involutive antiautomorphisms of this group algebra are reductive ones. We give a…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

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…