Related papers: A Tripos Surd
The quartet distance is a measure of similarity used to compare two unrooted phylogenetic trees on the same set of $n$ leaves, defined as the number of subsets of four leaves related by a different topology in both trees. After a series of…
In this paper, we present an improved continued fraction approximation of the Wallis ratio. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the double-side inequality related to…
We find the closest approximation to 1 from below using a sum of $n$ Egyptian fractions.
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…
We study strong approximation for the intersection of two affine quadrics. As its application, we prove the fibration method for weak approximation over number fields of rank four with nonsplit fibers split by quadratic extensions.
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b, c, d \in…
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…
A systematic study of the trigonometric equation A tan a + B sin b = C, where A, B and C^2 are rational numbers. The special case tan Pi/11 + 4 sin 3 Pi/11 = sqrt[11] appears in the classical literature.
We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…
A promising theory of quaternion-valued functions of one quaternionic variable, now called slice regular functions, has been introduced in 2006. The basic examples of slice regular functions are power series centered at 0 on their balls of…
We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…
Building on a classification of zeros of cubic equations due to the $12$-th century Persian mathematician Sharaf al-Din Tusi, together with Smale's theory of {\it point estimation}, we derive an efficient recipe for computing high-precision…
An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…
Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy…
Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.