English
Related papers

Related papers: Segre-Driven Radicality Testing

200 papers

We propose an explicit formula for the Segre classes of monomial subschemes of nonsingular varieties, such as schemes defined by monomial ideals in projective space. The Segre class is expressed as a formal integral on a region bounded by…

Algebraic Geometry · Mathematics 2013-07-04 Paolo Aluffi

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

Computational Complexity · Computer Science 2025-03-27 Abhibhav Garg , Rafael Oliveira , Nitin Saxena

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

Algebraic Geometry · Mathematics 2018-11-20 J. B. Lasserre , M. Laurent , P. Rostalski

We express the Segre class of a monomial scheme -- or, more generally, a scheme monomially supported on a set of divisors cutting out complete intersections -- in terms of an integral computed over an associated body in euclidean space. The…

Algebraic Geometry · Mathematics 2021-02-08 Paolo Aluffi

Let $X \subset Y$ be closed (possibly singular) subschemes of a smooth projective toric variety $T$. We show how to compute the Segre class $s(X,Y)$ as a class in the Chow group of $T$. Building on this, we give effective methods to compute…

Algebraic Geometry · Mathematics 2019-05-31 Corey Harris , Martin Helmer

Among the several types of closures of an ideal $I$ that have been defined and studied in the past decades, the integral closure $\bar{I}$ has a central place being one of the earliest and most relevant. Despite this role, it is often a…

Commutative Algebra · Mathematics 2007-05-23 Alberto Corso , Craig Huneke , Wolmer V. Vasconcelos

The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…

Computational Complexity · Computer Science 2025-07-18 Leonie Kayser

Monomial ideals and toric rings are closely related. By consider a Grobner basis we can always associated to any ideal $I$ in a polynomial ring a monomial ideal ${\rm in}_\prec I$, in some special situations the monomial ideal ${\rm…

Commutative Algebra · Mathematics 2014-01-17 Marcel Morales

Let $X_{\Sigma}$ be a smooth complete toric variety defined by a fan $\Sigma$ and let $V=V(I)$ be a subscheme of $X_{\Sigma}$ defined by an ideal $I$ homogeneous with respect to the grading on the total coordinate ring of $X_{\Sigma}$. We…

Algebraic Geometry · Mathematics 2017-11-15 Martin Helmer

A fundamental property of Segre classes is their birational invariance. This invariance implies that the Segre class of a closed subscheme only depends on the integral closure of the defining ideal sheaf. In this paper, we show that,…

Algebraic Geometry · Mathematics 2025-12-10 Yairon Cid-Ruiz

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

Commutative Algebra · Mathematics 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

We study the behavior of multidegrees in families and the existence of numerical criteria to detect integral dependence. We show that mixed multiplicities of modules are upper semicontinuous functions when taking fibers and that projective…

Commutative Algebra · Mathematics 2024-05-14 Yairon Cid-Ruiz , Claudia Polini , Bernd Ulrich

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

Combinatorics · Mathematics 2015-09-11 Carsten Conradi , Thomas Kahle

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of…

Number Theory · Mathematics 2019-04-11 Elżbieta Adamus , Paweł Bogdan

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

Symbolic Computation · Computer Science 2007-05-23 Guillaume Moroz

In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…

Rings and Algebras · Mathematics 2018-04-27 Jakob Cimprič , J. William Helton , Igor Klep , Scott McCullough , Christopher Nelson

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Computational Complexity · Computer Science 2022-10-28 Robert Andrews , Michael A. Forbes

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

Symbolic Computation · Computer Science 2007-05-23 Mohab Safey El Din , Philippe Trebuchet

We generalize Fulton's Residual Intersection Theorem for the Segre class and express the Segre classes of schemes with regularly embedded components in terms of the Chern classes of the normal bundles to the components and their…

Algebraic Geometry · Mathematics 2025-11-11 Guanxi Li

We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…

Data Structures and Algorithms · Computer Science 2020-05-12 Cornelius Brand , Kevin Pratt
‹ Prev 1 2 3 10 Next ›