相关论文: Correction. Connect The Dots: How Many Random Poin…
Pick $N$ random points $U_1,\cdots,U_{N}$ independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set $\{A,B,U_1,\cdots,U_{N}\}$. The boundary of this convex hull is a convex chain $V_0=B,V_1,\cdots,$…
For a quadratic endomorphism of the affine line defined over the rationals, we consider the problem of bounding the number of rational points that eventually land at the origin after iteration. In the article ``Uniform Bounds on Pre-Images…
We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…
It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…
Connecting curves have been shown to organize the rotational structure of strange attractors in three-dimensional dynamical systems. We extend the description of connecting curves and their properties to higher dimensions within the special…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
In this paper we study existence and uniqueness of rational normal curves in $\PP^n$ passing through $p$ points and intersecting $l$ codimension two linear spaces in $n-1$ points each. If $p+l=n+3$ and the points and the linear spaces are…
In 1922, Mordell conjectured that the set of rational points on a smooth curve $C$ over $\mathbb{Q}$ with genus $g \ge 2$ is finite. This has been proved by Faltings in 1983. However, Coleman determined in 1985 an upper bound of…
We study the geometry of the space of rational curves on smooth complete intersections of low degree, which pass through a given set of points on the variety. The argument uses spreading out to a finite field, together with an adaptation to…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
Comment on ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
An error in the author's paper (Functiones et Approximatio, 37 . pp. 203-211) is corrected.
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…
We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
Albertson conjectured that if graph $G$ has chromatic number $r$, then the crossing number of $G$ is at least that of the complete graph $K_r$. This conjecture in the case $r=5$ is equivalent to the four color theorem. It was verified for…
We consider genus $g$ hyperelliptic curves over $\mathbb{Q}$ with a rational Weierstrass point, ordered by height. If $d < g$ is odd, we prove, under an assumption, that there exists $B_d$ such that a positive proportion of these curves…
We consider rooted subgraphs in random graphs, i.e., extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave sufficient…
Bezout's theorem gives us the degree of intersection of two properly intersecting projective varieties. As two curves in P^3 never intersect properly, Bezout's theorem cannot be directly used to bound the number of intersection points of…
Deterministic sources of quantum light (i.e. single photons or pairs of entangled photons) are required for a whole host of applications in quantum technology, including quantum imaging, quantum cryptography and the long-distance transfer…