Related papers: Approximation simultan\'ee d'un nombre et de son c…
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…
Let $\tau$ and $\sigma$ be two polygonal curves in $\mathbb{R}^d$ for any fixed $d$. Suppose that $\tau$ and $\sigma$ have $n$ and $m$ vertices, respectively, and $m\le n$. While conditional lower bounds prevent approximating the Fr\'echet…
We generalize the construction of Roy's Fibonacci type numbers to the case of a Sturmian recurrence and we determine the classical exponents of approximation $\omega_2(\xi)$, $\widehat{\omega}_2(\xi)$, $\lambda_2(\xi)$,…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…
We consider the fundamental learning problem of estimating properties of distributions over large domains. Using a novel piecewise-polynomial approximation technique, we derive the first unified methodology for constructing sample- and…
Let $p$ be a prime number and $\xi$ an irrational $p$-adic number. Its multiplicative irrationality exponent ${{\mu^{\times}}} (\xi)$ is the supremum of the real numbers ${{\mu^{\times}}}$ for which the inequality $$ |b \xi - a|_{p} \leq |…
By assuming some widely-believed arithmetic conjectures, we show that the task of accepting a number that is representable as a sum of $d\geq2$ squares subjected to given congruence conditions is NP-complete. On the other hand, we develop…
The Fr\'echet distance is a commonly used similarity measure between curves. It is known how to compute the continuous Fr\'echet distance between two polylines with $m$ and $n$ vertices in $\mathbb{R}^d$ in $O(mn (\log \log n)^2)$ time;…
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time $O(mn)$, dates back to K\"{o}nig's work in 1916 (here $m=nd$ is the…
Within the study of parametric geometry of numbers W. Schmidt and L. Summerer introduced so-called regular graphs. Roughly speaking the successive minima functions for the classical simultaneous Diophantine approximation problem have a very…
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…
Based on two previous papers, the physical meaning of synchronization and simultaneity as is presented in Einstein's Special Relativity paper of 1905 is reconsidered. We follow Einstein's argumentation to introduce a criterium of…
In 1982, A. K. Lenstra, H. W. Lenstra, and L. Lov\'asz introduced the first polynomial-time method to factor a nonzero polynomial $f \in \mathbb{Q}[x]$ into irreducible factors. This algorithm, now commonly referred to as the LLL Algorithm,…
Results on the rational approximation of functions containing singularities are presented. We build further on the ''lightning method'', recently proposed by Trefethen and collaborators, based on exponentially clustering poles close to the…
The Fr\'echet distance is a commonly used distance measure for curves. Computing the Fr\'echet distance between two polygonal curves of $n$ vertices takes roughly quadratic time, and conditional lower bounds suggest that approximating to…
The Pareto sum of two-dimensional point sets $P$ and $Q$ in $\mathbb{R}^2$ is defined as the skyline of the points in their Minkowski sum. The problem of efficiently computing the Pareto sum arises frequently in bi-criteria optimization…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…