Erdős Problem #1160
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 #1160. The number of abstract groups of a given finite order can grow enormously. Are powers of two extremal among all smaller orders?
Let g(n) be the number of isomorphism classes of groups of EXACT order n (not subgroups of a fixed symmetric group). For every integer m≥0 and every 1≤n≤2^m ask whether g(n)≤g(2^m). A stronger distinct conjecture asks ∑_{1≤n<2^m}g(n)≤g(2^m) for sufficiently large m (perhaps m≥7). Quantifier is for ALL n up to the power of two; proving only odd-order case is not enough.
A small example
Small group classification gives g(1)=g(2)=g(3)=g(5)=g(7)=1, g(4)=g(6)=2, g(8)=5; hence for 1≤n≤8 all g(n)≤g(8)=5. This finite known-order table is not a new classification nor theorem for arbitrary m. Stronger SUM version does not follow from the pointwise inequality.
What is known
https://www.erdosproblems.com/1160 OPEN, Vardi [Va99,5.71], Blackburn–Neumann–Venkataraman [BNV07] Questions 22.16 and 22.18. Attribution is disputed: Erdős and Higman both mentioned without a documented origin. Pantelidakis [Pa03] proved original g(n)≤g(2^m) for ODD n when m≥3619, not all n. Main conjecture still OPEN; no primary global proof.
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-1160-GROUP-COUNTS-001: independently audit BNV07 exact questions and Pantelidakis odd-n hypothesis; extend GAP SmallGroups exact counts to larger powers 2 with database/version receipts; carefully separate conjecture g(n)≤g(2^m) from ∑g(n)≤g(2^m).
General case and published large-m odd case proof review unresolved; no new group enumeration beyond exact small table.
Sources and claim boundaries
https://www.erdosproblems.com/1160 ; [Va99,5.71],[BNV07 Questions 22.16,22.18],[Pa03]. 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: #2431 — 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.