相关论文: Points on Computable Curves

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…

We extend Raimi's classical partition theorem to the continuous setting of the circle and $n$-dimensional torus. Building on recent work of Hegyv\'ari, Pach, and Pham in finite groups, we prove that there exist measurable partitions of the…

Let $K$ be a number field not containing a CM subfield. For any smooth projective curve $Y/K$ of genus $\geq2$, we prove that the image of the "Selmer" part of Grothendieck's section set inside the $K_v$-rational points $Y(K_v)$ is finite…

This paper gives a concise proof of the Jordan curve theorem on discrete surfaces. We also embed the discrete surface in the 2D plane to prove the original version of the Jordan curve theorem. This paper is a simple version of L. Chen, Note…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$ in the Euclidean plane, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$…

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

Let $S = \{ {A_1},{A_2}, \cdots ,{A_n}\} $ be a finite point set in m-dimensional Euclidean space ${E^m}$, and$\left\| {{A_i}{A_j}} \right\|$ be the distance between $A_i$ and $A_j$. Define $\sigma (S) = \sum\limits_{1 \le i < j \le n}…

In a recent paper, Cs\"ornyei and Wilson prove that curves in Euclidean space of $\sigma$-finite length have tangents on a set of positive $\mathscr{H}^{1}$-measure. They also show that a higher dimensional analogue of this result is not…

In the Euclidean $k$-center problem in sliding window model, input points are given in a data stream and the goal is to find the $k$ smallest congruent balls whose union covers the $N$ most recent points of the stream. In this model, input…

We discuss 1-Ahlfors-regular connected sets in a general metric space and prove that such sets are `flat' on most scales and in most locations. Our result is quantitative, and when combined with work of I. Hahlomaa, gives a characterization…

In this note we obtain the surjectivity of smooth maps into Euclidean spaces under mild conditions. As application we give a new proof of the Fundamental Theorem of Algebra. We also observe that any $C^1$-map from a compact manifold into…

Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exceptions) contains at most finitely many points whose both coordinates are j-invariants of elliptic curves with complex multiplication. We…

As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the…

We show that a sufficient condition for a subset $E$ in the Heisenberg group (endowed with the Carnot-Carath\'{e}odory metric) to be contained in a rectifiable curve is that it satisfies a modified analogue of Peter Jones's geometric lemma.…