Related papers: Proving finitely presented groups are large by com…

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $\Gamma$ such that the automorphism group $\mathrm{Aut}(\Gamma)$ of $\Gamma$ satisfies the following properties:…

A finitely generated group $\G$ equipped with a word-length is said to satisfy property RD if there are $C, s\geq 0$ such that, for all non-negative integers $n$, we have $\|a\|\leq C (1+n)^s \|a\|_2$ whenever $a\in\C\G$ is supported on…

We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

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…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…

We prove that every finitely generated group $G$ discriminated by a locally quasi-convex torsion-free hyperbolic group $\Gamma$ is effectively coherent: that is, presentations for finitely generated subgroups can be computed from the…

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…

We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presentability of subdirect products of groups: if $\Gamma_1,...,\Gamma_n$ are finitely presented and $S<\Gamma_1\times...\times\Gamma_n$ projects…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…