OpenFrontiers
← Back to the index
OP-12094OpenAlgebra

Asymptotic essential-dimension ratio of the symmetric groups (C79C_{79})

Asymptotic essential-dimension ratio of the symmetric groups: determine C79C_{79} or improve its bounds; the repository records 12\frac{1}{2} (lower) and 1 (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

For each integer n≥1n \ge 1, let SnS_n be the symmetric group on nn letters. Over a base field kk, the essential dimension edk(Sn)ed_k(S_n) is the smallest integer dd such that the general degree-nn polynomial

xn+a1xn−1+⋯+anx^n + a_1 x^{n-1} + \cdots + a_n

can be reduced to a dd-parameter form by a Tschirnhaus transformation. [ER2024-def]

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

We define

C79 := lim sup⁡n→∞edC(Sn)n.C_{79}\ :=\ \limsup_{n\to\infty}\frac{ed_{\mathbb C}(S_n)}{n}.

Thus this entry's asymptotic constant is specifically the characteristic-00 quantity over C\mathbb C.

The best established range is

12 ≤ C79 ≤ 1.\frac12\ \le\ C_{79}\ \le\ 1.

[ER2024-intro-bounds-open] [BR1997-sym-bounds]

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

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  • Exact values through degree 77. Over C\mathbb C, one has edC(S4)=edC(S5)=2ed_{\mathbb C}(S_4)=ed_{\mathbb C}(S_5)=2, edC(S6)=3ed_{\mathbb C}(S_6)=3, and edC(S7)=4ed_{\mathbb C}(S_7)=4. The exact value is open for every n≥8n\ge 8. [BR1997-sym-bounds] [Duncan2010-exact7] [ER2024-intro-bounds-open]

  • Connection with Hilbert’s 1313th problem. The sequence edC(Sn)ed_{\mathbb C}(S_n) measures the complexity of simplifying the general degree-nn polynomial by Tschirnhaus transformations; already the case n=7n=7 is tied to algebraic variants of Hilbert’s 1313th problem. [BR1997-cor42-dk-edSn] [Duncan2010-h13]

  • Characteristic bookkeeping. The bounds split by characteristic as follows: edk(Sn)≤n−3ed_k(S_n)\le n-3 (n≥5)(n\ge 5) is valid over arbitrary fields; edk(Sn)≥⌊n/2⌋ed_k(S_n)\ge \lfloor n/2 \rfloor is proved in characteristic 00 and extends to char(k)≠2\mathrm{char}(k)\ne 2; the stronger edk(Sn)≥⌊(n+1)/2⌋ed_k(S_n)\ge \lfloor (n+1)/2 \rfloor is currently quoted in characteristic 00; and in prime characteristic (char(k)=p>0\mathrm{char}(k)=p>0), for every prime pp there are infinitely many nn with edFp(Sn)≤n−4ed_{\mathbb{F}_{p}}(S_n)\le n-4. Here char(k)≠2\mathrm{char}(k)\ne 2 means both characteristic 00 and odd prime characteristics. [ER2024-intro-bounds-open] [BR1997-sym-bounds] [ER2024-poschar]

  • Recent synthesis of the C\mathbb C status. A 2023 summary of known bounds on essential dimension and resolvent degree over C\mathbb C reiterates that for symmetric groups, the exact value of ed(Sn)ed(S_n) is open for every n≥8n\ge 8, and that the expected value is n−3n-3 for n≥5n\ge 5. [Sutherland2023-status]

  • Related invariant in positive characteristic. A 2026 follow-up by Edens and Reichstein shows that the sextic, 13th-problem, and octic resolvent-degree conjectural equalities can fail over fields of positive characteristic, highlighting parallel characteristic-sensitivity for complexity invariants attached to general polynomials. [ER2026-h13-poschar]

References (from the repository page)

  • [BR1997] Buhler, Joe; Reichstein, Zinovy. On the essential dimension of a finite group. Compositio Mathematica 106 (1997), no. 2, 159–179. DOI: 10.1023/A:1000144403695. Author-hosted PDF: edtotal.pdf. Google Scholar

  • [BR1997-cor42-dk-edSn] loc: Author-hosted PDF p.11, §4, file edtotal.pdf quote: “COROLLARY 4.2. Let GG be a transitive subgroup of SnS_n, let x1,…,xnx_1, \ldots, x_n be independent variables over kk and let FGF_G be the fixed field for the natural (permutation) action of GG on E=k(x1,…,xn)E = k(x_1, \ldots, x_n). Then edk(FG(x1)/FG)=edk(G)ed_k(F_G(x_1)/F_G) = ed_k(G). In particular, the number dk(n)dk(n), defined in the introduction, is equal to edk(Sn)ed_k(S_n).”

  • [BR1997-sym-bounds] loc: Author-hosted PDF p.17, §6.3 “Symmetric Groups”, file edtotal.pdf quote: “THEOREM 6.5. Let kk be an arbitrary field of characteristic 00. Then (a) edk(Sn+2)≥edk(Sn)+1ed_k(S_{n+2}) \ge ed_k(S_n) + 1 for any n≥1n \ge 1. (b) edk(Sn)≥[n/2]ed_k(S_n) \ge [n/2] for any n≥1n \ge 1. (c) edk(Sn)≤n−3ed_k(S_n) \le n - 3 for any n≥5n \ge 5. (d) edk(S4)=edk(S5)=2ed_k(S_4) = ed_k(S_5) = 2, edk(S6)=3ed_k(S_6) = 3.”

  • [Duncan2010] Duncan, Alexander. Essential dimensions of A7A_7 and S7S_7. Mathematical Research Letters 17 (2010), no. 2, 263–266. arXiv PDF: 0908.3220. DOI: 10.4310/MRL.2010.v17.n2.a5. Google Scholar

  • [Duncan2010-exact7] loc: arXiv v1 PDF p.1, Introduction, file 0908.3220.pdf quote: “The purpose of this note is to show that the essential dimension of the alternating group A7A_7 and the symmetric group S7S_7 can be computed using the recent work of Prokhorov [12] on the classification of rationally connected threefolds with faithful actions of non-abelian simple groups. Our main result is the following: Theorem 1. edk(A7)=edk(S7)=4ed_k(A_7) = ed_k(S_7) = 4.”

  • [Duncan2010-h13] loc: arXiv v1 PDF p.2, Introduction, file 0908.3220.pdf quote: “The values of edk(Sn)ed_k(S_n) are of special interest because they relate to classical questions of simplifying degree nn polynomials via Tschirnhaus transformations. In particular, the degree 77 case features prominently in algebraic variants of Hilbert’s 13th problem.”

  • [ER2024] Edens, Oakley; Reichstein, Zinovy. Essential dimension of symmetric groups in prime characteristic. Comptes Rendus. Mathématique 362 (2024), 639–647. arXiv PDF: 2308.10096. DOI: 10.5802/crmath.577. Google Scholar

  • [ER2024-def] loc: Numdam PDF p.2, Abstract, file 10.5802/crmath.577.pdf quote: “The essential dimension edk(Sn)ed_k(S_n) of the symmetric group SnS_n is the minimal integer dd such that the general polynomial xn+a1xn−1+⋯+anx^n + a_1x^{n-1} + \cdots + a_n can be reduced to a dd-parameter form by a Tschirnhaus transformation.”

  • [ER2024-intro-bounds-open] loc: Numdam PDF p.3, §1 “Introduction”, file 10.5802/crmath.577.pdf quote: “Finding edk(Sn)ed_k(S_n) is a long-standing open problem, which goes back to F. Klein [8]; cf. also N. Chebotarev [14]. Essential dimension of a finite group was formally defined by J. Buhler and the second author in [5], where the inequalities edk(Sn)≥⌊n/2⌋ed_k(S_n) \ge \lfloor n/2 \rfloor and edk(Sn)≤n−3ed_k(S_n) \le n - 3 (n≥5)(n \ge 5) were proved. The field kk was assumed to be of characteristic 00 in [5], but the proof of the first inequality in (1) given there goes through for any field kk of characteristic different from 22. The second inequality is valid over an arbitrary field kk. A. Duncan [6] subsequently showed that in characteristic 00, edk(Sn)≥⌊(n+1)/2⌋ed_k(S_n) \ge \lfloor (n + 1)/2 \rfloor for any n≥7n \ge 7. The exact value of edk(Sn)ed_k(S_n) is open for each n≥8n \ge 8 and any field kk, though it is widely believed that edk(Sn)ed_k(S_n) should be n−3n - 3 for every n≥5n \ge 5, at least in characteristic 00.”

  • [ER2024-poschar] loc: Numdam PDF p.2, Abstract, file 10.5802/crmath.577.pdf quote: “In this paper we show that for every prime pp there are infinitely many positive integers nn such that edFp(Sn)≤n−4ed_{\mathbb{F}_p}(S_n) \le n - 4.”

  • [Sutherland2023] Sutherland, Alexander J. A Summary of Known Bounds on the Essential Dimension and Resolvent Degree of Finite Groups. Preprint (2023), arXiv:2312.04430. arXiv PDF: 2312.04430. DOI: 10.48550/arXiv.2312.04430. Google Scholar

  • [Sutherland2023-status] loc: arXiv v1 PDF p.3, §3 “Lower Bounds on ed(G)”, Case 2, file 2312.04430.pdf quote: “the exact value of ed(Sn)ed(S_n) is open for every n≥8n \ge 8, though it is widely believed that ed(Sn)ed(S_n) should be n−3n - 3 for every n≥5n \ge 5.”

  • [ER2026] Edens, Oakley; Reichstein, Zinovy B. Hilbert’s 13th problem in prime characteristic. Documenta Mathematica 31 (2026), no. 2, 385–399. arXiv PDF: 2406.15954. DOI: 10.4171/DM/984. Google Scholar

  • [ER2026-h13-poschar] loc: Doc. Math. PDF p.1, Abstract, file dm984.pdf quote: “In this paper, we show that all three of Hilbert’s conjectures can fail if we replace CC with a base field of positive characteristic.”

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 12\frac{1}{2}; best known upper bound 1. Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
11 [BR1997] Follows from edC(Sn)≤n−3ed_{\mathbb C}(S_n)\le n-3 for all n≥5n\ge 5, hence C79≤lim sup⁡n→∞(n−3)/n=1C_{79}\le \limsup_{n\to\infty}(n-3)/n = 1. [BR1997-sym-bounds]

Known lower bounds

Bound Reference Comments
1/21/2 [BR1997], [ER2024] In characteristic 00, Buhler–Reichstein proved edk(Sn)≥⌊n/2⌋ed_k(S_n)\ge \lfloor n/2 \rfloor, and Duncan improved this to edk(Sn)≥⌊(n+1)/2⌋ed_k(S_n)\ge \lfloor (n+1)/2 \rfloor for n≥7n\ge 7; ER2024 notes the ⌊n/2⌋\lfloor n/2 \rfloor argument also works for char(k)≠2\mathrm{char}(k)\ne 2. In particular, over C\mathbb C either estimate yields C79≥1/2C_{79}\ge 1/2. [ER2024-intro-bounds-open] [BR1997-sym-bounds]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Asymptotic essential-dimension ratio of the symmetric groups ($C_{79}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.