Abstract

Let A(ℓ,n,k)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$A(\\ell ,n,k)$$\\end{document} denote the number of ℓ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\ell $$\\end{document}-tuples of commuting permutations of n elements whose permutation action results in exactly k orbits or connected components. We provide a new proof of an explicit formula for A(ℓ,n,k)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$A(\\ell ,n,k)$$\\end{document} which is essentially due to Bryan and Fulman, in their work on orbifold higher equivariant Euler characteristics. Our proof is self-contained, elementary, and relies on the construction of an explicit bijection, in order to perform the ℓ+1→ℓ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\ell +1\\rightarrow \\ell $$\\end{document} reduction. We also investigate a conjecture by the first author, regarding the log-concavity of A(ℓ,n,k)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$A(\\ell ,n,k)$$\\end{document} with respect to k. The conjecture generalizes a previous one by Heim and Neuhauser related to the Nekrasov-Okounkov formula.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call