Segre-Driven Radicality Testing

We present a probabilistic algorithm to test if a homogeneous polynomial ideal I defining a scheme X in Pn is radical using Segre classes and other geometric notions from intersection theory. Its worst case complexity depends on the geometry of X . If the scheme X has reduced isolated primary components and no embedded components supported the singular locus ofXred = V( √ I), then the worst case complexity is doubly exponential in n; in all the other cases the complexity is singly exponential. The realm of the ideals for which our radical testing procedure requires only single exponential time includes examples which are often considered pathological, such as the ones drawn from the famous Mayr-Meyer set of ideals which exhibit doubly exponential complexity for the ideal membership problem.

[1]  Kazuhiro Yokoyama,et al.  Localization and Primary Decomposition of Polynomial Ideals , 1996, J. Symb. Comput..

[2]  J. Maurice Rojas,et al.  The Exact Rational Univariate Representation for Detecting Degeneracies , 2003, Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing.

[3]  J. Maurice Rojas,et al.  Solving Degenerate Sparse Polynomial Systems Faster , 1998, J. Symb. Comput..

[4]  P. Aluffi.  How many hypersurfaces does it take to cut out a Segre class , 2016, 1605.00012.

[5]  Tomás Recio,et al.  Algorithms in Algebraic Geometry and Applications , 2011 .

[6]  Jan Verschelde,et al.  Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.

[7]  P. Aluffi.  The Segre zeta function of an ideal , 2016, 1606.03098.

[8]  Gerhard Pfister,et al.  Primary Decomposition: Algorithms and Comparisons , 1997, Algorithmic Algebra and Number Theory.

[9]  J. Maurice Rojas,et al.  Toric Generalized Characteristic Polynomials , 1997, math/9702222.

[10]  Craig Huneke,et al.  Integral closure of ideals, rings, and modules , 2006 .

[11]  Bernard Mourrain,et al.  A new algorithm for the geometric decomposition of a variety , 1999, ISSAC '99.

[12]  Teresa Krick,et al.  Membership problem, Representation problem and the Computation of the Radical for one-dimensional Ideals , 1991 .

[13]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

[14]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[15]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[16]  Santiago Laplagne,et al.  An algorithm for the computation of the radical of an ideal , 2006, ISSAC '06.

[17]  Juan Sabia,et al.  Effective equidimensional decomposition of affine varieties , 2002 .

[18]  Pablo Solernó,et al.  On the Computation of the Radical of Polynomial Complete Intersection Ideals , 1995, AAECC.

[19]  D. Eisenbud,et al.  Direct methods for primary decomposition , 1992 .

[20]  Pierre Samuel,et al.  Méthodes d'algèbre abstraite en géométrie algèbrique , 1956 .

[21]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[22]  Teresa Krick,et al.  An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials , 1991, AAECC.

[23]  Y. N. Lakshman.  A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals , 1991 .

[24]  Martin Helmer,et al.  Segre class computation and practical applications , 2020, Math. Comput..

[25]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[26]  Michael Eugene Stillman,et al.  On the Complexity of Computing Syzygies , 1988, J. Symb. Comput..

[27]  Éric Schost,et al.  Sparse Rational Univariate Representation , 2017, ISSAC.

[28]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .

[29]  Wolmer V. Vasconcelos,et al.  Integral Closure: Rees Algebras, Multiplicities, Algorithms , 2005 .

[30]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[31]  Johan P. Hansen,et al.  INTERSECTION THEORY , 2011 .

[32]  John F. Canny,et al.  Generalised Characteristic Polynomials , 1990, J. Symb. Comput..

[33]  Patrizia M. Gianni,et al.  Gröbner Bases and Primary Decomposition of Polynomial Ideals , 1988, J. Symb. Comput..