Strong bi-homogeneous B\'{e}zout theorem and its use in effective real algebraic geometry

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 degree of the critical locus of P restricted to V is bounded by D^s(D-1)^(n-s) times binomial of n and n-s. This result is obtained in two steps. First the critical points of P restricted to V are characterized as projections of the solutions of Lagrange's system for which a bi-homogeneous structure is exhibited. Secondly we prove a bi-homogeneous B\'ezout Theorem, which bounds the sum of the degrees of the equidimensional components of the radical of an ideal generated by a bi-homogeneous polynomial family. This result is improved when f1,..., fs is a regular sequence. Moreover, we use Lagrange's system to design an algorithm computing at least one point in each connected component of a smooth real algebraic set. This algorithm generalizes, to the non equidimensional case, the one of Safey El Din and Schost. The evaluation of the output size of this algorithm gives new upper bounds on the first Betti number of a smooth real algebraic set. Finally, we estimate its arithmetic complexity and prove that in the worst cases it is polynomial in n, s, D^s(D-1)^(n-s) and the binomial of n and n-s, and the complexity of evaluation of f1,..., fs

Newton polytopes and numerical algebraic geometry

We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership algorithm which uses the former algorithm as a subroutine. Based on recent results of Esterov, we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular. Prior to explaining these results, we give necessary background on polytopes, algebraic geometry, monodromy groups of branched covers, and numerical algebraic geometry.Comment: 150 pages, 65 figures, contains content from arXiv:1811.12279 and arXiv:2001.0422

Newton Polytopes and Numerical Algebraic Geometry

We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership algorithm which uses the former algorithm as a subroutine. Based on recent results of Esterov, we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular. Prior to explaining these results, we give necessary background on polytopes, algebraic geometry, monodromy groups of branched covers, and numerical algebraic geometry

Toric Varieties and Numerical Algorithms for Solving Polynomial Systems

This work utilizes toric varieties for solving systems of equations. In particular, it includes two numerical homotopy continuation algorithms for numerically solving systems of equations. The first algorithm, the Cox homotopy, solves a system of equations on a compact toric variety. The Cox homotopy tracks points in the total coordinate space of the toric variety and can be viewed as a homogeneous version of the polyhedral homotopy of Huber and Sturmfels. The second algorithm, the Khovanskii homotopy, solves a system of equations on a variety in the presence of a finite Khovanskii basis. This homotopy takes advantage of Anderson’s flat degeneration to a toric variety. The Khovanskii homotopy utilizes the Newton-Okounkov body of the system, whose normalized volume gives a bound on the number of solutions to the system. Both homotopy algorithms provide the computational advantage of tracking paths in a compact space while also minimizing the total number of paths tracked. The Khovanskii homotopy is optimal with respect to the number of paths tracked, and the Cox homotopy is optimal when the system is Bernstein-general

Homotopy algorithms for solving structured determinantal systems

Multivariate polynomial systems arising in numerous applications have special structures. In particular, determinantal structures and invariant systems appear in a wide range of applications such as in polynomial optimization and related questions in real algebraic geometry. The goal of this thesis is to provide efficient algorithms to solve such structured systems. In order to solve the first kind of systems, we design efficient algorithms by using the symbolic homotopy continuation techniques. While the homotopy methods, in both numeric and symbolic, are well-understood and widely used in polynomial system solving for square systems, the use of these methods to solve over-detemined systems is not so clear. Meanwhile, determinantal systems are over-determined with more equations than unknowns. We provide probabilistic homotopy algorithms which take advantage of the determinantal structure to compute isolated points in the zero-sets of determinantal systems. The runtimes of our algorithms are polynomial in the sum of the multiplicities of isolated points and the degree of the homotopy curve. We also give the bounds on the number of isolated points that we have to compute in three contexts: all entries of the input are in classical polynomial rings, all these polynomials are sparse, and they are weighted polynomials. In the second half of the thesis, we deal with the problem of finding critical points of a symmetric polynomial map on an invariant algebraic set. We exploit the invariance properties of the input to split the solution space according to the orbits of the symmetric group. This allows us to design an algorithm which gives a triangular description of the solution space and which runs in time polynomial in the number of points that we have to compute. Our results are illustrated by applications in studying real algebraic sets defined by invariant polynomial systems by the means of the critical point method

Variétés bipolaires et résolution d’une équation polynomiale réelle

In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. In the present paper we introduce a natural construction that allows to tackle the case of a non–smooth real hypersurface by means of a reduction to a smooth complete intersection.Nous avons décrit précédemment un algorithme efficace qui exhibe un point représentatif (algébrique) par composante connexe d’une intersection complète réelle lisse. Ce processus est basé sur l’exploitation des propriétés géométriques des variétés polaires génériques et sa complexité est intrinsèque au problème. Nous introduisons ici une construction naturelle nous permettant de traiter le cas d’une hypersurface singulière par réduction à une situation intersection complète lisse

On the intrinsic complexity of the arithmetic Nullstellensatz

We show several arithmetic estimates for Hilbert's Nullstellensatz. This includes an algorithmic procedure computing the polynomials and constants occurring in a Bézout identity, whose complexity is polynomial in the geometric degree of the system. Moreover, we show for the first time height estimates of intrinsic type for the polynomials and constants appearing, again polynomial in the geometric degree and linear in the height of the system. These results are based on a suitable representation of polynomials by straight-line programs and duality techniques using the Trace Formula for Gorenstein algebras. As an application we show more precise upper bounds for the function πS(x) counting the number of primes yielding an inconsistent modular polynomial equation system. We also give a computationally interesting lower bound for the density of small prime numbers of controlled bit length for the reduction to positive characteristic of inconsistent systems. Again, this bound is given in terms of intrinsic parameters.Facultad de Ciencias Exacta

On the intrinsic complexity of the arithmetic Nullstellensatz

We show several arithmetic estimates for Hilbert's Nullstellensatz. This includes an algorithmic procedure computing the polynomials and constants occurring in a Bézout identity, whose complexity is polynomial in the geometric degree of the system. Moreover, we show for the first time height estimates of intrinsic type for the polynomials and constants appearing, again polynomial in the geometric degree and linear in the height of the system. These results are based on a suitable representation of polynomials by straight-line programs and duality techniques using the Trace Formula for Gorenstein algebras. As an application we show more precise upper bounds for the function πS(x) counting the number of primes yielding an inconsistent modular polynomial equation system. We also give a computationally interesting lower bound for the density of small prime numbers of controlled bit length for the reduction to positive characteristic of inconsistent systems. Again, this bound is given in terms of intrinsic parameters.Facultad de Ciencias Exacta

Progress in Commutative Algebra 2

This is the second of two volumes of a state-of-the-art survey article collection which originates from three commutative algebra sessions at the 2009 Fall Southeastern American Mathematical Society Meeting at Florida Atlantic University. The articles reach into diverse areas of commutative algebra and build a bridge between Noetherian and non-Noetherian commutative algebra. These volumes present current trends in two of the most active areas of commutative algebra: non-noetherian rings (factorization, ideal theory, integrality), and noetherian rings (the local theory, graded situation, and interactions with combinatorics and geometry). This volume contains surveys on aspects of closure operations, finiteness conditions and factorization. Closure operations on ideals and modules are a bridge between noetherian and nonnoetherian commutative algebra. It contains a nice guide to closure operations by Epstein, but also contains an article on test ideals by Schwede and Tucker and more