Searcharxiv⌕ Search

arXiv · 2611.16279

On the reduction of GAP Conjecture to certain classes of groups and around

Abstract

In this note we revise our approach from [Rostislav Grigorchuk. On the gap conjecture concerning group growth. Bull. Math. Sci., 4(1):113--128, 2014] to the reduction of the Gap Conjecture on Group Growth to the class of just-infinite groups. For this purpose we introduce the class of groups that we call \emph{(GAPSY)} as well as some other classes. The properties of these classes are discussed in the relation with growth, elementary amenability, and just-infiniteness. Additionally, we discuss the GAP type problems for cancellative semigroups. A number of (old and new) open problems and few historical remarks is included in the note as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rostislav Grigorchuk. 2026-11-12. On the reduction of GAP Conjecture to certain classes of groups and around. https://searcharxiv.com/abs/2611.16279

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗