Pith. sign in

REVIEW 2 cited by

On the spectrum of residual finiteness growth functions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.03556 v2 pith:HUWJSCLA submitted 2024-02-05 math.GR

classification math.GR
keywords functionfinitenessgrowthresidualbou-rabeefinitelygeneratedleast
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any prescribed function. In this note we describe a modified version of their construction, which allows us to give a complementary upper bound on $\mathcal{F}_G$. As such, every nondecreasing function at least $\exp ( n \log (n)^2 \log \log (n)^{1+\epsilon} )$ is close to the residual finiteness growth function of some finitely generated group. We also have similar result for the full residual finiteness growth function and for the divisibility function.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Characters of surface groups

    math.GR 2026-05 unverdicted novelty 8.0 of 10

    The trace space of any surface group is the Poulsen simplex.

  2. Groups with arbitrarily poor permutation stability

    math.GR 2026-04 unverdicted novelty 7.0 of 10

    Finitely generated groups exist that are permutation stable but exhibit arbitrarily bad quantitative stability, making sample-and-substitute algorithms very slow at checking relations.

Pith tools