Metraipolis › archive › dc_5fd267cdd343

Finding solutions with the Borsuk-Ulam theorem — arXiv:2610.39092

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39092
License (as archived)
CC0-1.0
Archived
2026-11-01T02:36:14.962Z
SHA-256 of the archived text
e8beb78ea4ef6a871c8f14e8a961fac30f1844bc5840a44e55291950146b9641
Stable URL of this page
https://metraipolis.com/documento/dc_5fd267cdd343

How to cite

Finding solutions with the Borsuk-Ulam theorem — arXiv:2610.39092 — arXiv (en), https://arxiv.org/abs/2610.39092 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5fd267cdd343 (Metraipolis archive dc_5fd267cdd343, sha256 e8beb78ea4ef6a871c8f14e8a961fac30f1844bc5840a44e55291950146b9641)
BibTeX
@misc{dc5fd267cdd343,
  title = {Finding solutions with the Borsuk-Ulam theorem — arXiv:2610.39092},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39092},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5fd267cdd343; sha256 e8beb78ea4ef6a871c8f14e8a961fac30f1844bc5840a44e55291950146b9641},
  year = {2026}
}

Archived text

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

Many existence theorems in combinatorics and geometry reduce to the Borsuk-Ulam theorem or its generalizations. We study how these existence arguments can be turned into effective numerical methods when a simple example with a single known solution is available. The idea is to deform this example into the given problem and follow its solution during the deformation. We establish conditions under which this procedure reaches a solution and estimate the work needed for a prescribed accuracy. Mass partition problems illustrate the method for both continuous objects and finite point sets. In a fixed dimension, each step for point sets requires work proportional to the number of points; we give conditions under which the entire computation has this linear cost. We also study how changing the initial example can lead to other solutions and support a search for all of them.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.39092 — 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-11-01T02:15:13.370Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).