Bessenrodt--Ono inequalities for $\ell$-tuples of pairwise commuting permutations
Abdelmalek Abdesselam, Bernhard Heim, Markus Neuhauser

TL;DR
This paper studies inequalities related to the number of commuting $ ext{S}_n$-tuples, proving stability of the sign of these inequalities across different parameters and providing explicit bounds.
Contribution
It establishes the stability of the sign of Bessenrodt--Ono inequalities for all $ ext{S}_n$-tuples with explicit bounds, extending previous results.
Findings
The sign of $\Delta_{a,b}^{\ell}$ stabilizes as $\ell$ varies.
Explicit bounds are provided for the stability of inequalities.
Connections to orbifold characteristics and Euler characteristics are discussed.
Abstract
Let 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 -tuples with for scaled by . A recursion formula, generating function, and Euler product have been discovered by Dey, Wohlfahrt, Bryman and Fulman, and White. Let . 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 and by Bessenrodt and Ono that it is valid for and . In this paper we prove that for each pair the sign of is getting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Analytic Number Theory Research
