2024/03/03 by Abdesselam, Abdelmalek, Heim, Bernhard, Neuhauser, Markus · 1 citation
#05A17 #11P82 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)
paper · doi:10.48550/arxiv.2403.01441
Let Sn denote the symmetric group of permutations acting on n elements. We investigate the double sequence \Nℓ(n)\ counting the number of ℓ tuples of elements of the symmetric group Sn, where the components commute, normalized by the order of Sn. Our focus lies on exploring log-concavity with respect to n: Nℓ(n)2 - Nℓ(n-1) Nℓ(n+1) ≥ 0. We establish that this depends on n \pmod3 for sufficiently large ℓ. These numbers are studied by Bryan and Fulman as the nth orbifold characteristics, generalizing work of Macdonald and Hirzebruch--Hofer concerning the ordinary and string-theoretic Euler characteristics of symmetric products. Notably, N2(n) represents the partition numbers p(n), while N3(n) represents the number of non-equivalent n-sheeted coverings of a torus studied by Liskovets and Medynkh. The numbers also appear in algebra since \vert Sn \vert Nℓ(n) = \vert Hom ( ℤℓ,Sn) \vert .