Hultman Numbers and Generalized Commuting Probability in Finite Groups
Abstract
Let G be a finite group and π be a permutation from Sn. We investigate the distribution of the probabilities of the equality \[ a1a2·s an-1an=aπ1aπ2·s aπn-1aπn \] when π varies over all the permutations in Sn. The probability \[ Prπ(G)=Pr(a1a2·s an-1an=aπ1aπ2·s aπn-1aπn) \] is identical to Pr1ω(G), with \[ ω=a1a2...an-1anaπ1-1aπ2-1·s aπn-1-1aπn-1, \] as it is defined in DasNath1 and NathDash1. The notion of commutativity degree, or the probability of a permutation equality a1a2=a2a1, for which n=2 and π=2\;\;1, was introduced and assessed by P. Erd\"os and P. Turan in ET in 1968 and by W. H. Gustafson in G in 1973. In G Gustafson establishes a relation between the probability of a1,a2∈ 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 BP. We describe the spectrum of the probabilities of permutation equalities in a finite group as π varies over all the elements of Sn. This spectrum turns-out to be closely related to the partition of n! into a sum of the corresponding Hultman numbers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.