Related papers: Points on Computable Curves

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

According to a general definition of discrete curves, surfaces, and manifolds. This paper focuses on the Jordan curve theorem in 2D discrete spaces. The Jordan curve theorem says that a (simply) closed curve separates a simply connected…

Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…

In this paper, based on the theory of surfaces in the four-dimensional Euclidean space which generalizes the theory of surfaces in three-dimensional Euclidean space, beside other results, we will give a characterization of points on…

We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $\Theta(\log n)$ times longer than an optimum solution. Our family works for the graphic, the…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this…

In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the…

We prove several interpolation results for holomorphic Legendrian curves lying in an odd dimensional complex Euclidean space with the standard contact structure. In particular, we show that an arbitrary countable set of points in…

There has been great interest in developing a theory of "Khintchine types" for manifolds embedded in Euclidean space, and considerable progress has been made for curved manifolds. We treat the case of translates of coordinate hyperplanes,…

Continual learning systems operating in fixed-dimensional spaces face a fundamental geometric barrier: the flat manifold problem. When experience is represented as a linear trajectory in Euclidean space, the geodesic distance between…

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

Self-contractedness (or self-expandedness, depending on the orientation) is hereby extended in two natural ways giving rise, for any $\lambda\in\lbrack-1,1)$, to the metric notion of $\lambda $-curve and the (weaker) geometric notion of…

The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances…

In the unsplittable capacitated vehicle routing problem, we are given a metric space with a vertex called depot and a set of vertices called terminals. Each terminal is associated with a positive demand between 0 and 1. The goal is to find…

We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these…

We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…

While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas. In this paper we show that if CTCs existed, then quantum…

We show that every smooth closed curve C immersed in Euclidean 3-space satisfies the sharp inequality 2(P+I)+V >5 which relates the numbers P of pairs of parallel tangent lines, I of inflections (or points of vanishing curvature), and V of…