Related papers: A new algorithm to search for small nonzero |x^3 -…
This paper is a preliminary report on our search for new good examples of Hall's Conjecture. We present a new algorithm that will detect all good examples within a given search space. We have implemented the algorithm, and our executions…
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…
For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are bounded above. (Elkies has shown that any such…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
The papers shows an algorithm to search for approximations of reals to rationals of the form a/b^2 that runs on \sqrt(b) polynomial time steps.
We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously…
A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…
An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with norm…
We introduce a new deterministic factoring algorithm, which could be described in the cryptographically fashionable term of "factoring with hints": we show that, given the knowledge of the factorisations of $O(N^{1/3+\epsilon})$ terms…
We make several improvements to methods for finding integer solutions to $x^3+y^3+z^3=k$ for small values of $k$. We implemented these improvements on Charity Engine's global compute grid of 500,000 volunteer PCs and found new…
Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
A certain number of lists of small Salem numbers, some of which are certified as complete, are available online. Notably, the website of M. J. Mossinghoff features a list of 47 Salem numbers smaller than 1.3, as well as complete lists of…
We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.
The standard quantum search lacks a feature, enjoyed by many classical algorithms, of having a fixed point, i.e. monotonic convergence towards the solution. Recently a fixed point quantum search algorithm has been discovered, referred to as…
By systematically applying ten inequivalent two-part relations between hypergeometric sums 3F2(1) to the published database of all such sums, 66 new sums are obtained. Many results extracted from the literature are shown to be special cases…
A new algorithm allows us to calculate many new tilting characters for $SL_3$, $SP_4$, $G_2$, $SL_4$ and potentially many other groups. These calculations show that the Lusztig-Williamson Billiards Conjecture needs to be corrected. In this…
Let K = Q(t1,..,tk) and a,b,c in K. We give a simple algorithm to find, if it exists, X,Y,Z in K, not all zero, for which aX^2 + bY^2 + cZ^2 = 0.
The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…
The search for a point set configurations of the R^3 space which contains the smallest value of the Euclidean Steiner Ratio is almost finished. In the present work we introduce some analytical methods which aim to support a famous…