Metraipolis › archive › dc_8a317dba1c02
Simple symmetric Venn diagrams with 17, 19 and 23 curves — arXiv:2609.26546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26546
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:56:05.220Z
- SHA-256 of the archived text
6a186f1ab2a731b8d63402b169e2375f33a9ab104589b2f2bcfc08fc948b4da2- Stable URL of this page
https://metraipolis.com/documento/dc_8a317dba1c02
How to cite
Simple symmetric Venn diagrams with 17, 19 and 23 curves — arXiv:2609.26546 — arXiv (en), https://arxiv.org/abs/2609.26546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a317dba1c02 (Metraipolis archive dc_8a317dba1c02, sha256 6a186f1ab2a731b8d63402b169e2375f33a9ab104589b2f2bcfc08fc948b4da2)
BibTeX
@misc{dc8a317dba1c02,
title = {Simple symmetric Venn diagrams with 17, 19 and 23 curves — arXiv:2609.26546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a317dba1c02; sha256 6a186f1ab2a731b8d63402b169e2375f33a9ab104589b2f2bcfc08fc948b4da2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We exhibit simple, rotationally symmetric Venn diagrams with 17 curves, with 19 curves and with 23 curves: $n$ Jordan curves carried to one another by rotation through $2\pi/n$, with every one of the $2^n$ regions present and connected and, since the diagrams are simple, every crossing on exactly two curves. Symmetric Venn diagrams exist for every prime number of curves (Griggs, Killian and Savage, 2004), but those diagrams have many curves through a point; simple ones were known only up to 13 curves (Mamakani and Ruskey, 2014). Four 17-curve, nine 19-curve and five 23-curve diagrams were found by a Metropolis walk on rotation-invariant quadrangulations of the sphere in which regions may temporarily be duplicated, started from the Griggs-Killian-Savage diagram with its multiple crossings resolved. At 23 curves the walk was held for two weeks by duplicated regions near the poles; the two lineages that finished were the first whose $E=92$ states had none. Every diagram is given by a machine-checkable certificate; one certificate each of the 17- and 19-curve sizes has been verified by a formal proof in Lean 4. All of the diagrams are non-monotone, which is why the crossing-sequence searches that found the 11- and 13-curve diagrams could not have found them. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO). Categorie arXiv: Combinatorics (math.CO) ; Computational Geometry (cs.CG); Discrete Mathematics (cs.DM). Pagina del lavoro: https://arxiv.org/abs/2609.26546 — 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-08T15:16:21.700Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).