Related papers: A new algorithm to search for small nonzero |x^3 -…
We provide a simple way of searching for formulas of the Bailey--Borwein--Plouffe type together with an algorithm and an implementation in \texttt{sage}. Aside from rediscovering some already known formulas, the method has been used in the…
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
We construct an algorithm for the minimal model program in dimension three over the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein…
We estimate the number of solutions to $|y^2 - x^3| \leq X$ with $N \leq y \leq 2N$, in terms of both $N$ and $X$.
The PSLQ algorithm is one of the most popular algorithm for finding nontrivial integer relations for several real numbers. In the present work, we present an incremental version of PSLQ. For some applications needing to call PSLQ many…
While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and $\ell_1$, few non-trivial algorithms are known for $\ell_p$ when ($2 < p < \infty$). In this paper, we revisit this fundamental problem…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We use heuristic algorithms to find terraces for small groups. We show that Bailey's Conjecture (that all groups other than the non-cyclic elementary abelian 2-groups are terraced) holds up to order 511, except possibly at orders 256 and…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search…
This article concerns on the existence of multiple solutions for a new Kirchhoff-type problem with negative modulus. We prove that there exist three nontrivial solutions when the parameter is enough small via the variational methods and…
This paper presents a parallel algorithm for finding the smallest eigenvalue of a particular form of ill-conditioned Hankel matrix, which requires the use of extremely high precision arithmetic. Surprisingly, we find that commonly-used…
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
We show that for any even positive integer d there exist polynomials x and y with integer coefficients such that deg(x) = 2d, deg(y) = 3d and deg(x^3 - y^2) = d + 5.
We show that several versions of Floyd and Rivest's improved algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+O(n^{1/2}\ln^{1/2}n)$ comparisons on average and with high probability. This…
In this paper, an effective method with time complexity of $\mathcal{O}(K^{3/2}N^2\log \frac{K}{\epsilon_0})$ is introduced to find an approximation of the convex hull for $N$ points in dimension $n$, where $K$ is close to the number of…
Quantum $k$-minimum finding is a fundamental subroutine with numerous applications in combinatorial problems and machine learning. Previous approaches typically assume oracle access to exact function values, making it challenging to…
We determine the minimum value of thrust for a number of N-particle configurations. For N=5 in three dimensions an exact result is found for the first time. For larger N we obtain numerical results through optimisation. When a definite…
We propose a new finding $k$-minima algorithm and prove that its query complexity is $\mathcal{O}(\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the proposed is…
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n, any m x 1 vector b, and any positive real number epsilon…