Metraipolis › archive › dc_53aea4301703
Open problems from the Length Optimization event at MDS 2026 — arXiv:2611.03403
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03403
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:46:27.777Z
- SHA-256 of the archived text
267242d52fd84a9b46d6a8e64382cbf588483a113eefa4b67c2710395b9e348e- Stable URL of this page
https://metraipolis.com/documento/dc_53aea4301703
How to cite
Open problems from the Length Optimization event at MDS 2026 — arXiv:2611.03403 — arXiv (en), https://arxiv.org/abs/2611.03403 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_53aea4301703 (Metraipolis archive dc_53aea4301703, sha256 267242d52fd84a9b46d6a8e64382cbf588483a113eefa4b67c2710395b9e348e)
BibTeX
@misc{dc53aea4301703,
title = {Open problems from the Length Optimization event at MDS 2026 — arXiv:2611.03403},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03403},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_53aea4301703; sha256 267242d52fd84a9b46d6a8e64382cbf588483a113eefa4b67c2710395b9e348e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03403. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
During the Minisymposium on Length Optimization as part of the International Conference "Mathematics Days in Sofia - 2026", the participants collected the following open problems: 1. Find any non-trivial upper and lower bounds for the degree of a branching point in the Gilbert-Steiner problem with cost-function $c(x) = x^p$ in the metric space $X = \mathbb{R}^d$ for large $d$ and fixed $p > 1/2$ (see Section 1). 2. Determine whether a typical trajectory of a given branched optimal traffic plan has bounded length. To find the optimal transport plan between the Dirac measure in the center of a circle and the Lebesgue measure on the circle (see Section 2). 3. To find the maximal distance minimizers for any explicit compact sets (see Section 3). 4. What is the minimal $C$ such that for any set of $n$ points in the three-dimensional unit cube, there is a tour through all these $n$ points with the sum of the cubes of its edge lengths at most $C$ (see Section 4). 5. To explore parallels between tropical caustics and Steiner trees: do caustics really need convexity (see Section 5).
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Metric Geometry (math.MG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.03403 — 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-03T18:14:37.821Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).