Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 7 Sep 2024 in math.CO and math.NT | (2409.04881v1)

Abstract: Let $S_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 $\pi=\left( \pi_1, \ldots, \pi_{\ell}\right) \in S_n{\ell}$ with $\pi_i \pi_j = \pi_j \pi_i$ for $1 \leq i,j \leq \ell$ 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, \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,b \gg 1$ and by Bessenrodt and Ono that it is valid for $\ell =2$ and $a+b >9$. In this paper we prove that for each pair $(a,b)$ the sign of ${\Delta_{a,b}{\ell} }{\ell}$ is getting stable. In each case we provide an explicit bound. The numbers $N{\ell}\left( n\right) $ had been identified by Bryan and Fulman as the $n$-th orbifold characteristics, generalizing work by Macdonald and Hirzebruch--H\"{o}fer concerning the ordinary and string-theoretic Euler characteristics of symmetric products, where $N_2(n)=p(n) $ represents the partition function.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.