English
Related papers

Related papers: Random Burnside Groups

200 papers

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

Group Theory · Mathematics 2023-09-11 Junho Peter Whang

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Dynamical Systems · Mathematics 2026-01-21 Ioannis Kousek

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

Group Theory · Mathematics 2015-04-07 Danny Calegari

We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…

Group Theory · Mathematics 2007-05-23 D. V. Osin

Let $q$ be a prime. Let $G$ be a residually finite group satisfying an identity. Suppose that for every $x \in G$ there exists a $q$-power $m=m(x)$ such that the element $x^m$ is a bounded Engel element. We prove that $G$ is locally…

Group Theory · Mathematics 2020-03-16 Raimundo Bastos , Danilo Silveira

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

Group Theory · Mathematics 2024-08-13 Sobhi Massalha

We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…

Group Theory · Mathematics 2009-09-13 Mark Sapir , Iva Spakulova

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

Group Theory · Mathematics 2025-06-03 Andrea Lucchini , Patricia Medina Capilla

We show that an accessible group with infinitely many ends has property $R_{\infty}$. That is, it has infinitely many twisted conjugacy classes for any twisting automorphism. We deduce that having property $R_{\infty}$ is undecidable…

Group Theory · Mathematics 2026-03-02 Francesco Fournier-Facio , Harry Iveson , Armando Martino , Wagner Sgobbi , Peter Wong

Let $m,n$ be positive integers. Suppose that $G$ is a residually finite group in which for every element $x \in G$ there exists a positive integer $q=q(x) \leqslant m$ such that $x^q$ is $n$-Engel. We show that $G$ is locally virtually…

Group Theory · Mathematics 2016-09-06 Raimundo Bastos

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Group Theory · Mathematics 2007-05-23 Seymour Bachmuth

We show that for any positive integer $m\ge 1$, $m$-relator quotients of the modular group $M = PSL(2,\mathbb{Z})$ generically satisfy a very strong Mostow-type \emph{isomorphism rigidity}. We also prove that such quotients are generically…

Group Theory · Mathematics 2011-06-03 Ilya Kapovich , Paul Schupp

The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of…

Formal Languages and Automata Theory · Computer Science 2016-04-13 Thibault Godin , Ines Klimann

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

Logic · Mathematics 2015-03-17 Predrag Tanović

We prove Bogolyubov-Ruzsa-type results for finite subsets of groups with small tripling, $|A^3|\leq O(|A|)$, or small alternation, $|AA^{\text{-}1} A|\leq O(|A|)$. As applications, we obtain a qualitative analog of Bogolyubov's Lemma for…

Combinatorics · Mathematics 2022-03-08 Gabriel Conant

We prove that random groups in the Gromov density model at density d <1/4 do not have Property (T), answering a conjecture of Przytycki. We also prove similar results in the k-angular model of random groups.

Group Theory · Mathematics 2022-06-30 Calum J Ashcroft

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

Number Theory · Mathematics 2022-02-10 Jose Arnaldo Bebita Dris

We prove that for any automorphism $\phi$ of the restricted wreath product $\mathbb{Z}_2 \mathrm{wr} \mathbb{Z}^k$ and $\mathbb{Z}_3 \mathrm{wr} \mathbb{Z}^{2d}$ the Reidemeister number $R(\phi)$ is infinite, i.e. these groups have the…

Group Theory · Mathematics 2017-11-28 Evgenij Troitsky

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

Group Theory · Mathematics 2017-03-29 Matthew Cordes , Moon Duchin , Yen Duong , Meng-Che Ho , Andrew P. Sánchez