## Detecting lacunary perfect powers and computing their roots (2009)

### Cached

### Download Links

- [www.cecm.sfu.ca]
- [www.cecm.sfu.ca]
- [www.cecm.sfu.ca]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Citations: | 3 - 0 self |

### BibTeX

@TECHREPORT{Giesbrecht09detectinglacunary,

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

title = {Detecting lacunary perfect powers and computing their roots},

institution = {},

year = {2009}

}

### OpenURL

### Abstract

We consider the problem of determining whether a lacunary (also called a sparse or super-sparse) polynomial f is a perfect power, that is, f = h r for some other polynomial h and r ∈ N, and of finding h and r should they exist. We show how to determine if f is a perfect power in time polynomial in the number of non-zero terms of f, and in terms of log deg f, i.e., polynomial in the size of the lacunary representation. The algorithm works over Fq[x] (for large characteristic) and over Z[x], where the cost is also polynomial in log ‖f‖∞. We also give a Monte Carlo algorithm to find h if it exists, for which our proposed algorithm requires polynomial time in the output size, i.e., the sparsity and height of h. Conjectures of Erdös and Schinzel, and recent work of Zannier, suggest that h must be sparse. Subject to a slightly stronger conjectures we give an extremely efficient algorithm to find h via a form of sparse Newton iteration. We demonstrate the efficiency of these algorithms with an implementation using the C++ library NTL. 1.

### Citations

467 | zur Gathen and - von - 1997 |

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

111 | On some exponential sums - WEIL - 1948 |

103 | A deterministic algorithm for sparse multivariate polynominal interpolation - Ben-Or, Tiwari - 1988 |

74 | Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications - Lidl, Niederreiter - 1983 |

52 | Fast Construction of Irreducible Polynomials over Finite Fields - Shoup - 1994 |

48 | The matching problem for bipartite graphs with polynomially bounded permanents is in NC (extended abstract - Grigoriev, Karpinski - 1987 |

48 | An inequality about factors of polynomials - Mignotte - 1974 |

45 | Factoring polynomials over algebraic number fields is in polynomial time - LANDAU - 1985 |

43 | Detecting perfect powers in essentially linear time
- Bernstein
- 1998
(Show Context)
Citation Context ...and practice) to find h given f = h r is by a Newton iteration. This technique has also proven to be efficient in computing perfect roots of (dense) multi-precision integers (Bach and Sorenson, 1993; =-=Bernstein, 1998-=-). In summary however, we note that both these methods require approximately linear time in the degree of f, which may be exponential in the lacunary size. Newton iteration has also been applied to fi... |

26 | Early termination in sparse interpolation algorithms - Kaltofen, Lee - 2003 |

25 |
On squarefree decomposition algorithms
- YUN
(Show Context)
Citation Context ...thods Two well-known techniques can be applied to the problem of testing for perfect powers, and both are very efficient when f = h r is dense. We can compute the squarefree decomposition of f as in (=-=Yun, 1976-=-), and determine whether f is a perfect power by checking whether the greatest (integer) common divisor of the exponents of all nontrivial factors in the squarefree decomposition is at least 2. An eve... |

18 | Finding small degree factors of lacunary polynomials - Lenstra - 1999 |

16 | A polynomial time algorithm for Diophantine equations in one variable
- Cucker, Koiran, et al.
- 1999
(Show Context)
Citation Context ...2000), and Kaltofen and Lee (2003)) and complexity (e.g., Karpinski and Shparlinski (1999), Quick (1986), and von zur Gathen et al. (1993)), to recent breakthroughs in root finding and factorization (=-=Cucker et al., 1999-=-; Kaltofen and Koiran, 2006; Lenstra, 1999), these works have important theoretical and practical consequences. The lacunary representation is arguably more intuitive than the standard dense represent... |

16 | Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields - Kaltofen, Koiran - 2006 |

14 | Sparse complex polynomials and polynomial reducibility - Plaisted - 1977 |

11 | On the computational hardness of testing square-freeness of sparse polynomials,” Applied algebra, algebraic algorithms and error-correcting codes - Karpinski, Shparlinski - 1999 |

10 |
Sieve algorithms for perfect power testing
- Bach, Sorenson
- 1993
(Show Context)
Citation Context ...faster method (in theory and practice) to find h given f = h r is by a Newton iteration. This technique has also proven to be efficient in computing perfect roots of (dense) multi-precision integers (=-=Bach and Sorenson, 1993-=-; Bernstein, 1998). In summary however, we note that both these methods require approximately linear time in the degree of f, which may be exponential in the lacunary size. Newton iteration has also b... |

8 | Polynomials whose powers are sparse - Coppersmith, Davenport - 1991 |

7 | Sparse squares of polynomials - Abbott |

7 | Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials - Kaltofen - 1986 |

5 | Interpolation of polynomials given by straight-line programs - Garg, Schost |

4 |
On the number of terms of a power of a polynomial
- Schinzel
- 1987
(Show Context)
Citation Context ...ed by Erdös (1949) on the number of terms in the square of a polynomial. Schinzel extended this work to the case of perfect powers and proved that τ(h r ) tends to infinity as τ(h) tends to infinity (=-=Schinzel, 1987-=-). Some conjectures of Schinzel suggest that τ(h) should be O(τ(f)). A recent breakthrough of Zannier (2007) show that τ(h) is bounded by a function which does not depend on deg f, but this bound is u... |

3 | On Lacunary Polynomial Perfect Powers
- Giesbrecht, Roche
(Show Context)
Citation Context ... Finally, in Section 4, we present an experimental implementation of some of our algorithms in the C++ library NTL. An earlier version of some of this work was presented in the ISSAC 2008 conference (=-=Giesbrecht and Roche, 2008-=-). ∗ c We employ soft-Oh notation: for functions σ and ϕ we say σ ∈ O˜(ϕ) if σ ∈ O(ϕlog ϕ) for some constant c > 0. 32. Testing for perfect powers In this section we describe a method to determine if... |

3 | Some gcd and divisibility problems for sparse polynomials - Quick - 1986 |

3 | On the number of terms of a composite polynomial - Zannier - 2007 |

2 | On the number of terms of the square of a polynomial - Erdös - 1949 |

1 | Computing Jacobi symbols modulo sparse integers and polynomials and some applications - Shparlinski |