English
Related papers

Related papers: Words with few values in finite simple groups

200 papers

We produce new short laws in two variables valid in finite groups of Lie type. Our result improves upon results of Kozma and the second named author, and is sharp up to logarithmic factors, for all families except possibly the Suzuki…

Group Theory · Mathematics 2022-10-06 Henry Bradford , Andreas Thom

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

Group Theory · Mathematics 2013-02-05 Lucas Sabalka , Dmytro Savchuk

We construct first examples of infinite groups having property (T) whose Kazhdan constants admit a lower bound independent of the choice of a finite generating set.

Group Theory · Mathematics 2007-05-23 D. Osin , D. Sonkin

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…

Combinatorics · Mathematics 2025-10-01 Pascal Ochem , Matthieu Rosenfeld

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

Group Theory · Mathematics 2017-11-15 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

Let Mod(S) denote the mapping class group of a compact, orientable surface S. We prove that finitely generated subgroups of Mod(S) which are not virtually abelian have uniform exponential growth with minimal growth rate bounded below by a…

Geometric Topology · Mathematics 2009-10-04 Johanna Mangahas

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

Group Theory · Mathematics 2011-07-11 Igor Lysenok , Alexei Myasnikov

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

Group Theory · Mathematics 2022-07-13 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

Logic · Mathematics 2011-12-20 James H. Schmerl

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Group Theory · Mathematics 2007-05-23 Alireza Abdollahi

We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…

Algebraic Geometry · Mathematics 2013-02-20 Tatiana Bandman , Shelly Garion , Boris Kunyavskii

We define a numerical quasi-isometry invariant of a finitely generated group, whose values parametrize the difference between the group being uniformly embeddable in a Hilbert space and the reduced C*-algebra of the group being exact.

Operator Algebras · Mathematics 2007-05-23 Erik Guentner , Jerome Kaminker

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

Formal Languages and Automata Theory · Computer Science 2017-09-06 Meng-Che "Turbo" Ho

We consider the fundamental group $\pi$ of a surface of finite type equipped with the infinite generating set consisting of all simple closed curves. We show that every nilpotent quotient of $\pi$ has finite diameter with respect to the…

Geometric Topology · Mathematics 2012-11-21 Khalid Bou Rabee , Asaf Hadari

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…

Formal Languages and Automata Theory · Computer Science 2026-04-20 Paul C. Bell , George Kenison , Reino Niskanen , Igor Potapov , Pavel Semukhin

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…

Rings and Algebras · Mathematics 2017-08-29 Be'eri Greenfeld

A fundamental notion in group theory, which originates in an article of Ulam and von Neumann from $1947$ is uniform simplicity. A group $G$ is said to be $n$-uniformly simple for $n \in \mathbf{N}$ if for every $f,g\in G\setminus \{id\}$,…

Group Theory · Mathematics 2026-01-23 James Hyde , Yash Lodha

We say that the weak width of an infinite subgroup $H$ of $G$ in $G$ is $n$ if there exists a collection of $n$ strongly essentially distinct conjugates $\{ H, g_1^{-1} H g_1,\cdots, g_{n-1}^{-1} H g_{n-1} \}$ of $H$ in $G$ such that the…

Group Theory · Mathematics 2016-01-01 Rita Gitik

We construct a boundary of a finite rank free group relative to a finite list of conjugacy classes of maximal cyclic subgroups. From the cut points and uncrossed cut pairs of this boundary we construct a simplicial tree on which the group…

Group Theory · Mathematics 2016-05-04 Christopher H. Cashen