Related papers: Rational approximation to real points on conics

We propose an algorithm for general nonlinear conic programming which does not require the knowledge of the full cone, but rather a simpler, more tractable, approximation of it. We prove that the algorithm satisfies a strong global…

We study the general problem of equidistribution of expanding translates of an analytic curve by an algebraic diagonal flow on the homogeneous space $G/\Gamma$ of a semisimple algebraic group $G$. We define two families of algebraic…

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

We initiate the study of an intrinsic notion of Diophantine approximation on a rational Carnot group $G$. If $G$ has Hausdorff dimension $Q$, we show that its Diophantine exponent is equal to $(Q+1)/Q$, generalizing the case $G=\mathbb…

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

We give an upper bound for the number of rational points of height at most $B$, lying on a surface defined by a quadratic form $Q$. The bound shows an explicit dependence on $Q$. It is optimal with respect to $B$, and is also optimal for…

Let xi be a real number which is neither rational nor quadratic over Q. Based on work of Davenport and Schmidt, Bugeaud and Laurent have shown that, for any real number theta, there exist a constant c>0 and infinitely many non-zero…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

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…

In this paper, we examine how well a rational point P on an algebraic variety X can be approximated by other rational points. We conjecture that if P lies on a rational curve, then the best approximations to P on X can be chosen to lie…

The approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…

Let C be two times continuously differentiable curve in R^2 with at least one point at which the curvature is non-zero. For any i,j > 0 with i+j =1, let Bad(i,j) denote the set of points (x,y) in R^2 for which max {||qx ||^{1/i},…

For any irrational real number xi, let lambda(xi) denote the supremum of all real numbers lambda such that, for each sufficiently large X, the inequalities |x_0| < X, |x_0*xi-x_1| < X^{-lambda} and |x_0*xi^2-x_2| < X^{-lambda} admit a…

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…

We study the problem of approximation of 2D set of points. Such type of problems always occur in physical experiments, econometrics, data analysis and other areas. The often problems of outliers or spikes usually make researchers to apply…

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

We study arithmetical and geometrical properties of maximal curves, that is, curves defined over the finite field F_{q^2} whose number of F_{q^2}-rational points reaches the Hasse-Weil upper bound. Under a hypothesis on non-gaps at a…