Bessenrodt--Ono inequalities for -tuples of pairwise commuting permutations

Abstract

Let Sn denote the symmetric group. We consider equation* N(n) := Hom( Z,Sn) n! equation* which also counts the number of -tuples π=( π1, …, π) ∈ Sn with πi πj = πj πi for 1 ≤ i,j ≤ scaled by n!. A recursion formula, generating function, and Euler product have been discovered by Dey, Wohlfahrt, Bryman and Fulman, and White. Let a,b, ≥ 2. It is known by Bringman, Franke, and Heim, that the Bessenrodt--Ono inequality equation* a,b:= N(a) \, N(b) - N(a+b) >0 equation* is valid for a,b 1 and by Bessenrodt and Ono that it is valid for =2 and a+b >9. In this paper we prove that for each pair (a,b) the sign of \a,b \ is getting stable. In each case we provide an explicit bound. The numbers N( n) had been identified by Bryan and Fulman as the n-th orbifold characteristics, generalizing work by Macdonald and Hirzebruch--H\"ofer concerning the ordinary and string-theoretic Euler characteristics of symmetric products, where N2(n)=p(n) represents the partition function.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…