SearcharxivSearch

arXiv · 2311.11165

Character groups of Metacyclic groups

Abstract

Pontryagin duality provides a powerful tool for analyzing the structure and properties of locally compact abelian groups, in particular finite abelian groups. Now much can be done with non-abelian groups via the construction of character groups. In this paper we provide a set of conditions a group must satisfy to be realized as a balanced character group for a metacyclic group. Furthermore we provide a classification for the balanced character groups of a particular class of metacyclic groups, the dicyclic groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Justin Stevenson. 2023-11-18. Character groups of Metacyclic groups. https://arxiv.org/abs/2311.11165

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