Related papers: Rational Points on the Unit Sphere: Approximation …

A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…

Let $\mathbb{S}^{d-1}$ denote the unit sphere in Euclidean space $\mathbb{R}^d$, $d\geq 2$, equipped with surface measure $\sigma_{d-1}$. An instance of our main result concerns the regularity of solutions of the convolution equation \[…

Our goal is to find accurate and efficient algorithms, when they exist, for evaluating rational expressions containing floating point numbers, and for computing matrix factorizations (like LU and the SVD) of matrices with rational…

We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…

Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This approach is useful for a higher…

It is well-known that given a bounded, smooth nonconvex function, standard gradient-based methods can find $\epsilon$-stationary points (where the gradient norm is less than $\epsilon$) in $\mathcal{O}(1/\epsilon^2)$ iterations. However,…

We determine the maximum number of $\mathbb{F}_q$-rational points that a nonsingular threefold of degree $d$ in a projective space of dimension $4$ defined over $\mathbb{F}_q$ may contain. This settles a conjecture by Homma and Kim…

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

We establish a sharp asymptotic formula for the number of rational points up to a given height and within a given distance from a hypersurface. Our main innovation is a bootstrap method that relies on the synthesis of Poisson summation,…

We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement $\mathcal{A}(S)$ of a collection $S$ of $n$ halfplanes or triangles in the plane or of halfspaces or simplices in…

The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

We give near-optimal algorithms for computing an ellipsoidal rounding of a convex polytope whose vertices are given in a stream. The approximation factor is linear in the dimension (as in John's theorem) and only loses an excess logarithmic…

Let x be a point in R^2 with irrational slope and let \Gamma denote the lattice SL(2,Z) acting linearly on R^2. Then, the orbit \Gamma x is dense in R^2. We give efective results on the approximation of a point y in R^2 by points of the…

We prove that for any proper metric space $X$ and a function $\psi:(0,\infty)\to(0,\infty)$ from a suitable class of approximation functions, the Hausdorff dimensions of the set $W_\psi(Q)$ of all points $\psi$-well-approximable by a…

We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

Using the universal torsor method due to Salberger, we study the approximation of a general fixed point by rational points on split toric varieties. We prove that under certain geometric hypothesis the best approximations (in the sense of…

This paper proposes a new method which builds a simplex based approximation of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set into two parts, and an efficient algorithm classifying points according to this…