English

Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm

Metric Geometry 2026-03-17 v1 Classical Analysis and ODEs

Abstract

We provide an upper and lower bound for the length of Maximum Distance Problem minimizers in terms of a finite scale geometric square sum.

Keywords

Cite

@article{arxiv.2603.14119,
  title  = {Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm},
  author = {Enrique Alvarado and Silvia Ghinassi and Lisa Naples},
  journal= {arXiv preprint arXiv:2603.14119},
  year   = {2026}
}

Comments

16 pages, 3 figures