SearcharxivSearch

arXiv · 1711.06735

Endomorphisms of regular rooted trees induced by the action of polynomials on the ring $\mathbb Z_d$ of $d$-adic integers

Abstract

We show that every polynomial in $\mathbb Z[x]$ defines an endomorphism of the $d$-ary rooted tree induced by its action on the ring $\mathbb Z_d$ of $d$-adic integers. The sections of this endomorphism also turn out to be induced by polynomials in $\mathbb Z[x]$ of the same degree. In the case of permutational polynomials acting on $\mathbb Z_d$ by bijections the induced endomorphisms are automorphisms of the tree. In the case of $\mathbb Z_2$ such polynomials were completely characterized by Rivest. As our main application we utilize the result of Rivest to derive the condition on the coefficients of a permutational polynomial $f(x)\in\mathbb Z[x]$ that is necessary and sufficient for $f$ to induce a level transitive automorphism of the binary tree, which is equivalent to the ergodicity of the action of $f(x)$ on $\mathbb Z_2$ with respect to the normalized Haar measure.

Explore related subjects

Keep this discovery

BibTeXRIS

Elsayed Ahmed, Dmytro Savchuk. 2017-11-17. Endomorphisms of regular rooted trees induced by the action of polynomials on the ring $\mathbb Z_d$ of $d$-adic integers. https://arxiv.org/abs/1711.06735

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