2001/07/31 by Frank Sottile
Mathematics · #math.AG #msc:14P99 #msc:12D10 #msc:14N10 #msc:14N15 #msc:14M15 #msc:14M25 #msc:14M17
published as in Algorithmic and Quantitative Aspects of Real Algbraic Geometry, S. Basu and L. Gonzalez-Vega, eds., DIMACS series 60, AMS, 2003. pp. 139--180. · Revised, corrected version. 40 pages, 18 color .eps figures. Expanded web-based version at http://www.math.umass.edu/~sottile/pages/ERAG/index.html
arxiv created 2002/08/05 · arxiv updated 2009/11/30
Enumerative Geometry is concerned with the number of solutions to a structured system of polynomial equations, when the structure comes from geometry. Enumerative real algebraic geometry studies real solutions to such systems, particularly a priori information on their number. Recent results in this area have, often as not, uncovered new and unexpected phenomena, and it is far from clear what to expect in general. Nevertheless, some themes are emerging. This comprehensive article describe the current state of knowledge, indicating these themes, and suggests lines of future research. In particular, it compares the state of knowledge in Enumerative Real Algebraic Geometry with what is known about real solutions to systems of sparse polynomials.