Related papers: A Tripos Surd
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…
The auxiliary latitudes are essential tools in cartography. This paper summarizes methods for converting between them with an emphasis on providing full double-precision accuracy. This includes series expansions in the third flattening,…
We show that there is a sequence of zeros of $\mathop{\mathcal R}(s)$ in the fourth quadrant. We show that the $n$-th zero $\rho_{-n}=\beta_{-n}+i\gamma_{-n}$, with $\beta_{-n}\sim 4\pi^2 n/\log^2n$ and $\gamma_{-n}\sim-4\pi n/\log n$. We…
We consider sparsity-based techniques for the approximation of high-dimensional functions from random pointwise evaluations. To date, almost all the works published in this field contain some a priori assumptions about the error corrupting…
We prove a discrete approximation of functionals with jumps and creases.
A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…
We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…
The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…
According to the Abel-Ruffini theorem [1] and Galois theory [2], there is no solution in finite radicals to the general quintic equation. This article takes a different approach and proposes a new method to solve the quintic by iteration of…
In 1969, H. Davenport and W. Schmidt established a measure of simultaneous approximation for a real number \xi and its square by rational numbers with the same denominator, assuming only that \xi is not rational nor quadratic over Q. Here,…
We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We…
In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…
In this paper we are concerned with the asymptotic behavior of \[ \operatorname{tr}(\mathcal{L}^+_{\rm sq}) = \frac{1}{4} \sum_{j,k=0 \atop (j,k) \neq (0,0)}^{n-1} \frac{1}{1-\frac{1}{2} \big( \cos \frac{2\pi j}{n} + \cos \frac{2\pi k}{n}…
A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are…
We consider the (real) fourth Painlev\'e equation in which both parameters vanish, analyzing the square-roots of its solutions and paying special attention to their zeros.
A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…
The greatest root distribution occurs everywhere in classical multivariate analysis, but even under the null hypothesis the exact distribution has required extensive tables or special purpose software. We describe a simple approximation,…
We present a short elementary proof of the well-known criterion for a cubic polynomial to have three real roots. The proof is based on Fermat's approach to calculus for polynomials. This approach illustrates the idea of a derivative…
We propose a numerical analysis of a simplified version of the previous paper "Multiplicity hunting and approximating multiple roots of polynomial systems" written by the two authors.
We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.