Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.00509

Profinite congruences and unary algebras

J. Almeida·O. Klíma
View original source ↗Read source document ↗Export metadata ↓

Abstract

Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra. On the other hand, closed congruences and fully invariant congruences can be described constructively. In a previous paper, we conjectured that fully invariant closed congruences on a relatively free profinite algebra are always profinite. Here, we show that our conjecture fails for unary algebras and that closed congruences on relatively free profinite semigroups are not necessarily profinite. As part of our study of unary algebras, we establish an adjunction between profinite unary algebras and profinite monoids. We also show that the Polish representation of the free profinite unary algebra is faithful.

Explore related subjects

math.GRcs.LO

Keep this discovery

BibTeXRIS

J. Almeida, O. Klíma. 2020-03-01. Profinite congruences and unary algebras. https://arxiv.org/abs/2003.00509

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗