相关论文: Points on Computable Curves

We investigate the geometry of sets in Euclidean and infinite-dimensional Hilbert spaces. We establish sufficient conditions that ensure a set of points is contained in the image of a $(1/s)$-H\"older continuous map $f:[0,1]\rightarrow…

In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane via a multiscale sum of $\beta$-numbers. These $\beta$-numbers are geometric quantities measuring how far a given set deviates from a best…

We prove a version of Peter Jones' Analyst's traveling salesman theorem in a class of highly non-Euclidean metric spaces introduced by Laakso and generalized by Cheeger-Kleiner. These spaces are constructed as inverse limits of metric…

Given a metric space $X$, an Analyst's Traveling Salesman Theorem for $X$ gives a quantitative relationship between the length of a shortest curve containing any subset $E\subseteq X$ and a multi-scale sum measuring the ``flatness'' of $E$.…

We continue to develop a program in geometric measure theory that seeks to identify how measures in a space interact with canonical families of sets in the space. In particular, extending a theorem of the first author and R. Schul in…

The Analyst's Traveling Salesman Problem is to find a characterization of subsets of rectifiable curves in a metric space. This problem was introduced and solved in the plane by Jones in 1990 and subsequently solved in higher-dimensional…

The Analyst's Traveling Salesman Problem asks for conditions under which a (finite or infinite) subset of $\mathbb{R}^N$ is contained on a curve of finite length. We show that for finite sets, the algorithm constructed by Schul (2007)and…

Let $\mathbb{G}$ be any Carnot group. We prove that, if a subset of $\mathbb{G}$ is contained in a rectifiable curve, then it satisfies Peter Jones' geometric lemma with some natural modifications. We thus prove one direction of the…

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…

We address the question of what is the correct higher dimensional analogue of Jordan curves from the point of view of quantitative rectifiability. More precisely, we show that 'topologically stable' sets can be used as covering objects in…

We show that if a subset $K$ in the Heisenberg group (endowed with the Carnot-Carath\'{e}odory metric) is contained in a rectifiable curve, then it satisfies a modified analogue of Peter Jones's geometric lemma. This is a quantitative…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…

Let $X$ be an $n$-element point set in the $k$-dimensional unit cube $[0,1]^k$ where $k \geq 2$. According to an old result of Bollob\'as and Meir (1992), there exists a cycle (tour) $x_1, x_2, \ldots, x_n$ through the $n$ points, such that…

In this thesis I discuss combinatorial optimization problems, from the statistical physics perspective. The starting point are the motivations which brought physicists together with computer scientists and mathematicians to work on this…

In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…

We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour that visits each line. The best known upper and lower bounds…

Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…

The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…

The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing…