SearcharxivSearch

arXiv · 1409.2444

Subsemigroup, ideal and congruence growth of free semigroups

Abstract

Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is also shown that free semigroups have the fastest subsemigroup growth of all finitely generated semigroups. Ideal growth is shown to be exponential with strict type $2^n$ and congruence growth is shown to be at least exponential. In addition we consider the case when the index is fixed and rank increasing, proving that for subsemigroups and ideals this sequence fits a polynomial of degree the index, whereas for congruences this fits an exponential equation of base the index. We use these results to describe an algorithm for computing values of these sequences and give a table of results for low rank and index.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Bailey, Martin Finn-Sell, Robert Snocken. 2014-09-08. Subsemigroup, ideal and congruence growth of free semigroups. https://arxiv.org/abs/1409.2444

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