Open problems from the Length Optimization event at MDS 2026

Abstract

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 = ℝ^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).

On Two Open Problems by Johnson and Kollár
Siyuan Fu, Zhiming Li, Huaiqing Zuo
arXiv29 Sep 2026PreprintCC BY 4.0Full textAlgebra & number theoryarXiv
Open Problems on the Null Space and Image Space of the Adjacency Matrix
K Kranthi Priya, K C Sivakumar
arXiv5 Nov 2026PreprintCC0Full textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He +8
arXiv31 Aug 2026PreprintCC BY 4.0Full textLogic & foundationsarXiv
Method of Spectral Mappings for Nonselfadjoint Boundary-Value Problems Associated with Resonance Scattering by Open Structures
Garnik V. Abgaryan, Yury V. Shestopalov
Mathematics22 Oct 2026Peer-reviewedCC BY 4.0Mathematical physicsCrossref
Solutions to some open problems in matrix analysis
Mohamed Amine Aouichaoui, Eun-Young Lee
arXiv21 Sep 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv

Cite

BibTeX RIS

BibTeX

@misc{teplitskaya2026open,
  title = {{Open problems from the Length Optimization event at MDS 2026}},
  author = {Yana Teplitskaya},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03403},
  eprint = {2611.03403},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03403},
  note = {CC BY-NC-SA 4.0},
}

RIS

TY  - UNPB
TI  - Open problems from the Length Optimization event at MDS 2026
AU  - Yana Teplitskaya
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03403
UR  - https://arxiv.org/abs/2611.03403
AB  - 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 = ℝ^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).
ER  -

Abstract

Related

Cite