SearcharxivSearch

arXiv · 1412.5221

Construction of infinite finitely presented nilsemigroup

Abstract

The paper deals with the solution of Shevrin ans Sapir problem. Infinite finitely presented nilsemigroup is constructed. The construction is based on aperiodic tilings, Goodman-Strauss type theorems on uniformly elliptic space. Space is called {\it uniformly elliptic} iff there is universal constant $\lambda>0$ such that any two points $A$ and $B$ on distant $D$ can be joined by family of geodesic lines generating a disc of wideness $\lambda\cdot D$. Research was supported by the grant RFBR N 14-01-00548

Explore related subjects

Keep this discovery

BibTeXRIS

Ilya Ivanov-Pogodaev, Alexey Kanel-Belov. 2014-12-16. Construction of infinite finitely presented nilsemigroup. https://arxiv.org/abs/1412.5221

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