Related papers: Long relators in groups generated by two parabolic…
We prove that if a group possesses a deficiency 1 presentation where one of the relators is a commutator then it is the integers times the integers, is large, or is as far as possible from being residually finite. Then we use this to show…
We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$…
This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…
We prove that if $L=\mbox{}^2F_4(2^{2n+1})'$ and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the…
Retrieval-Augmented Generation (RAG) is the prevailing paradigm for grounding Large Language Models (LLMs), yet the mechanisms governing how models integrate groups of conflicting retrieved evidence remain opaque. Does an LLM answer a…
Retrieval-Augmented Generation (RAG) enables large language models (LLMs) to access external knowledge sources, but the effectiveness of RAG relies on the coordination between the retriever and the generator. Since these components are…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
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…
We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.
We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…
We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…
*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…
We introduce the notion of a bicollapsible 2-complex. This allows us to generalize the hyperbolicity of one-relator groups with torsion to a broader class of groups with presentations whose relators are proper powers. We also prove that…
In this paper we survey recent developments in the theory of groups acting on $\Lambda$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of…
In order to induce a family of mixing patterns of leptons which accommodate the experimental data with a simple mathematical construct, we construct a novel object from the hybrid of two elements of a finite group with a parameter $\theta$.…
Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…