Asymptotics of commuting -tuples in symmetric groups and log-concavity
Abstract
Denote by N(n) the number of -tuples of elements in the symmetric group Sn with commuting components, normalized by the order of Sn. In this paper, we prove asymptotic formulas for N(n). In addition, general criteria for log-concavity are shown, which can be applied to N(n) among other examples. Moreover, we obtain a Bessenrodt-Ono type theorem which gives an inequality of the form c(a)c(b) > c(a+b) for certain families of sequences c(n).
0
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.