Asymptotic essential-dimension ratio of the symmetric groups

Description of constant

For each integer $n \ge 1$, let $S_n$ be the symmetric group on $n$ letters. Over a base field $k$, the essential dimension $ed_k(S_n)$ is the smallest integer $d$ such that the general degree-$n$ polynomial \(x^n + a_1 x^{n-1} + \cdots + a_n\) can be reduced to a $d$-parameter form by a Tschirnhaus transformation. [ER2024-def]

Buhler and Reichstein proved that this polynomial-theoretic parameter count is exactly $ed_k(S_n)$, so the asymptotic problem for $ed_{\mathbb C}(S_n)$ is equivalent to the asymptotic Tschirnhaus-simplification problem for the general polynomial. [BR1997-cor42-dk-edSn]

We define \(C_{79}\ :=\ \limsup_{n\to\infty}\frac{ed_{\mathbb C}(S_n)}{n}.\)

Thus this entry’s asymptotic constant is specifically the characteristic-$0$ quantity over $\mathbb C$.

The best established range is \(\frac12\ \le\ C_{79}\ \le\ 1.\) [ER2024-intro-bounds-open] [BR1997-sym-bounds]

It is widely believed that $ed_{\mathbb C}(S_n)=n-3$ for every $n\ge 5$, which would imply $C_{79}=1$. [ER2024-intro-bounds-open]

Known upper bounds

Bound Reference Comments
$1$ [BR1997] Follows from $ed_{\mathbb C}(S_n)\le n-3$ for all $n\ge 5$, hence $C_{79}\le \limsup_{n\to\infty}(n-3)/n = 1$. [BR1997-sym-bounds]

Known lower bounds

Bound Reference Comments
$1/2$ [BR1997], [ER2024] In characteristic $0$, Buhler–Reichstein proved $ed_k(S_n)\ge \lfloor n/2 \rfloor$, and Duncan improved this to $ed_k(S_n)\ge \lfloor (n+1)/2 \rfloor$ for $n\ge 7$; ER2024 notes the $\lfloor n/2 \rfloor$ argument also works for $\mathrm{char}(k)\ne 2$. In particular, over $\mathbb C$ either estimate yields $C_{79}\ge 1/2$. [ER2024-intro-bounds-open] [BR1997-sym-bounds]

References

Contribution notes

Prepared with assistance from ChatGPT 5.2 Pro.