Papers
Topics
Authors
Recent
Search
2000 character limit reached

Residual Finiteness Growth in Virtually Abelian Groups

Published 22 Sep 2023 in math.GR | (2309.12831v1)

Abstract: A group $G$ is called residually finite if for every non-trivial element $g \in G$, there exists a finite quotient $Q$ of $G$ such that the element $g$ is non-trivial in the quotient as well. Instead of just investigating whether a group satisfies this property, a new perspective is to quantify residual finiteness by studying the minimal size of the finite quotient $Q$ depending on the complexity of the element $g$, for example by using the word norm $|g|_G$ if the group $G$ is assumed to be finitely generated. The residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ is then defined as the smallest function such that if $|g|_G \leq r$, there exists a morphism $\varphi: G \to Q$ to a finite group $Q$ with $|Q| \leq \text{RF}_G(r)$ and $\varphi(g) \neq e_Q$. Although upper bounds have been established for several classes of groups, exact asymptotics for the function $\text{RF}_G$ are only known for very few groups such as abelian groups, the Grigorchuk group and certain arithmetic groups. In this paper, we show that the residual finiteness growth of virtually abelian groups equals $\logk$ for some $k \in \mathbb{N}$, where the value $k$ is given by an explicit expression. As an application, we show that for every $m \geq 1$ and every $1 \leq k \leq m$, there exists a group $G$ containing a normal abelian subgroup of rank $m$ and with $\text{RF}_G \approx \logk$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.