Related papers: Long relators in groups generated by two parabolic…

It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If…

To ensure large language models (LLMs) are used safely, one must reduce their propensity to hallucinate or to generate unacceptable answers. A simple and often used strategy is to first let the LLM generate multiple hypotheses and then…

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,…

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 prove that every virtually free group $G$ has property (LR) of Long and Reid: each finitely generated subgroup of $G$ is a retract of a finite index subgroup. The main ingredient in the proof is a new embedding result stating that every…

Stafford proved that every left or right ideal of the Weyl algebra A_n(K) is generated by two elements. In this paper we prove that every left or right ideal of the ring of differential operators over the field of formal Laurent series…

We show that the intersection of the rational derived series of a one-relator group is rationally perfect and is normally generated by a single element. As a corollary, we characterise precisely when a one-relator group is residually…

Solving tabular math word problems (TMWPs) has become a critical role in evaluating the mathematical reasoning ability of large language models (LLMs), where large-scale TMWP samples are commonly required for LLM fine-tuning. Since the…

We prove that given a finite rank free group $\mathbb{F}$ of rank $\geq 3$ and two exponentially growing outer automorphisms $\psi$ and $\phi$ with dual lamination pairs $\Lambda^\pm_\psi$ and $\Lambda^\pm_\phi$ associated to them, and…

We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…

A hyperbolic-like group is a subgroup of $\operatorname{Homeo}_+(S^1)$ such that every non-trivial element has exactly two fixed points, one attracting and one repelling. We investigate the ping-pong dynamics of hyperbolic-like groups,…

Large language models (LLMs) have significantly transformed the educational landscape. As current plagiarism detection tools struggle to keep pace with LLMs' rapid advancements, the educational community faces the challenge of assessing…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

This is a survey of two papers joint with A. Borisov and a paper joint with I. Spakulova. It is based on my lectures at the conference "Groups St. Andrews 2009", Bath (August 2009). We prove that almost all 1-related groups with at least 3…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

Finite group theorists have established many formulas that express interesting properties of a finite group in terms of sums of characters of the group. An obstacle to applying these formulas is lack of control over the dimensions of…