SearcharxivSearch

arXiv · 1403.3868

Hultman Numbers and Generalized Commuting Probability in Finite Groups

Abstract

Let $G$ be a finite group and $π$ be a permutation from $S_{n}$. We investigate the distribution of the probabilities of the equality \[ a_{1}a_{2}\cdots a_{n-1}a_{n}=a_{π_{1}}a_{π_{2}}\cdots a_{π_{n-1}}a_{π_{n}} \] when $π$ varies over all the permutations in $S_{n}$. The probability \[ Pr_π(G)=Pr(a_{1}a_{2}\cdots a_{n-1}a_{n}=a_{π_{1}}a_{π_{2}}\cdots a_{π_{n-1}}a_{π_{n}}) \] is identical to $Pr_{1}^ω(G)$, with \[ ω=a_{1}a_{2}...a_{n-1}a_{n}a_{π_{1}}^{-1}a_{π_{2}}^{-1}\cdots a_{π_{n-1}}^{-1}a_{π_{n}}^{-1}, \] as it is defined in \cite{DasNath1} and \cite{NathDash1}. The notion of commutativity degree, or the probability of a permutation equality $a_{1}a_{2}=a_{2}a_{1}$, for which $n=2$ and $π=\langle2\;\;1\rangle$, was introduced and assessed by P. Erdös and P. Turan in \cite{ET} in 1968 and by W. H. Gustafson in \cite{G} in 1973. In \cite{G} Gustafson establishes a relation between the probability of $a_{1},a_{2}\in G$ commuting and the number of conjugacy classes in $G$. In this work we define several other parameters, which depend only on a certain interplay between the conjugacy classes of $G$, and compute the probabilities of general permutation equalities in terms of these parameters. It turns out that this probability, for a permutation $π$, depends only on the number $c(Gr(π))$ of the alternating cycles in the cycle graph $Gr(π)$ of $π$. The cycle graph of a permutation was introduced by V. Bafna and P. A. Pevzner in \cite{BP}. We describe the spectrum of the probabilities of permutation equalities in a finite group as $π$ varies over all the elements of $S_{n}$. This spectrum turns-out to be closely related to the partition of $n!$ into a sum of the corresponding Hultman numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz. 2014-10-02. Hultman Numbers and Generalized Commuting Probability in Finite Groups. https://arxiv.org/abs/1403.3868

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