SearcharxivSearch

arXiv · 2603.18183

Around Gromov's injectivity lemma and applications to post-injunctive groups

Abstract

Gottschalk's surjunctivity conjecture states that for all group universes and finite alphabets, every equivariant and continuous selfmap of the full shift, known as cellular automaton, cannot be a strict embedding. Not all surjective cellular automata are injective. However, if the surjectivity condition is replaced by a certain strengthened property called post-surjectivity then all post-surjective cellular automata must be bijective whenever the universe is a sofic group. A group universe is said to be post-injunctive if every post-surjective cellular automaton with finite alphabet over this group universe must be bijective. Gromov's injectivity lemma states each injective cellular automaton over a subshift can be extended to an injective cellular automaton over every subshift which is close enough to the initial subshift. In this paper, we obtain analogous results where injectivity is replaced by other fundamental dynamical properties namely post-surjectivity and pre-injectivity. We also study various stable properties of the class of post-injunctive groups in parallel to properties of surjunctive groups. Among the results, we show that semidirect extensions of post-injunctive groups with residually finite kernels must be post-injunctive.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuan Kien Phung. 2026-03-18. Around Gromov's injectivity lemma and applications to post-injunctive groups. https://arxiv.org/abs/2603.18183

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR