SearcharxivSearch

arXiv · 1804.08004

Profinite topologies

Abstract

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of Boolean algebras of regular languages. The additional structure is given by a compact zero-dimensional topology. Profinite topologies may also be considered on arbitrary abstract semigroups by taking the initial topology for homomorphisms into finite semigroups. This text is the proposed chapter of the Handdbook of Automata Theory dedicated to these topics. The general theory is formulated in the setting of universal algebra because it is mostly independent of specific properties of semigroups and more general algebras naturally appear in this context. In the case of semigroups, particular attention is devoted to solvability of systems of equations with respect to a pseudovariety, which is relevant for solving membership problems for pseudovarieties. Focus is also given to relatively free profinite semigroups per se, specially "large" ones, stressing connections with symbolic dynamics that bring light to their structure.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge Almeida, Alfredo Costa. 2018-04-21. Profinite topologies. https://arxiv.org/abs/1804.08004

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