The ideology of the theory of fewnomials is the following: real varieties defined by "simple", not cumbersome, systems of equations should have a "simple" topology. One of the results of the theory is a real transcendental analogue of the Bezout theorem: for a large class of systems of *k transcendental equations in *k real variables, the number of roots is finite and can be explicitly estimated from above via the "complexity" of the system. A more general result is the construction of a category of real transcendental manifolds that resemble algebraic varieties in their properties. These results give new information on level sets of elementary functions and even on algebraic equations. The topology of geometric objects given via algebraic equations (real-algebraic curves, surfaces, singularities, etc.) quickly becomes more complicated as the degree of the equations increases. It turns out that the complexity of the topology depends not on the degree of the equations but only on the number of monomials appearing in them. This book provides a number of theorems estimating the complexity of the topology of geometric objects via the cumbersomeness of the defining equations. In addition, the author presents a version of the theory of fewnomials based on the model of a dynamical system in the plane. Pfaff equations and Pfaff manifolds are also studied.

This volume corresponds to the Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, held from February 28-March 5, 2010. It contains a sample of advanced algorithmic techniques underpinning the solution of systems of polynomial equations. The papers are written by leading experts in algorithmic algebraic geometry and examine core topics.

Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a difficult problem with many applications outside of mathematics. While it is hopeless to expect much in general, we know a surprising amount about these questions for systems which possess additional structure often coming from geometry. This book focuses on equations from toric varieties and Grassmannians. Not only is much known about these, but such equations are common in applications. There are three main themes: upper bounds on the number of real solutions, lower bounds on the number of real solutions, and geometric problems that can have all solutions be real. The book begins with an overview, giving background on real solutions to univariate polynomials and the geometry of sparse polynomial systems. The first half of the book concludes with fewnomial upper bounds and with lower bounds to sparse polynomial systems. The second half of the book begins by sampling some geometric problems for which all solutions can be real, before devoting the last five chapters to the Shapiro Conjecture, in which the relevant polynomial systems have only real solutions.

The book consists of solicited articles from a select group of mathematicians and physicists working at the interface between positivity and the geometry, combinatorics or analysis of polynomials of one or several variables. It is dedicated to the memory of Julius Borcea (1968-2009), a distinguished mathematician, Professor at the University of Stockholm. With his extremely original contributions and broad vision, his impact on the topics of the planned volume cannot be underestimated. All contributors knew or have exchanged ideas with Dr. Borcea, and their articles reflect, at least partially, his heritage.

Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of current research. The articles are based on talks given at the DIMACS Workshop on ''Algorithmic and Quantitative Aspects of Real Algebraic Geometry''. Topics include deciding basic algebraic properties of real semi-algebraic sets, application of quantitative results in real algebraic geometry towards investigating the computational complexity of various problems, algorithmic and quantitative questions in real enumerative geometry, new approaches towards solving decision problems in semi-algebraic geometry, as well as computing algebraic certificates, and applications of real algebraic geometry to concrete problems arising in robotics and computer graphics. The book is intended for researchers interested in computational methods in algebra.

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its Applications on September 2006 is one tangible indication of the interest. This volume of articles captures some of the spirit of the IMA workshop.

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and