Table of Contents
Fetching ...

Log-concavity with respect to the number of orbits for infinite tuples of commuting permutations

Abdelmalek Abdesselam

TL;DR

The paper investigates the log-concavity of the counts $A(p,n,k)$ of ordered commuting $p$-tuples of permutations of $[n]$ by the number of orbits $k$. It proves the conjectured log-concavity in the asymptotic regime $p\to\infty$ by deriving precise asymptotics $A(p,n,k)\sim F(n,k)\,E(n,k)^p$, where $E(n,k)$ is the maximal product of $k$ positive integers summing to $n$ and $F(n,k)$ is a computable multiplicative factor; crucially, $E(n,k)$ satisfies the log-concavity $E(n,k)^2\ge E(n,k-1)E(n,k+1)$. The analysis hinges on an explicit formula for $A(p,n,k)$ in terms of a function $B(p,n)$ and on identifying dominant terms in a sum over compositions, linking the growth rate to a generalized Turán number via $E(n,k)$. By combining these asymptotics with a careful case analysis of the Euclidean-divisions-derived parameters, the authors establish the $p=\infty$ case of the conjecture, providing evidence for the full log-concavity conjecture and revealing deep connections between permutation-group enumeration and extremal graph theory.

Abstract

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the $A(p,n,k)$ form a log-concave sequence with respect to $k$. For $p=1$ this is a well known property of unsigned Stirling numbers of the first kind. As the $p=2$ case, our conjecture includes a previous one by Heim and Neuhauser, which strengthens a unimodality conjecture for the Nekrasov-Okounkov hook length polynomials. In this article, we prove the $p=\infty$ case of our conjecture. We start from an expression for the $A(p,n,k)$ which follows from an identity by Bryan and Fulman, obtained in the their study of orbifold higher equivariant Euler characteristics. We then derive the $p\rightarrow\infty$ asymptotics. The last step essentially amounts to the log-concavity in $k$ of a generalized Turán number, namely, the maximum product of $k$ positive integers whose sum is $n$.

Log-concavity with respect to the number of orbits for infinite tuples of commuting permutations

TL;DR

The paper investigates the log-concavity of the counts of ordered commuting -tuples of permutations of by the number of orbits . It proves the conjectured log-concavity in the asymptotic regime by deriving precise asymptotics , where is the maximal product of positive integers summing to and is a computable multiplicative factor; crucially, satisfies the log-concavity . The analysis hinges on an explicit formula for in terms of a function and on identifying dominant terms in a sum over compositions, linking the growth rate to a generalized Turán number via . By combining these asymptotics with a careful case analysis of the Euclidean-divisions-derived parameters, the authors establish the case of the conjecture, providing evidence for the full log-concavity conjecture and revealing deep connections between permutation-group enumeration and extremal graph theory.

Abstract

Let be the number of -tuples of commuting permutations of elements whose permutation action results in exactly orbits or connected components. We formulate the conjecture that, for every fixed and , the form a log-concave sequence with respect to . For this is a well known property of unsigned Stirling numbers of the first kind. As the case, our conjecture includes a previous one by Heim and Neuhauser, which strengthens a unimodality conjecture for the Nekrasov-Okounkov hook length polynomials. In this article, we prove the case of our conjecture. We start from an expression for the which follows from an identity by Bryan and Fulman, obtained in the their study of orbifold higher equivariant Euler characteristics. We then derive the asymptotics. The last step essentially amounts to the log-concavity in of a generalized Turán number, namely, the maximum product of positive integers whose sum is .
Paper Structure (5 sections, 7 theorems, 47 equations)

This paper contains 5 sections, 7 theorems, 47 equations.

Key Result

Theorem 1.1

For all $n\ge 3$, and all $k$ such that $2\le k\le n-1$, we have, as an inequality in the extended real half line $[0,\infty]$,

Theorems & Definitions (8)

  • Conjecture 1.1
  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Lemma 2.1
  • Lemma 2.2
  • Lemma 2.3
  • Lemma 2.4