Improved Algebraic Degeneracy Testing

12/06/2022
by   Jean Cardinal, et al.
0

In the classical linear degeneracy testing problem, we are given n real numbers and a k-variate linear polynomial F, for some constant k, and have to determine whether there exist k numbers a_1,…,a_k from the set such that F(a_1,…,a_k) = 0. We consider a generalization of this problem in which F is an arbitrary constant-degree polynomial, we are given k sets of n numbers, and have to determine whether there exist a k-tuple of numbers, one in each set, on which F vanishes. We give the first improvement over the naïve O^*(n^k-1) algorithm for this problem (where the O^*(·) notation omits subpolynomial factors). We show that the problem can be solved in time O^*( n^k - 2 + 4/k+2) for even k and in time O^*( n^k - 2 + 4k-8/k^2-5) for odd k in the real RAM model of computation. We also prove that for k=4, the problem can be solved in time O^*(n^2.625) in the algebraic decision tree model, and for k=5 it can be solved in time O^*(n^3.56) in the same model, both improving on the above uniform bounds. All our results rely on an algebraic generalization of the standard meet-in-the-middle algorithm for k-SUM, powered by recent algorithmic advances in the polynomial method for semi-algebraic range searching. In fact, our main technical result is much more broadly applicable, as it provides a general tool for detecting incidences and other interactions between points and algebraic surfaces in any dimension. In particular, it yields an efficient algorithm for a general, algebraic version of Hopcroft's point-line incidence detection problem in any dimension.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets

We present subquadratic algorithms, in the algebraic decision-tree model...
research
09/18/2023

Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits

For every constant d, we design a subexponential time deterministic algo...
research
11/23/2022

Improved Elekes-Szabó type estimates using proximity

We prove a new Elekes-Szabó type estimate on the size of the intersectio...
research
03/04/2019

An Adaptive Grid Algorithm for Computing the Homology Group of Semialgebraic Set

Looking for an efficient algorithm for the computation of the homology g...
research
03/12/2018

Dedekind Zeta Zeroes and Faster Complex Dimension Computation

Thanks to earlier work of Koiran, it is known that the truth of the Gene...
research
12/26/2018

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Guth showed that given a family S of n g-dimensional semi-algebraic sets...
research
02/26/2019

On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond

We consider the following variant of the Mortality Problem: given k× k m...

Please sign up or login with your details

Forgot password? Click here to reset