SearcharxivSearch

arXiv · 1605.05939

Formal-dual subsets of cyclic groups of prime power order

Abstract

We study the notion of formal-duality over finite cyclic groups of prime power order as introduced by Cohn, Kumar, Reiher and Schürmann. We will prove that for any cyclic group of odd prime power order, as well as for any cyclic group of order $2^{2l+1}$, there is no primitive pair of formally-dual subsets. This partially proves a conjecture, made by the priorly mentioned authors, that the only cyclic groups with a pair of primitive formally-dual subsets are $\{0\}$ and $\mathbb{Z}/4\mathbb{Z}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Schüler. 2016-05-19. Formal-dual subsets of cyclic groups of prime power order. https://doi.org/10.1007/s13366-017-0337-7

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