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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.