Erdős Problem #1162
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: group theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1162. How fast does the number of subgroups of the symmetric group grow, and what can be said about the orders of typical subgroups?
Let f(n)=number of SUBGROUPS (not isomorphism classes) of symmetric group S_n. Erdős–Turán/Vardi #1162 asks (A) sharp asymptotics for f(n), and separately (B) a statistical theorem describing the ORDERS of subgroups of S_n. Do not conflate (A) solved with (B) unsolved or ambiguous, and specify LOGARITHM BASE.
A small example
Exact closure enumeration of S3 subgroup lattice gives SIX distinct subgroups, with order histogram {1:1,2:3,3:1,6:1}. For n=3 this is exhaustive and demonstrates the distinction between number of subgroups and distribution of their orders; no asymptotic subgroup counting is certified by the tiny example.
What is known
https://www.erdosproblems.com/1162 currently OPEN because statistical order-distribution question remains. Pyber [Py93] established log f(n)~order n². Roney-Dougal and Tracey [RoTr25], https://arxiv.org/abs/2503.05416, prove f(n)=2^{n²/16+o(n²)}. Therefore LOG BASE 2 has (log_2 f(n))/n²→1/16; for natural logarithm the constant is (ln 2)/16. The live website writes log f(n)=(1/16+o(1))n² WITHOUT base; that requires a source-fidelity precision note. The paper abstract also includes nontrivial random subgroup properties, but none automatically answer the distribution of subgroup ORDERS.
GCL's current state
Authenticated source-bound original-issue audit reports the mathematical status, external source attribution and independently tested bounded evidence. The deterministic programme is ci/erdos_compendium_007_phase19_checks.py.
This source return is PARTIAL. Neither an original-source proof review, Lean kernel certification, independent critical approval nor protected V2 admission has been completed.
What remains
ERDOS-1162-SUBGROUP-LOGBASE-001: source-lock 2025 RoTr theorem and Pyber 1993, correct log base in derived article (base2 vs ln). Reproduce S4/S5 subgroup lattices in GAP, and identify precise candidate statistical observable for random-subgroup ORDER part (distribution under uniform subgroups, normalization of log|H|).
Open statistical half has no precise proposed limit theorem; original proofs need independent review; log base mismatch between source synopsis and primary paper.
Sources and claim boundaries
https://www.erdosproblems.com/1162 ; https://arxiv.org/abs/2503.05416 ; [Py93],[RoTr25],[Va99,5.73]. Asymptotic number externally PROVED, distribution question OPEN.
Unaccepted editorial manuscript. The exact finite examples are independently checked; all general published claims await primary source fidelity review. A source-notation conflict is not a new theorem.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2433 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.