Log-Concavity with Respect to the Number of Orbits for Infinite Tuples of Commuting Permutations

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$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> this is a well-known property of unsigned Stirling numbers of the first kind. As the $$p=2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>→</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> 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 .

Authors

Institutions

Publication Details

Journal
Annals of Combinatorics
Published
2024-11-06
DOI
https://doi.org/10.1007/s00026-024-00724-z
Citations
3
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Log-Concavity with Respect to the Number of Orbits for Infinite Tuples of Commuting Permutations

Abdelmalek Abdesselam
3 citations
Annals of Combinatorics
graph theory and CDMA systems
0.63
article

Log-Concavity with Respect to the Number of Orbits for Infinite Tuples of Commuting Permutations

Abdelmalek Abdesselam
article en
3 citations

Abstract

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$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> this is a well-known property of unsigned Stirling numbers of the first kind. As the $$p=2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>=</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>→</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> 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 .

Annals of CombinatoricsVol. 29(2)
University of Virginia (US)
Openalex Percentile: Top 31%
graph theory and CDMA systems
0.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Log-Concavity with Respect to the Number of Orbits for Infinite Tuples of Commuting Permutations — Abdelmalek Abdesselam · Annals of Combinatorics (2024) | TGRS Research Map | TGRS