The computational complexity of the Chow form

Gabriela Jeronimo; Teresa Krick; Juan Sabia; Martin Sombra

Home/Archive/arXiv

arXiv · math/0210009

The computational complexity of the Chow form

Gabriela Jeronimo·Teresa Krick·Juan Sabia·Martin Sombra

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system defining the variety. In particular, it provides an alternative algorithm for the equidimensional decomposition of a variety. As an application we obtain an algorithm for the computation of a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As a further application, we derive an algorithm for the computation of the (unique) solution of a generic over-determined equation system.

Explore related subjects

math.AG math.AC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Gabriela Jeronimo, Teresa Krick, Juan Sabia, Martin Sombra. 2002-10-01. The computational complexity of the Chow form. https://arxiv.org/abs/math/0210009

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Braid and Phantom

Let N be the moduli space of stable rank 2 vector bundles on a smooth projective curve of genus g>1 with fixed odd determinant. With Sebastian Torres, we previously found a semi-orthogonal decomposition of the bounded derived category of N into bounded derived categories of symmetric powers of the curve and, possibly, a phantom block. In this work, we employ the theory of weaving patterns to eliminate the possibility of a phantom, completing the proof of the decomposition conjectured by Narasimhan and, independently, by Belmans, Galkin, and Mukhopadhyay.

math.AG↗

arXiv2026

On the Alexander polynomials of conic-line arrangements

In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen pencils of index $k\geq 2$. Then we apply them to the Hesse arrangement of conics and to some of its degenerations. The results are completed by computations using computer algebra. In particular, we construct conic-line arrangements which are non-reduced pencil-type arrangements and have as roots of their Alexander polynomials roots of unity of order 7. Such roots are not known and are conjectured not to exist in the class of line arrangements.

math.AG↗

arXiv2026

On the Tensor Property of Bernstein-Sato Polynomial

We prove the multiplicative Thom-Sebastiani rule for Bernstein-Sato polynomials, answering the longstanding questions of Budur and Popa. We generalize the result to the tensor of two effective divisors on the product of two arbitrary non-singular complex varieties. This also leads to a multiplicative property related to Igusa's strong monodromy conjecture. Moreover, we propose an extension of our result to Bernstein-Sato polynomials for ideals and prove it for monomial ideals.

math.AG↗