Skip to content

Erdős Problem #1186

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, arithmetic progressions.

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 #1186 is OPEN — MANDATORY CRITICAL in the maintained catalogue.

Among all two-colorings of \([n]\), count nontrivial monochromatic \(k\)‑term APs, each counted once by its starting point and positive difference. Let \(\delta_k\) measure the least asymptotic guaranteed count, normalized by \(n^2\); the formal definition needs a \(\liminf\) or a proven limit of finite minima. This is distinct from the cyclic finite-field parameter \(\widetilde\delta_k\), which counts APs under modular conventions.

A small example

Exact enumeration of all \(2^n\) binary colorings on \([n]\) for \(n=8,10,12\) finds minimum monochromatic 3-AP counts 0, 1, 2, respectively; the receipt retains minimizing bitmasks, total 3-AP counts and normalized exact fractions. A separate cyclic-prime-field enumeration at \(p=5,7,11\) counts unordered 3-element modular APs. None of these small minima proves an asymptotic constant; notably the cyclic and interval normalization differ.

What is known

The catalogue https://www.erdosproblems.com/1186 keeps sharp \(\delta_k\) OPEN [Er80,p.93]. Van der Waerden implies \(\delta_k\gg_k1\), random binary coloring upper \(\delta_k\le1/((k-1)2^k)\). Parrilo–Robertson–Saracino [PRS08] prove \(1675/32768\le\delta_3\le117/2192\) (about 0.0511–0.0534); the upper bound is conjectured sharp. For cyclic prime fields, \(\widetilde\delta_3=1/8\) and Wolf [Wo10], Lu–Peng [LuPe12] give \(7/192\le\widetilde\delta_4\le17/300\), under their counting convention. These are source-attributed, not GCL-independent SDP certificates.

GCL's current state

Authenticated original issue research return records an exact statement audit, primary-source references and the bounded mathematical evidence. GCL independently replayed only ci/erdos_compendium_007_phase22_checks.py; it did not certify all original external proofs or resolve open problems. The current manuscript is UNACCEPTED.

What remains

Mandatory #1186 independent specialist review: obtain PRS08 SDP certificates and exact scope, reconstruct random-color upper bound and van der Waerden lower, independently replay phase22 exhaustive examples and source-check finite-field counting in Wolf10/LuPe12. Do not count the critical sample complete without authenticated nonauthor referee adjudication.

Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.

Sources and claim boundaries

https://www.erdosproblems.com/1186 ; [Er80,p.93],[PRS08],[Wo10],[LuPe12].

Persisted deterministic finite-check evidence is in governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE22.json. Original source issue body SHA unchanged; no public deployment, V2 approval or kernel certificate claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2457 — 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.

Back to catalogue · Compendium introduction