Article

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields

Authors:

Erich Kaltofen,

Pascal KoiranAuthors Info & Claims

ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Pages 162 - 168

https://doi.org/10.1145/1145768.1145798

Published: 09 July 2006 Publication History

Abstract

We present algorithms that compute all irreducible factors of degree ≤ d of supersparse (lacunary) multivariate polynomials in n variables over an algebraic number field in deterministic polynomial-time in (l+d)ⁿ, where l is the size of the input polynomial. In supersparse polynomials, the term degrees enter logarithmically as their numbers of binary digits into the size measure l. The factors are again represented as supersparse polynomials. If the factors are represented as straight-line programs or black box polynomials, we can achieve randomized polynomial-time in (l+d)^O(1). Our approach follows that by H. W. Lenstra, Jr., on computing factors of univariate supersparse polynomials over algebraic number fields. We generalize our ISSAC 2005 results for computing linear factors of supersparse bivariate polynomials over the rational numbers by appealing to recent lower bounds on the height of algebraic numbers and to a special case of the former Lang conjecture.

References

[1]

Amoroso, F., and Zannier, U. A relative Dobrowolski lower bound over Abelian varieties. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) XXIX (2000), 711--727.

[2]

Cucker, F., Koiran, P., and Smale, S. A polynomial time algorithm for diophantine equations in one variable. J. Symbolic Comput. 27, 1 (1999), 21--29.

Digital Library

[3]

von zur Gathen, J., and Kaltofen, E. Factoring sparse multivariate polynomials. J. Comput. System Sci. 31 (1985), 265--287.

Digital Library

[4]

Gyõry, K., Iwaniec, H., and Urbanowicz, J., Eds. Number Theory in Progress (1999), vol. 1 Diophantine Problems and Polynomials, Stefan Banach Internat. Center, Walter de Gruyter Berlin/New York. Proc. Internat. Conf. Number Theory in Honor of the 60th Birthday of Andrzej Schinzel, Zakopane, Poland June 30-July 9, 1997.

[5]

Hindry, M., and Silverman, J. H. Diophantine Geometry: An Introduction. Springer Verlag, Heidelberg, Germany, 2000.

[6]

Humphreys, J. E. Linear Algebraic Groups. Springer Verlag, New York, 1975.

[7]

Kaltofen, E. Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. SIAM J. Comput. 14, 2 (1985), 469--489.

Digital Library

[8]

Kaltofen, E. Greatest common divisors of polynomials given by straight-line programs. J. ACM 35, 1 (1988), 231--264.

Digital Library

[9]

Kaltofen, E. Factorization of polynomials given by straight-line programs. In Randomness and Computation, S. Micali, Ed., vol. 5 of Advances in Computing Research. JAI Press Inc., Greenwhich, Connecticut, 1989, pp. 375--412.

[10]

Kaltofen, E. Polynomial factorization 1987-1991. In Proc. LATIN '92 (Heidelberg, Germany, 1992), I. Simon, Ed., vol. 583 of Lect. Notes Comput. Sci., Springer Verlag, pp. 294--313.

Digital Library

[11]

Kaltofen, E., and Koiran, P. On the complexity of factoring bivariate supersparse (lacunary) polynomials. In ISSAC'05 Proc. 2005 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2005), M. Kauers, Ed., ACM Press, pp. 208-215. ACM SIGSAM's ISSAC 2005 Distinguished Paper Award.

Digital Library

[12]

Kaltofen, E., and Lee, W. Early termination in sparse interpolation algorithms. J. Symbolic Comput. 36, 3--4 (2003), 365--400. Special issue Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2002). Guest editors: M. Giusti & L. M. Pardo.

Digital Library

[13]

Kaltofen, E., and Trager, B. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput. 9, 3 (1990), 301--320.

Digital Library

[14]

Lang, S. Algebra. Addison-Wesley, 1993.

[15]

Laurent, M. Equations diophantiennes exponentielles. Inventiones Mathematicae 78, 2 (1984), 299--327.

[16]

Lenstra, Jr., H. W. Finding small degree factors of lacunary polynomials. In Gyõry et al. {4}, pp. 267--276.

[17]

Lenstra, Jr., H. W. On the factorization of lacunary polynomials. In Gyõry et al. {4}, pp. 277--291.

[18]

Plaisted, D. A. New NP-hard and NP-complete polynomial and integer divisibility problems. Theoretical Comput. Sci. 13 (1984), 125--138.

[19]

van der Waerden, B. L. Moderne Algebra. Springer Verlag, Berlin, 1940. English transl. publ. under the title "Modern algebra" by F. Ungar Publ. Co., New York, 1953.

[20]

Waldschmidt, M. Diophantine approximation on linear algebraic groups. Springer Verlag, Heidelberg, Germany, 2000.

[21]

Zippel, R. E. Probabilistic algorithms for sparse polynomials. PhD thesis, Massachusetts Inst. of Technology, Cambridge, USA, Sept. 1979.

Cited By

Roche DKauers MOvchinnikov ASchost É(2018)What Can (and Can't) we Do with Sparse Polynomials?Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3208976.3209027(25-30)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3208976.3209027
Grenet B(2016)LacunaryxACM Communications in Computer Algebra10.1145/2893803.289380749:4(121-124)Online publication date: 17-Feb-2016
https://dl.acm.org/doi/10.1145/2893803.2893807
Grenet B(2016)Bounded-degree factors of lacunary multivariate polynomialsJournal of Symbolic Computation10.1016/j.jsc.2015.11.01375:C(171-192)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1016/j.jsc.2015.11.013
Show More Cited By

Index Terms

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

On the complexity of factoring bivariate supersparse (Lacunary) polynomials
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computation

We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size. In supersparse polynomials, the term degrees can have hundreds of digits ...
Factoring bivariate lacunary polynomials without heights
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation

We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap theorem which allows to test whether P(X)=∑^k_j=1 α_jX^αj(1+X)^βjis identically zero in polynomial time. The algorithm we obtain is ...
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
ISSAC '14: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation

We present a new algorithm for the computation of the irreducible factors of degree at most d, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the computation of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation

July 2006

374 pages

ISBN:1595932763

DOI:10.1145/1145768

General Chair:
Barry Trager
IBM T.J. Watson Research Center, USA

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ISSAC06

Sponsor:

ISSAC06: International Symposium on Symbolic and Algebraic Computation

July 9 - 12, 2006

Genoa, Italy

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
171
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Roche DKauers MOvchinnikov ASchost É(2018)What Can (and Can't) we Do with Sparse Polynomials?Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3208976.3209027(25-30)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3208976.3209027
Grenet B(2016)LacunaryxACM Communications in Computer Algebra10.1145/2893803.289380749:4(121-124)Online publication date: 17-Feb-2016
https://dl.acm.org/doi/10.1145/2893803.2893807
Grenet B(2016)Bounded-degree factors of lacunary multivariate polynomialsJournal of Symbolic Computation10.1016/j.jsc.2015.11.01375:C(171-192)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1016/j.jsc.2015.11.013
Grenet BNagasaka KWinkler FSzanto A(2014)Computing low-degree factors of lacunary polynomialsProceedings of the 39th International Symposium on Symbolic and Algebraic Computation10.1145/2608628.2608649(224-231)Online publication date: 23-Jul-2014
https://dl.acm.org/doi/10.1145/2608628.2608649
Wu WChen JFeng Y(2014)Sparse bivariate polynomial factorizationScience China Mathematics10.1007/s11425-014-4850-y57:10(2123-2142)Online publication date: 26-Jun-2014
https://doi.org/10.1007/s11425-014-4850-y
Kaltofen E(2014)Symbolic Computation and Complexity Theory Transcript of My TalkComputer Mathematics10.1007/978-3-662-43799-5_1(3-7)Online publication date: 1-Oct-2014
https://doi.org/10.1007/978-3-662-43799-5_1
Mullen GPanario D(2013)CryptographyHandbook of Finite Fields10.1201/b15006-22(777-860)Online publication date: 17-Jun-2013
https://doi.org/10.1201/b15006-22
Chattopadhyay AGrenet BKoiran PPortier NStrozecki YMonagan MCooperman GGiesbrecht M(2013)Factoring bivariate lacunary polynomials without heightsProceedings of the 38th International Symposium on Symbolic and Algebraic Computation10.1145/2465506.2465932(141-148)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2465506.2465932
Kaltofen ENehring MSchost ÉEmiris I(2011)Supersparse black box rational function interpolationProceedings of the 36th international symposium on Symbolic and algebraic computation10.1145/1993886.1993916(177-186)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.1145/1993886.1993916
Pébay PMaurice Rojas JThompson D(2011)Optimizing n-variate (n+k)-nomials for small kTheoretical Computer Science10.1016/j.tcs.2010.11.053412:16(1457-1469)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1016/j.tcs.2010.11.053
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten