ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N=e1=a1+⋯+amN=e_1=a_1+\dots+a_m be the word length, let a∗=max⁡jaja^*=\max_j a_j, and set N∗=N−a∗N_*=N-a^*. For a uniformly random word with aja_j occurrences of the letter jj, let Ma1,…,amM_{a_1,\dots,a_m} be its number of inversions, with mean μ=μ(a1,…,am)\mu=\mu(a_1,\dots,a_m) and standard deviation σ=σ(a1,…,am)\sigma=\sigma(a_1,\dots,a_m).

Local limit conjecture. Uniformly for all choices of a1,…,ama_1,\dots,a_m and all integers kk,

P(Ma1,…,am=k)=12πσ(exp⁡(−(k−μ)22σ2)+O(1N∗)).\mathcal P(M_{a_1,\dots,a_m}=k)=\frac{1}{\sqrt{2\pi}\sigma}\left(\exp\left(-\frac{(k-\mu)^2}{2\sigma^2}\right)+O\left(\frac{1}{N_*}\right)\right).

This would refine the paper's asymptotic normality theorem to a local limit theorem for the Mahonian inversion distribution; the conjecture remains open in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.