Born in 1970 in Ezpeleta (Argentina), Martín Sombra studied Mathematics as an undergraduate at the University of La Plata. He did his PhD thesis on Computer Algebra at the University of Buenos Aires. He then did postdoctoral stays at the MSRI at Berkeley, the IAS at Princeton, and the IMJ at Paris. He became Maître de Conférences at the University of Lyon 1, then spent four years as a "Ramón y Cajal" Researcher at the University of Barcelona, and became afterwards Full Professor at the University of Bordeaux 1. He finally moved back to Barcelona, joining ICREA in 2009. He works on problems at the interface of Algebraic Geometry, Number Theory and Complexity Theory. He currently collaborates with research groups in Barcelona, Paris, Caen, Bordeaux and Buenos Aires.
Polynomials appear in a wide variety of contexts in Mathematics, Engineering and Computer Science. Polynomials in those situations are not random but come up with a certain structure which is important to exploit. I am interested in systems of structured polynomial equations and particularly in questions like: how many solutions does a given system have? How complicated those solutions can be? Can we predict where they will accumulate? Can we efficiently solve systems of polynomial equations? These problems have conduced me to study combinatorial objects like polytopes and fans, geometrical objects like curves and surfaces, and arithmetic objects like height of points and Diophantine equations. This gives a rich interplay between Complexity Theory, Combinatorics, Algebraic Geometry and Number Theory, leading to interesting results and stimulating research directions.
Key wordsAlgebraic & Diophantine geometry, Arakelov theory, incidence geometry, combinatorics, computer algebra, complexity of algorithms