English
Related papers

Related papers: The anabelian restricted Burnside problem

200 papers

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

Group Theory · Mathematics 2023-08-11 Gil Goffer , Be'eri Greenfeld

Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…

Group Theory · Mathematics 2015-09-16 Alexander Bors

A classical problem, raised by Fuchs in 1960, asks to classify the abelian groups which are groups of units of some rings. In this paper, we consider the case of finitely generated abelian groups, solving Fuchs' problem for such group with…

Commutative Algebra · Mathematics 2024-06-04 I. Del Corso , L. Stefanello

We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…

Group Theory · Mathematics 2026-04-30 Gil Goffer , Be'eri Greenfeld , Alexander Yu. Olshanskii

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Group Theory · Mathematics 2025-05-05 Martina Conte , Jan Moritz Petschick

Given a finite group $G$, we denote by $\psi\,'(G)$ the product of element orders of $G$. Our main result proves that the restriction of $\psi\,'$ to abelian $p$-groups of order $p^n$ is strictly increasing with respect to a natural order…

Group Theory · Mathematics 2018-05-24 Marius Tărnăuceanu

We obtain an explicit description of the endomorphisms of free-abelian by free groups together with a characterization of when they are injective and surjective. As a consequence we see that free-abelian by free groups are Hopfian and not…

Group Theory · Mathematics 2024-01-17 André Carvalho , Jordi Delgado

Let $w=w(x_1,...,x_n)$ be a word, i.e. an element of the free group $F = \langle x_1,...,x_n \rangle$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{ w(x_1,...,x_n) : x_1,...,x_n \in G \}$ of all…

Group Theory · Mathematics 2024-03-14 Francesca Lisi , Luca Sabatini

Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up…

Group Theory · Mathematics 2025-02-07 Andrea Lucchini , Luca Sabatini , Mima Stanojkovski

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

K-Theory and Homology · Mathematics 2017-05-24 Süleyman Kağan Samurkaş

Let $W,W'\subseteq G$ be nonempty subsets in an arbitrary group $G$. The set $W'$ is said to be a complement to $W$ if $WW'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. We show that, if $W$ is finite then every…

Combinatorics · Mathematics 2021-09-06 Arindam Biswas , Jyoti Prakash Saha

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

We prove that non-abelian free groups of finite rank at least 3 or of countable rank are not $\forall$-homogeneous. We answer three open questions from Kharlampovich, Myasnikov, and Sklinos regarding whether free groups, finitely generated…

Logic · Mathematics 2020-01-28 Olga Kharlampovich , Christopher Natoli

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

Number Theory · Mathematics 2013-05-14 Yahya ould Hamidoune , Susana C. Lopez , Alain Plagne

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Group Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Thomas W. Müller

We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism $\varphi$, an element $x\in G$ and a subset $K\subseteq G$, we say that the relative $\varphi$-order of $g$ in $K$,…

Group Theory · Mathematics 2023-06-23 André Carvalho

Given an abstract group $G$, we study the function $ab_n(G) := \sup_{|G:H| \leq n} |H/[H,H]|$. If $G$ has no abelian composition factors, then $ab_n(G)$ is bounded by a polynomial: as a consequence, we find a sharp upper bound for the…

Group Theory · Mathematics 2022-10-10 Luca Sabatini

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Group Theory · Mathematics 2017-05-01 Marius Tărnăuceanu , László Tóth

Answering a question of I. M. Isaacs, we show that the largest degree of irreducible complex representations of any finite non-abelian simple group can be bounded in terms of the smaller degrees. We also study the asymptotic behavior of…

Representation Theory · Mathematics 2014-02-26 Michael Larsen , Gunter Malle , Pham Huu Tiep

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

Group Theory · Mathematics 2025-02-14 Olga Kharlampovich , Alexei Miasnikov