English

Bessenrodt--Ono inequalities for $\ell$-tuples of pairwise commuting permutations

Combinatorics 2024-09-10 v1 Number Theory

Abstract

Let SnS_n denote the symmetric group. We consider \begin{equation*} N_{\ell}(n) := \frac{\left\vert Hom\left( \mathbb{Z}^{\ell},S_n\right) \right\vert}{n!} \end{equation*} which also counts the number of \ell-tuples π=(π1,,π)Sn\pi=\left( \pi_1, \ldots, \pi_{\ell}\right) \in S_n^{\ell} with πiπj=πjπi\pi_i \pi_j = \pi_j \pi_i for 1i,j1 \leq i,j \leq \ell scaled by n!n!. A recursion formula, generating function, and Euler product have been discovered by Dey, Wohlfahrt, Bryman and Fulman, and White. Let a,b,2a,b, \ell \geq 2. It is known by Bringman, Franke, and Heim, that the Bessenrodt--Ono inequality \begin{equation*} \Delta_{a,b}^{\ell}:= N_{\ell}(a) \, N_{\ell}(b) - N_{\ell}(a+b) >0 \end{equation*} is valid for a,b1a,b \gg 1 and by Bessenrodt and Ono that it is valid for =2\ell =2 and a+b>9a+b >9. In this paper we prove that for each pair (a,b)(a,b) the sign of {Δa,b}\{\Delta_{a,b}^{\ell} \}_{\ell} is getting stable. In each case we provide an explicit bound. The numbers N(n)N_{\ell}\left( n\right) had been identified by Bryan and Fulman as the nn-th orbifold characteristics, generalizing work by Macdonald and Hirzebruch--H\"{o}fer concerning the ordinary and string-theoretic Euler characteristics of symmetric products, where N2(n)=p(n)N_2(n)=p(n) represents the partition function.

Keywords

Cite

@article{arxiv.2409.04881,
  title  = {Bessenrodt--Ono inequalities for $\ell$-tuples of pairwise commuting permutations},
  author = {Abdelmalek Abdesselam and Bernhard Heim and Markus Neuhauser},
  journal= {arXiv preprint arXiv:2409.04881},
  year   = {2024}
}