## Interpolation of Shifted-Lacunary Polynomials (2010)

### BibTeX

@MISC{Giesbrecht10interpolationof,

author = {Mark Giesbrecht and Daniel S. Roche},

title = { Interpolation of Shifted-Lacunary Polynomials },

year = {2010}

}

### OpenURL

### Abstract

Given a “black box” function to evaluate an unknown rational polynomial f ∈ Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t ∈ Z>0, the shift α ∈ Q, the exponents 0 ≤ e1 <e2 < ·· · <et, and the coefficients c1,...,ct ∈ Q \{0} such that f(x) =c1(x − α) e1 + c2(x − α) e2 + ···+ ct(x − α) et. The computed sparsity t is absolutely minimal over any shifted power basis. The novelty of our algorithm is that the complexity is polynomial in the (sparse) representation size, which may be logarithmic in the degree of f. Our method combines previous celebrated results on sparse interpolation and computing sparsest shifts, and provides a way to handle polynomials with extremely high degree which are, in some sense, sparse in information.

### Citations

296 | Approximate formulas for some functions of prime numbers - Rosser, Schoenfeld - 1962 |

151 | Fast multiplication of polynomials over arbitrary algebras - Cantor, Kaltofen - 1991 |

101 | The Computational Complexity of Algebraic and Numeric Problems - Borodin, Munro - 1975 |

89 | A Deterministic Algorithm For Sparse Multivariate Polynomial Interpolation - BEN-OR, TIWARI - 1988 |

39 | The matching problem for bipartite graphs with polynomially bounded permanents is in NC - Grigoriev, Karpinski |

32 | Symbolic-numeric sparse interpolation of multivariate polynomials - Giesbrecht, Labahn, et al. |

17 | Primality testing with Gaussian periods
- Pomerance
- 2005
(Show Context)
Citation Context ... O(n log log log n) bit operations (see Knuth (1981), Section 4.5.4), and returns O(n/ log n) primesqbetween n and 2n. Each primality test of kq +1canbedonewith(logn) 6+o(1) bit operations (Lenstra & =-=Pomerance 2005-=-), so the total cost is O(n2 (log n) 5+o(1) )bitoperations. Since n ∈ O((β1 + β2 + ℓ) · log(β1 + β2 + ℓ)) the stated complexity follows. □ The analysis of our methods will be significantly improved wh... |

16 | Modular rational sparse multivariate polynomial interpolation - Kaltofen, Lakshman, et al. - 1990 |

13 | A zero-test and an interpolation algorithm for the shifted sparse polynomials - Grigoriev, Karpinski - 1993 |

10 | Algorithms for computing sparse shifts for multivariate polynomials - Grigoriev, Lakshman - 1995 |

9 | On the decidability of sparse univariate polynomial interpolation (preliminary version - BORODIN, TIWARI - 1990 |

9 | Interpolation of shifted-lacunary polynomials
- Giesbrecht, Roche
- 2010
(Show Context)
Citation Context ...nomial-time algorithm which should be correct on most input, though it could certainly be fooled into early termination. This is a significant improvement over the algorithms from our original paper (=-=Giesbrecht & Roche 2007-=-), which had a dominating factor of B78 f in the deterministic complexity. Also – and somewhat surprisingly – our algorithm is competitive even with the best-known sparsest shift algorithms which requ... |

5 | Deterministically testing sparse polynomial identities of unbounded degree - Bläser, Hardt, et al. |

4 | Newton-hensel interpolation lifting - Avendaño, Krick, et al. |

4 | Algebra Engrg - Appl - 1996 |

2 | Carmichael’s lambda function, Acta Arith. 58 - Erdős, Pomerance, et al. - 1991 |

2 | Notes on polynomial and rational function interpolation - Kaltofen - 1988 |

2 |
On primes in arithmetic progressions. Tsukuba journal of mathematics 25(1
- Mikawa
- 2001
(Show Context)
Citation Context ...lified here, and the use of (unknown) constants is made more explicit. This will be important in our computational methods. For q ∈ Z, letS(q) be the smallest prime p such that q | (p − 1). Fact 4.1 (=-=Mikawa 2001-=-). There exists a constant μ>0, such that for all n> μ, and for all integers q ∈{n,...,2n} with fewer than μn/ log 2 n exceptions, we have S(q) <q 1.89 . Our algorithms for generating useful primes re... |

1 | 410(27–29) (2009), 2659–2662. of shifted-lacunary polynomials 21 J. von zur Gathen - Gerhard - 2003 |

1 | Kaltofen & Wen-shin Lee, Algorithms for computing sparsest shifts of polynomials in power, Chebyshev and Pochhammer bases - Giesbrecht, E |

1 | 2 edition, 1981. Giesbrecht & Roche comput - Addison-Wesley |