SearcharxivSearch

arXiv · 2606.03616

Fractal anti-tori

Abstract

Let $\Gamma$ be a group acting properly and cocompactly on the product of two trees $T_1$ and $T_2$. An anti-torus is a non-periodic flat plane in $T_1 \times T_2$ that is the convex hull of two secant periodic lines. That notion was introduced by Dani Wise as a tool to show that $\Gamma$ is irreducible. We establish a new criterion ensuring the existence of anti-tori, and use it to prove that if $\Gamma$ is an $S$-arithmetic lattice in a product of simple algebraic groups of rank one, then $T_1\times T_2$ contains anti-tori. As a byproduct, we obtain a sufficient condition ensuring that a group defined by a bi-reversible automaton contains non-abelian free sub-semigroups. We also introduce a new class of irreducible lattices acting regularly on the vertex set of a product of two trees, and containing anti-tori that are fractal aperiodic tilings of the plane. This establishes a connection between lattices in products of trees and substitution tilings.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre-Emmanuel Caprace, Justin Vast. 2026-06-02. Fractal anti-tori. https://arxiv.org/abs/2606.03616

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