Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm
arXiv:2603.14119
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.
16 pages, 3 figures