Martín Sombra

Bio: Martín Sombra is an academic researcher from University of Barcelona. The author has contributed to research in topics: Toric variety & Polynomial. The author has an hindex of 20, co-authored 80 publications receiving 1149 citations. Previous affiliations of Martín Sombra include University of Paris & National University of La Plata.

Sharp estimates for the arithmetic Nullstellensatz

Abstract: We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over the integer ring ℤ. The result improves previous work of P. Philippon, C. Berenstein and A. Yger, and T. Krick and L. M. Pardo. We also present degree and height estimates of intrinsic type, which depend mainly on the degree and the height of the input polynomial system. As an application we derive an effective arithmetic Nullstellensatz for sparse polynomial systems. The proof of these results relies heavily on the notion of local height of an affine variety defined over a number field. We introduce this notion and study its basic properties.

Arithmetic Geometry of Toric Varieties: Metrics, Measures and Heights

Abstract: We show that the height of a toric variety with respect to a toric metrized line bundle can be expressed as the integral over a polytope of a certain adelic family of concave functions. To state and prove this result, we study the Arakelov geometry of toric varieties. In particular, we consider models over a discrete valuation ring, metrized line bundles, and their associated measures and heights. We show that these notions can be translated in terms of convex analysis, and are closely related to objects like polyhedral complexes, concave functions, real Monge-Amp\`ere measures, and Legendre-Fenchel duality. We also present a closed formula for the integral over a polytope of a function of one variable composed with a linear form. This allows us to compute the height of toric varieties with respect to some interesting metrics arising from polytopes. We also compute the height of toric projective curves with respect to the Fubini-Study metric, and of some toric bundles.

The Computational Complexity of the Chow Form

Abstract: We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.

Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze

Abstract: We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitization of rational maps and the effective Nullstellensatz over a variety. Our treatment is based on arithmetic intersection theory in products of projective spaces and extends to the arithmetic setting constructions and results due to Jelonek. A key role is played by the notion of canonical mixed heights of multiprojective varieties. We study this notion from the point of view of resultant theory and establish some of its basic properties, including its behavior with respect to intersections, projections and products. We obtain analogous results for the function field case, including a parametric Nullstellensatz.

Convergence of Probability Measures

Abstract: Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

Abstract: In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the associated linear operator maps the cone of positive semidefinite matrices onto itself. In this case, the optimal value equals the spectral radius of the operator. It is shown that some rank minimization problems, as well as generalizations of the structured singular value ($mu$) LMIs, have exactly this property. In the same spirit of exploiting structure to achieve computational efficiency, an algorithm for the numerical solution of a special class of frequency-dependent LMIs is presented. These optimization problems arise from robustness analysis questions, via the Kalman-Yakubovich-Popov lemma. The procedure is an outer approximation method based on the algorithms used in the computation of hinf norms for linear, time invariant systems. The result is especially useful for systems with large state dimension. The other main contribution in this thesis is the formulation of a convex optimization framework for semialgebraic problems, i.e., those that can be expressed by polynomial equalities and inequalities. The key element is the interaction of concepts in real algebraic geometry (Positivstellensatz) and semidefinite programming. To this end, an LMI formulation for the sums of squares decomposition for multivariable polynomials is presented. Based on this, it is shown how to construct sufficient Positivstellensatz-based convex tests to prove that certain sets are empty. Among other applications, this leads to a nonlinear extension of many LMI based results in uncertain linear system analysis. Within the same framework, we develop stronger criteria for matrix copositivity, and generalizations of the well-known standard semidefinite relaxations for quadratic programming. Some applications to new and previously studied problems are presented. A few examples are Lyapunov function computation, robust bifurcation analysis, structured singular values, etc. It is shown that the proposed methods allow for improved solutions for very diverse questions in continuous and combinatorial optimization.

Modern computer algebra

Abstract: Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany oneor two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.