相关论文: Points on Computable Curves

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

This paper introduce a new class of operators and contraction mapping for a cyclical map T on G-metric spaces and the approximately fixed point properties. Also,we prove two general lemmas regarding approximate fixed Point of cyclical…

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…

We show, within the framework of the Euclidean $\phi^4$-quantum field theory in four dimensions, that the Wilson operator product expansion (OPE) is not only an asymptotic expansion at short distances as previously believed, but even…

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value…

An elliptic curve defined over a number field possesses only a finite number of torsion points defined over the cyclotomic closure of its field of definition. In analogy to the relative version of the Manin-Mumford conjecture stated by…

The recent debate on hyper-computation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics. We propose here the idea of geometry of effective physical process as the…

A well-known result says that the Euclidean unit ball is the unique fixed point of the polarity operator. This result implies that if, in $\mathbb{R}^n$, the unit ball of some norm is equal to the unit ball of the dual norm, then the norm…

In 1996, Meshulam proved that any sequence generated in Euclidean space by randomly projecting onto affine subspaces drawn from a finite collection stays bounded even if the intersection of the subspaces is empty. His proof, which works…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

In this paper, we study self-expanding solutions for mean curvature flows and their relationship to minimal cones in Euclidean space. In [18], Ilmanen proved the existence of self-expanding hypersurfaces with prescribed tangent cones at…

The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum…

Two-point correlators represented by either perturbative or non-perturbative integral equations in Euclidean space are considered. In general, it is difficult to determine the analytic structure of arbitrary correlators analytically. When…

The Stable Reduction Theorem guarantees that any smooth, projective, geometrically irreducible curve of genus $g \geq 2$ over a discretely valued field admits a unique stable model after a finite field extension. Computing this model is a…

A simple closed curve in the Euclidean plane is said to have property C_n(R) if at each point we can inscribe a unique regular $n$-gon with edges length $R$. C_2(R) is equivalent to having constant diameter. We show that smooth curves…

We study the arithmetic of Galois-invariant sets of points on algebraic curves with controlled reduction behavior. Let $C$ be a smooth projective curve with a smooth proper model $\mathcal{C}$ over $\mathcal{O}_{K,S}$. We define $\Omega_n$…

Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that…

On a manifold or a closed subset of a Euclidean vector space, a retraction enables to move in the direction of a tangent vector while staying on the set. Retractions are a versatile tool to perform computational tasks such as optimization,…

In this article a class of closed convex sets in the Euclidean $n$-space which are the convex hull of their profiles is described. Thus a generalization of Krein-Milman theorem\cite{Lay:1982} to a class of closed non-compact convex sets is…