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

Let $\mathcal{M}\subset \mathbb{R}^n$ be a compact and sufficiently smooth manifold of dimension $d$. Suppose $\mathcal{M}$ is nowhere completely flat. Let $N_{\mathcal{M}}(\delta,Q)$ denote the number of rational vectors $\mathbf{a}/q$…

We give a new algorithm using linear approximation and lattice reduction to efficiently calculate all rational points of small height near a given plane curve C. For instance, when C is the Fermat cubic, we find all integer solutions of…

Building upon previous works of Andr{\'e} and Chudnovsky, we prove a general result concerning the approximations of values at rational points a/b of any G-function F with rational Taylor coefficients by fractions of the form n/(B…

Memory becomes a limiting factor in contemporary applications, such as analyses of the Webgraph and molecular sequences, when many objects need to be counted simultaneously. Robert Morris [Communications of the ACM, 21:840--842, 1978]…

We propose an algorithm for robust recovery of the spherical harmonic expansion of functions defined on the d-dimensional unit sphere $\mathbb{S}^{d-1}$ using a near-optimal number of function evaluations. We show that for any $f \in…

Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be…

In this paper we investigate the problem of how well points in finite dimensional p-adic solenoids can be approximated by rationals. The setting we work in was previously studied by Palmer, who proved analogues of Dirichlet's theorem and…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…

Motivated by problems arising in the relative trace formula and arithmetic invariant theory we prove the existence of rational points on orbits arising from certain infinitesimal symmetric spaces. As an application, we prove analogous…

Let $X$ be an isotropic random vector in $R^d$ that satisfies that for every $v \in S^{d-1}$, $\|<X,v>\|_{L_q} \leq L \|<X,v>\|_{L_p}$ for some $q \geq 2p$. We show that for $0<\varepsilon<1$, a set of $N = c(p,q,\varepsilon) d$ random…

In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…

Floating-point arithmetic (FPA) is a mechanical representation of real arithmetic (RA), where each operation is replaced with a rounded counterpart. Various numerical properties can be verified by using SMT solvers that support the logic of…

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

Many applications, such as system identification, classification of time series, direct and inverse problems in partial differential equations, and uncertainty quantification lead to the question of approximation of a non-linear operator…

Diophantine approximation explores how well irrational numbers can be approximated by rationals, with foundational results by Dirichlet, Hurwitz, and Liouville culminating in Roth's theorem. Schmidt's subspace theorem extends Roth's results…

Recently we introduced a class of number representations denoted RN-representations, allowing an un-biased rounding-to-nearest to take place by a simple truncation. In this paper we briefly review the binary fixed-point representation in an…

Let $K$ be a number field and $f: \mathbb{P}^1 \to \mathbb{P}^1$ a rational map of degree $d \geq 2$ with at most $s$ places of bad reduction, where we include all archimedean places. We prove that there exists constants $c_1,c_2 > 0$,…

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

In this paper, with the aid of the simplicial approximation property, the Hopf's construction and Dugundji's homotopy extension Theorem, we first show that if C is a nonempty compact convex subset of an F-space (E; || ||); then for every…