Related papers: Points on Computable Curves
The $k$-Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces $k$ edges of the tour by $k$ other edges, as long as this yields a shorter tour. We…
We are interested in quantitative rectifiability results for subsets of infinite dimensional Hilbert space $H$. We prove a version of Azzam and Schul's $d$-dimensional Analyst's Travelling Salesman Theorem in this setting by showing for any…
We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…
This paper is devoted to studying of some properties of multivalued mappings in Euclidean space. There were proved theorems on a fixed point for multivalued mappings whose restrictions to some subset in the closure of a domain satisfy "a…
We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding…
In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…
Alberti, Cs\"ornyei and Preiss introduced a notion of a "pointwise (weak) tangent field" for a subset of Euclidean space -- a field that contains almost every tangent line of every curve passing through the set -- and showed that all…
Holomorphic functions are amazing because their values in an ever so small disk in the complex plane completely determine the function values at arbitrary points in their maximum possible domain. The process of extending such a function…
It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…
We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…
A well-studied continuous model of graphs considers each edge as a continuous unit-length interval of points. In the problem $\delta$-Tour defined within this model, the objective to find a shortest tour that comes within a distance of…
The behavior of the curve shortening flow has been extensively studied. Gage, Hamilton, and Grayson proved that, under the curve shortening flow, an embedded closed curve in the Euclidean plane becomes convex after a finite time and then…
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present…
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…
Brehm's extension theorem states that a non-expansive map on a finite subset of a Euclidean space can be extended to a piecewise-linear map on the entire space. In this note, it is verified that the proof of the theorem is constructive…
In this article, we pursue our investigation of the connections between the theory of computation and hydrodynamics. We prove the existence of stationary solutions of the Euler equations in Euclidean space, of Beltrami type, that can…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane, using a multiscale sum of what is now known as Jones $\beta$-numbers, numbers measuring flatness in a given scale and location. This work was…
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…
In this paper we give an upper bound on the number of rational points on an irreducible curve $C$ of degree $\delta$ defined over a finite field $\mathbb{F}_q$ lying on a Frobenius classical surface $S$ embedded in $\mathbb{P}^3$. This…