Metraipolis › archive › dc_1330049dfceb

Short Proofs for the Minimum Number of Determined Circles — arXiv:2610.18918

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.18918
License (as archived)
CC0-1.0
Archived
2026-10-15T14:36:39.435Z
SHA-256 of the archived text
eeab580dd2e2258102289ecf511f20f68e25b6c2db3416084ae940bf520bc8c2
Stable URL of this page
https://metraipolis.com/documento/dc_1330049dfceb

How to cite

Short Proofs for the Minimum Number of Determined Circles — arXiv:2610.18918 — arXiv (en), https://arxiv.org/abs/2610.18918 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1330049dfceb (Metraipolis archive dc_1330049dfceb, sha256 eeab580dd2e2258102289ecf511f20f68e25b6c2db3416084ae940bf520bc8c2)
BibTeX
@misc{dc1330049dfceb,
  title = {Short Proofs for the Minimum Number of Determined Circles — arXiv:2610.18918},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.18918},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1330049dfceb; sha256 eeab580dd2e2258102289ecf511f20f68e25b6c2db3416084ae940bf520bc8c2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.18918. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present short proofs for the main parts of the recently completed solution of Erdős Problem 506, which asks for the minimum number of distinct circles determined by a finite planar point set that is neither collinear nor concyclic. An inversion argument and a seven-point line lemma show that eight points determine at least $17$ circles, and an explicit configuration attains this bound. A single argument combining Melchior's inequality with Langer's incidence bound establishes the sharp formula for every $n\ge15$. The proofs give concise alternatives to longer arguments in the recent literature; the remaining finite cases are cited separately.

Tema degli esploratori: storia e filosofia della scienza (elenco arXiv math.HO, nuovi lavori del giorno).
Categorie arXiv: History and Overview (math.HO) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.18918 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:57:35.292Z dalla pagina https://arxiv.org/list/math.HO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).