Abdelmalek Abdesselam, Bernhard Heim, Markus Neuhauser
{"title":"Bessenrodt–Ono Inequalities for \\(\\ell \\)-Tuples of Pairwise Commuting Permutations","authors":"Abdelmalek Abdesselam, Bernhard Heim, Markus Neuhauser","doi":"10.1007/s00026-025-00767-w","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(S_n\\)</span> denote the symmetric group. We consider </p><div><div><span>$$\\begin{aligned} N_{\\ell }(n):= \\frac{\\left| \\textrm{Hom}\\left( {\\mathbb {Z}}^{\\ell },S_n\\right) \\right| }{n!} \\end{aligned}$$</span></div></div><p>which also counts the number of <span>\\(\\ell \\)</span>-tuples <span>\\(\\pi =\\left( \\pi _1, \\ldots , \\pi _{\\ell }\\right) \\in S_n^{\\ell }\\)</span> with <span>\\(\\pi _i \\pi _j = \\pi _j \\pi _i\\)</span> for <span>\\(1 \\le i,j \\le \\ell \\)</span> scaled by <i>n</i>!. A recursion formula, generating function, and Euler product have been discovered by Dey, Wohlfahrt, Bryan and Fulman, and White. Let <span>\\(a,b, \\ell \\ge 2.\\)</span> It is known by Bringmann, Franke, and Heim, that the Bessenrodt–Ono inequality </p><div><div><span>$$\\begin{aligned} \\Delta _{a,b}^{\\ell }:= N_{\\ell }(a) \\, N_{\\ell }(b) - N_{\\ell }(a+b) >0 \\end{aligned}$$</span></div></div><p>is valid for <span>\\(a,b \\gg 1\\)</span> and by Bessenrodt and Ono that it is valid for <span>\\(\\ell =2\\)</span> and <span>\\(a+b >9.\\)</span> In this paper, we prove that for each pair (<i>a</i>, <i>b</i>) the sign of <span>\\(\\{\\Delta _{a,b}^{\\ell } \\}_{\\ell }\\)</span> is getting stable. In each case we provide an explicit bound. The numbers <span>\\(N_{\\ell }\\left( n\\right) \\)</span> had been identified by Bryan and Fulman as the <i>n</i>th orbifold characteristics, generalizing work by Macdonald and Hirzebruch–Höfer concerning the ordinary and string-theoretic Euler characteristics of symmetric products, where <span>\\(N_2(n)=p(n) \\)</span> represents the partition function.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"30 2","pages":"553 - 573"},"PeriodicalIF":0.8000,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-025-00767-w.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-025-00767-w","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Let \(S_n\) denote the symmetric group. We consider
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 \le i,j \le \ell \) scaled by n!. A recursion formula, generating function, and Euler product have been discovered by Dey, Wohlfahrt, Bryan and Fulman, and White. Let \(a,b, \ell \ge 2.\) It is known by Bringmann, Franke, and Heim, that the Bessenrodt–Ono inequality
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 nth orbifold characteristics, generalizing work by Macdonald and Hirzebruch–Höfer concerning the ordinary and string-theoretic Euler characteristics of symmetric products, where \(N_2(n)=p(n) \) represents the partition function.
期刊介绍:
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches