SearcharxivSearch

arXiv · 2508.13056

Some generalizations of Camina pairs and orders of elements in cosets

Abstract

In this paper, we investigate certain generalizations of Camina pairs. Let $H$ be a nontrivial proper subgroup of a finite group $G$. We first show that every nontrivial irreducible complex character of $H$ induces homogeneously to $G$ if and only if for every $x\in G\setminus H$, the element $x$ is conjugate to $xh$ for all $h\in H$. Furthermore we prove that if $xh$ is conjugate to either $x$ or $x^{-1}$ for all $h\in H$ and all $x\in G\setminus H$, then the normal closure $N$ of $H$ in $G$ also satisfies the same condition, and $N$ is nilpotent. Finally, we determine the structure of $H$ under the assumption that for every element $x\in G\setminus H$ of odd order, the coset $xH$ consists entirely of elements of odd order.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thu T. H. Quan, Hung P. Tong-Viet. 2025-08-18. Some generalizations of Camina pairs and orders of elements in cosets. https://arxiv.org/abs/2508.13056

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