SearcharxivSearch

arXiv · 2505.08887

Minimal Product Set in Non-Abelian Metacyclic Groups of Even Order

Abstract

Given a finite group $G$ and positive integers $r$ and $s$, a problem of interest in algebra is determining the minimum cardinality of the product set $AB$, where $A$ and $B$ are subsets of $G$ such that $|A|=r$ and $|B|=s$. This problem has been solved for the class of abelian groups; however, it remains open for finite non-abelian groups. In this paper, we prove that the result obtained for abelian groups can be extended to the class of metacyclic groups $K_{m,n}=\left\langle a,b \ : \ a^m=1,b^{2n}=a^g,bab^{-1}=a^{-1}\right\rangle$. Consequently, we provide a new proof of the result for the dihedral group $D_n$ and dicylic group $Q_{4n}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fernando Andres Benavides, Wilson Fernando Mutis. 2025-05-13. Minimal Product Set in Non-Abelian Metacyclic Groups of Even Order. https://arxiv.org/abs/2505.08887

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