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

An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the set of segments forms a straight line drawing $G=(V,E)$ of a…

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…

Let $ D $ be a bounded Jordan domain and $ A $ be its complement on the Riemann sphere. We investigate the $ n $-th root asymptotic behavior in $ D $ of best rational approximants, in the uniform norm on $ A $, to functions holomorphic on $…

We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…

We establish the equivalence of three notions of $\mathbb{F}_q$-rational points on weighted projective spaces $\mathbb{P}_{\mathbf{w}}^n$ and derive explicit combinatorial formulas for their enumeration, leveraging Burnside's lemma and gcd…

Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…

We present an approximation algorithm for computing the diameter of a point-set in $\Re^d$. The new algorithm is sensitive to the ``hardness'' of computing the diameter of the given input, and for most inputs it is able to compute the exact…

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the…

Given a non-singular diagonal cubic hypersurface $X\subset\mathbb{P}^{n-1}$ over $\mathbb{F}_q(t)$ with $\mathrm{char} (\mathbb{F}_q)\neq 3$, we show that the number of rational points of height at most $|P|$ is $O(|P|^{3+\varepsilon})$ for…

This paper follows the generalisation of the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$ established by W. M. Schmidt in 1967. Let $A$ and $B$ be two subspaces of $\mathbb{R}^n$ of respective dimensions $d$…

This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in…

Let ${\cal P}=\{h_1, ..., h_s\}\subset \Z[Y_1, ..., Y_k]$, $D\geq \deg(h_i)$ for $1\leq i \leq s$, $\sigma$ bounding the bit length of the coefficients of the $h_i$'s, and $\Phi$ be a quantifier-free ${\cal P}$-formula defining a convex…

Boundary value problems on the unit sphere arise naturally in geophysics and oceanography when scientists model a physical quantity on large scales. Robust numerical methods play an important role in solving these problems. In this article,…

A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…

We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…

Rational approximation appears in many contexts throughout science and engineering, playing a central role in linear systems theory, special function approximation, and many others. There are many existing methods for solving the rational…