Corpus ID: 238353974

Segre-Driven Radicality Testing

  title={Segre-Driven Radicality Testing},
  author={Martin Helmer and Elias P. Tsigaridas},
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… Expand


Segre class computation and practical applications
Effective methods to compute intersection products in projective varieties, to determine algebraic multiplicity without working in local rings, and to test pairwise containment of subvarieties of a smooth projective toric variety are given. Expand
Effective equidimensional decomposition of affine varieties
In this paper we present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V, the decomposition of V into equidimensional components. If V isExpand
Direct methods for primary decomposition
SummaryLetI be an ideal in a polynomial ring over a perfect field. We given new methods for computing the equidimensional parts and radical ofI, for localizingI with respect to another ideal, andExpand
How many hypersurfaces does it take to cut out a Segre class
Abstract We prove an identity of Segre classes for zero-schemes of compatible sections of two vector bundles. Applications include bounds on the number of equations needed to cut out a scheme withExpand
Toric Generalized Characteristic Polynomials
Since the sparse resultant is used, complexity bounds for converting any input polynomial system into a multilinear factorization problem are close to cubic in the degree of the underlying variety -- significantly better than previous bounds which were pseudo-polynomial in the classical B\'ezout bound. Expand
The Segre zeta function of an ideal
Abstract We define a power series associated with a homogeneous ideal in a polynomial ring, encoding information on the Segre classes defined by extensions of the ideal in projective spaces ofExpand
Gröbner Bases and Primary Decomposition of Polynomial Ideals
This work presents an algorithm to compute the primary decomposition of any ideal in a polynomialring over a factorially closed algorithmic principal ideal domain R and shows how the reduction process can be applied to computing radicals and testing ideals for primality. Expand
Primary Decomposition: Algorithms and Comparisons
Three results are obtruned, which provide partial remedies for shortcomings in Hilbert series and degree bounds in the modular case and are a generalization of Goobel’s degree bound to the case of monomial representations. Expand
Complexity of Zero-dimensional Gröbner Bases
In this paper, it is shown that the Grobner basis (for any monomial ordering) of a zero-dimensional ideal may be computed within a bit complexity which is essentially polynomial in $D^n$ where $n$ isExpand
Segre Numbers and Hypersurface Singularities
We define the Segre numbers of an ideal as a generalization of the multiplicity of an ideal of finite colength. We prove generalizations of various theorems involving the multiplicity of an idealExpand