Search arXivSearch

arXiv · 2506.06894

Proof of a conjecture by Starr and log-concavity for random commuting permutations

Abstract

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many single permutations have a given number of cycles. In the case of pairs of permutations, these numbers are related to D'Arcais polynomials and the Nekrasov-Okounkov formula. As a consequence of the above asymptotics, we confirm a log-concavity conjecture in the regime of typical values for the number of joint orbits. As a result of possible indepentent interest in applied mathematics and mathematical physics, we also provide detailed asymptotics, using Mellin transform techniques, for certain multiple series or multivariate Ramanujan sums which are related to ordinary generating functions of Dirichlet convolutions of power laws. Besides these multiple sums asymptotics, our proofs use bivariate saddle point analysis related to the Meinardus theorem in the delicate case of multiple poles for the associated Dirichlet series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abdelmalek Abdesselam. 2025-06-07. Proof of a conjecture by Starr and log-concavity for random commuting permutations. https://arxiv.org/abs/2506.06894

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO