Elimination Theory in Codimension Two

We describe a class of affine toric varieties $V$ that are set-theoretically minimally defined by codim $V+1$ binomial equations over fields of any characteristic.

Let X be a complete toric variety with homogeneous coordinate ring S. In this article, we compute upper and lower bounds for the codimension in the critical degree of ideals of S generated by dim(X)+1 homogeneous polynomials that don't vanish simultaneously on X.

We give an explicit combinatorial presentation of the Chow groups of a toric scheme over a DVR. As an application, we compute the Chow groups of several toric schemes over a DVR and of their special fibers.

We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric varieties as well as algorithms checking properties (i) and (ii) and further potential properties, in Particular a weaker version of (ii) asking for scheme-theoretic definition in degree 2.

The discriminant of a polynomial map is central to problems from affine geometry and singularity theory. Standard methods for characterizing it rely on elimination techniques that can often be ineffective. This paper concerns polynomial maps on the two-dimensional torus defined over a field of Puiseux series. We present a combinatorial procedure for computing the tropical curve of the discriminant of maps determined by generic polynomials with given supports. Our results enab...

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its degree is a function of the mixed volumes of the Newton polytopes. We sketch the sparse resultant constructions of Canny and Emiris and show how they reduce the problem of root-finding to an eigenproblem. A novel method for achieving this ...

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate hyperplanes, these formulae are also the tightest possible upper bounds on the number of isolated roots. We also characterize, in terms of sparse resultants, precisely when these upper bounds are attained. Finally, we reformulate and extend...

Let $\Delta$ denote the discriminant of a generic binary $d$-ic. We show that for $d \ge 3$, the Jacobian ideal of $\Delta$ is perfect of height 2. Moreover, we describe its SL_2-equivariant minimal resolution, and the associated invariant differential equations satisfied by $\Delta$. A similar result is proved for the resultant of two forms of orders $d,e$, whenever $d \ge e-1$. We also explain the role of the Morley form in the determinantal formula for the resultant; this ...

We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and straight--line programs. For sequential time complexity measured by network size we obtain the following result: it is possible to solve any affine or toric zero--dimensional equation system in non--uniform sequential time which is polynomial in the len...

Here we develop a technique of computing the invariants of $n-$ary forms and systems of forms using the discriminants of corresponding multilinear forms built of their partial derivatives, which should be cosidered as analogues of classical discriminants and resultants for binary forms.