Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation

by   Vincent Neiger, et al.

Suppose 𝕂 is a large enough field and π’«βŠ‚π•‚^2 is a fixed, generic set of points which is available for precomputation. We introduce a technique called reshaping which allows us to design quasi-linear algorithms for both: computing the evaluations of an input polynomial f βˆˆπ•‚[x,y] at all points of 𝒫; and computing an interpolant f βˆˆπ•‚[x,y] which takes prescribed values on 𝒫 and satisfies an input y-degree bound. Our genericity assumption is explicit and we prove that it holds for most point sets over a large enough field. If 𝒫 violates the assumption, our algorithms still work and the performance degrades smoothly according to a distance from being generic. To show that the reshaping technique may have an impact on other related problems, we apply it to modular composition: suppose generic polynomials M βˆˆπ•‚[x] and A βˆˆπ•‚[x] are available for precomputation, then given an input f βˆˆπ•‚[x,y] we show how to compute f(x, A(x)) rem M(x) in quasi-linear time.


page 1

page 2

page 3

page 4

βˆ™ 09/02/2020

Computing critical points for invariant algebraic systems

Let 𝐊 be a field and Ο•, 𝐟 = (f_1, …, f_s) in 𝐊[x_1, …, x_n] be multivari...
βˆ™ 01/31/2020

Essentially Optimal Sparse Polynomial Multiplication

We present a probabilistic algorithm to compute the product of two univa...
βˆ™ 03/30/2018

Delaunay Triangulations of Points on Circles

Delaunay triangulations of a point set in the Euclidean plane are ubiqui...
βˆ™ 05/09/2016

Critical Point Computations on Smooth Varieties: Degree and Complexity bounds

Let V βŠ‚ C n be an equidimensional algebraic set and g be an n-variate po...
βˆ™ 04/25/2018

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs

We present a quasi linear-time algorithm for Maximum Matching on distanc...
βˆ™ 04/02/2021

On the computation of asymptotic critical values of polynomial maps and applications

Let 𝐟 = (f_1, …, f_p) be a polynomial tuple in β„š[z_1, …, z_n] and let d ...
βˆ™ 07/13/2018

First steps towards a formalization of Forcing

We lay the ground for an Isabelle/ZF formalization of Cohen's technique ...

Please sign up or login with your details

Forgot password? Click here to reset