Table of Contents
Fetching ...

On a mod $3$ property of $\ell $-tuples of pairwise commuting permutations

Abdelmalek Abdesselam, Bernhard Heim, Markus Neuhauser

Abstract

Let $S_n$ denote the symmetric group of permutations acting on $n$ elements. We investigate the double sequence $\{N_{\ell}(n)\}$ counting the number of $\ell$ tuples of elements of the symmetric group $S_n$, where the components commute, normalized by the order of $S_n$. Our focus lies on exploring log-concavity with respect to $n$: $$ N_{\ell}(n)^2 - N_{\ell}(n-1) \,\, N_{\ell}(n+1) \geq 0.$$ We establish that this depends on $n \pmod{3}$ for sufficiently large $\ell$. These numbers are studied by Bryan and Fulman as the $n$th orbifold characteristics, generalizing work of Macdonald and Hirzebruch--Hofer concerning the ordinary and string-theoretic Euler characteristics of symmetric products. Notably, $N_2(n)$ represents the partition numbers $p(n)$, while $N_{3}(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 S_n \vert \,\, N_{\ell}(n) = \left\vert Hom \left( \mathbb{Z}^{\ell},S_n\right) \right\vert $.

On a mod $3$ property of $\ell $-tuples of pairwise commuting permutations

Abstract

Let denote the symmetric group of permutations acting on elements. We investigate the double sequence counting the number of tuples of elements of the symmetric group , where the components commute, normalized by the order of . Our focus lies on exploring log-concavity with respect to : We establish that this depends on for sufficiently large . These numbers are studied by Bryan and Fulman as the th orbifold characteristics, generalizing work of Macdonald and Hirzebruch--Hofer concerning the ordinary and string-theoretic Euler characteristics of symmetric products. Notably, represents the partition numbers , while represents the number of non-equivalent -sheeted coverings of a torus studied by Liskovets and Medynkh. The numbers also appear in algebra since .
Paper Structure (14 sections, 9 theorems, 37 equations, 6 tables)

This paper contains 14 sections, 9 theorems, 37 equations, 6 tables.

Key Result

Theorem 1.1

For $\ell \in \mathbb{N}$, we have where $P_n^{g_{\ell}}(x)$ is a polynomial of degree $n$ with $P_n^{g_{\ell}}(1)= N_{\ell}(n)$.

Theorems & Definitions (11)

  • Theorem 1.1: Bryan and Fulman, Theorem 2.1
  • Theorem 1.2
  • Corollary 1.3
  • Theorem 1.4
  • Corollary 1.5
  • Corollary 1.6
  • Lemma 2.1
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • ...and 1 more