- Series
- Algebra Seminar
- Time
- Monday, September 16, 2013 - 3:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Sal Barone – Georgia Tech – sbarone@math.gatech.edu – http://people.math.gatech.edu/~sbarone7/
- Organizer
- Salvador Barone

**Please Note:** Joint work with Saugata Basu sbasu@math.purdue.edu On a real analogue of Bezout inequality and the number of connected components of sign conditions. http://arxiv.org/abs/1303.1577

It is a classical problem in real algebraic geometry to try to obtain tight bounds on the number of connected components of semi-algebraic sets, or more generally to bound the higher Betti numbers, in terms of some measure of complexity of the polynomials involved (e.g., their number, maximum degree, and number of variables or so-called dense format). Until recently, most of the known bounds relied ultimately on the Oleinik-Petrovsky-Thom-Milnor bound of d(2d-1)^{k-1} on the number of connected components of an algebraic subset of R^k defined by polynomials of degree at most d, and hence the resulting bounds depend on only the maximum degree of the polynomials involved. Motivated by some recent results following the Guth-Katz solution to one of Erdos' hard problems, the distinct distance problem in the plane, we proved that in fact a more refined dependence on the degrees is possible, namely that the number of connected components of sign conditions, defined by k-variate polynomials of degree d, on a k'-dimensional variety defined by polynomials of degree d_0, is bounded by (sd)^k' d_0^{k−k'} O(1)^k. Our most recent work takes this refinement of the dependence on the degrees even further, obtaining what could be considered a real analogue to the classical Bezout inequality over algebraically closed fields.