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.

In this first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing. Mathematicians already aware of real algebraic geometry will find relevant information about the algorithmic aspects. Researchers in computer science and engineering will find the required mathematical background. This self-contained book is accessible to graduate and undergraduate students.

Based on lectures presented in courses on algebraic geometry taught by the author at Purdue University, this book covers various topics in the theory of algebraic curves and surfaces, such as rational and polynomial parametrization, functions and differentials on a curve, branches and valuations, and resolution of singularities.

This book is a guide to concepts and practice in numerical algebraic geometry ? the solution of systems of polynomial equations by numerical methods. Through numerous examples, the authors show how to apply the well-received and widely used open-source Bertini software package to compute solutions, including a detailed manual on syntax and usage options. The authors also maintain a complementary web page where readers can find supplementary materials and Bertini input files. Numerically Solving Polynomial Systems with Bertini approaches numerical algebraic geometry from a user's point of view with numerous examples of how Bertini is applicable to polynomial systems. It treats the fundamental task of solving a given polynomial system and describes the latest advances in the field, including algorithms for intersecting and projecting algebraic sets, methods for treating singular sets, the nascent field of real numerical algebraic geometry, and applications to large polynomial systems arising from differential equations. Those who wish to solve polynomial systems can start gently by finding isolated solutions to small systems, advance rapidly to using algorithms for finding positive-dimensional solution sets (curves, surfaces, etc.), and learn how to use parallel computers on large problems. These techniques are of interest to engineers and scientists in fields where polynomial equations arise, including robotics, control theory, economics, physics, numerical PDEs, and computational chemistry.

Bridging a number of mathematical disciplines, and exposing many facets of systems of polynomial equations, Bernd Sturmfels's study covers a wide spectrum of mathematical techniques and algorithms, both symbolic and numerical.

Literaturverz. S. 267 - 269

The images in this book are in color. For a less-expensive grayscale paperback version, see ISBN 9781680923254. Prealgebra 2e is designed to meet scope and sequence requirements for a one-semester prealgebra course. The text introduces the fundamental concepts of algebra while addressing the needs of students with diverse backgrounds and learning styles. Each topic builds upon previously developed material to demonstrate the cohesiveness and structure of mathematics. Students who are taking basic mathematics and prealgebra classes in college present a unique set of challenges. Many students in these classes have been unsuccessful in their prior math classes. They may think they know some math, but their core knowledge is full of holes. Furthermore, these students need to learn much more than the course content. They need to learn study skills, time management, and how to deal with math anxiety. Some students lack basic reading and arithmetic skills. The organization of Prealgebra makes it easy to adapt the book to suit a variety of course syllabi.

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.

College Algebra provides a comprehensive exploration of algebraic principles and meets scope and sequence requirements for a typical introductory algebra course. The modular approach and richness of content ensure that the book meets the needs of a variety of courses. College Algebra offers a wealth of examples with detailed, conceptual explanations, building a strong foundation in the material before asking students to apply what they've learned. Coverage and Scope In determining the concepts, skills, and topics to cover, we engaged dozens of highly experienced instructors with a range of student audiences. The resulting scope and sequence proceeds logically while allowing for a significant amount of flexibility in instruction. Chapters 1 and 2 provide both a review and foundation for study of Functions that begins in Chapter 3. The authors recognize that while some institutions may find this material a prerequisite, other institutions have told us that they have a cohort that need the prerequisite skills built into the course. Chapter 1: Prerequisites Chapter 2: Equations and Inequalities Chapters 3-6: The Algebraic Functions Chapter 3: Functions Chapter 4: Linear Functions Chapter 5: Polynomial and Rational Functions Chapter 6: Exponential and Logarithm Functions Chapters 7-9: Further Study in College Algebra Chapter 7: Systems of Equations and Inequalities Chapter 8: Analytic Geometry Chapter 9: Sequences, Probability and Counting Theory

This book offers fascinating and modern perspectives into the theory and practice of the historical subject of polynomial root-finding, rejuvenating the field via polynomiography, a creative and novel computer visualization that renders spectacular images of a polynomial equation. Polynomiography will not only pave the way for new applications of polynomials in science and mathematics, but also in art and education. The book presents a thorough development of the basic family, arguably the most fundamental family of iteration functions, deriving many surprising and novel theoretical and practical applications such as: algorithms for approximation of roots of polynomials and analytic functions, polynomiography, bounds on zeros of polynomials, formulas for the approximation of Pi, and characterizations or visualizations associated with a homogeneous linear recurrence relation. These discoveries and a set of beautiful images that provide new visions, even of the well-known polynomials and recurrences, are the makeup of a very desirable book. This book is a must for mathematicians, scientists, advanced undergraduates and graduates, but is also for anyone with an appreciation for the connections between a fantastically creative art form and its ancient mathematical foundations.