SearcharxivSearch

arXiv · 2103.13135

Homomorphic encoders of profinite abelian groups I

Abstract

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there exists $c_1\in G$ satisfying that $c_{1|[1,i]}=c_{|[1,i]}$, $supp (c_1)\subseteq [1,n_i]$, and order$(c_1)$ divides order$(c_{|[1,n_i]})$. In this paper we investigate the structure of order controllable subgroups. It is proved that every order controllable, profinite, abelian group contains a subset $\{g_n : n\in\N\}$ that topologically generates the group and whose elements $g_n$ all have finite support. As a consequence, sufficient conditions are obtained that allow us to encode, by means of a topological group isomorphism, order controllable profinite abelian groups. Some applications of these results to group codes will appear subsequently \cite{FH:2021}.

Explore related subjects

Keep this discovery

BibTeXRIS

María V. Ferrer, Salvador Hernández. 2021-03-24. Homomorphic encoders of profinite abelian groups I. https://arxiv.org/abs/2103.13135

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