ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FmF_m be the free group of rank mm. For a word w∈Fmw\in F_m, let

π(w)=min⁡{rk⁡H:H≤Fm, w∈H, and w is not primitive in H},\pi(w)=\min\{\operatorname{rk}H:H\leq F_m,\ w\in H,\text{ and }w\text{ is not primitive in }H\},

with π(w)=∞\pi(w)=\infty if no such subgroup exists. For k∈Z≥2k\in\mathbb{Z}_{\geq 2} and a partition λ⊢k\lambda\vdash k, let λ+(n)\lambda^{+}(n) denote the corresponding stable Young diagram, and let χλ+(n)\chi^{\lambda^{+}(n)} and Vλ+(n)V^{\lambda^{+}(n)} be the associated irreducible character and representation of SnS_n. For independent uniformly random permutations σ1,…,σm∈Sn\sigma_1,\dots,\sigma_m\in S_n, write w(σ1,…,σm)w(\sigma_1,\dots,\sigma_m) for the word-map evaluation.

Hanany–Puder conjecture. For any k∈Z≥2k\in\mathbb{Z}_{\geq2}, any λ⊢k\lambda\vdash k, and any w∈Fmw\in F_m,

Eσ1,…,σm∈Sn[χλ+(n)(w(σ1,…,σm))]=O(1(dim⁡Vλ+(n))π(w)−1).\mathop{\mathbb{E}}_{\sigma_{1},\dots,\sigma_{m}\in S_{n}}\left[\chi^{\lambda^{+}(n)}\left(w\left(\sigma_{1},\dots,\sigma_{m}\right)\right)\right]=O\left(\frac{1}{\left(\dim V^{\lambda^{+}(n)}\right)^{\pi(w)-1}}\right).

This conjectures a substantially stronger decay estimate than the known bound O(n−π(w))O(n^{-\pi(w)}) for words that are not proper powers or the identity. It refines the study of distributions of word maps on symmetric groups by relating character expectations to the primitivity rank of the word and the dimension of the corresponding stable irreducible representation.

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.