Emerging Applications of Algebraic Geometry


Book Description

Recent advances in both the theory and implementation of computational algebraic geometry have led to new, striking applications to a variety of fields of research. The articles in this volume highlight a range of these applications and provide introductory material for topics covered in the IMA workshops on "Optimization and Control" and "Applications in Biology, Dynamics, and Statistics" held during the IMA year on Applications of Algebraic Geometry. The articles related to optimization and control focus on burgeoning use of semidefinite programming and moment matrix techniques in computational real algebraic geometry. The new direction towards a systematic study of non-commutative real algebraic geometry is well represented in the volume. Other articles provide an overview of the way computational algebra is useful for analysis of contingency tables, reconstruction of phylogenetic trees, and in systems biology. The contributions collected in this volume are accessible to non-experts, self-contained and informative; they quickly move towards cutting edge research in these areas, and provide a wealth of open problems for future research.




Using Algebraic Geometry


Book Description

An illustration of the many uses of algebraic geometry, highlighting the more recent applications of Groebner bases and resultants. Along the way, the authors provide an introduction to some algebraic objects and techniques more advanced than typically encountered in a first course. The book is accessible to non-specialists and to readers with a diverse range of backgrounds, assuming readers know the material covered in standard undergraduate courses, including abstract algebra. But because the text is intended for beginning graduate students, it does not require graduate algebra, and in particular, does not assume that the reader is familiar with modules.




Computations in Algebraic Geometry with Macaulay 2


Book Description

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.




Algebraic Geometry and Its Applications


Book Description

This volume covers many topics, including number theory, Boolean functions, combinatorial geometry, and algorithms over finite fields. It contains many new, theoretical and applicable results, as well as surveys that were presented by the top specialists in these areas. New results include an answer to one of Serre's questions, posted in a letter to Top; cryptographic applications of the discrete logarithm problem related to elliptic curves and hyperelliptic curves; construction of function field towers; construction of new classes of Boolean cryptographic functions; and algorithmic applications of algebraic geometry.




Semidefinite Optimization and Convex Algebraic Geometry


Book Description

An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science.




Positive Polynomials


Book Description

Positivity is one of the most basic mathematical concepts, involved in many areas of mathematics (analysis, real algebraic geometry, functional analysis, etc.). The main objective of the book is to give useful characterizations of polynomials. Beyond basic knowledge in algebra, only valuation theory as explained in the appendix is needed.




Rigid Analytic Geometry and Its Applications


Book Description

Rigid (analytic) spaces were invented to describe degenerations, reductions, and moduli of algebraic curves and abelian varieties. This work, a revised and greatly expanded new English edition of an earlier French text by the same authors, presents important new developments and applications of the theory of rigid analytic spaces to abelian varieties, "points of rigid spaces," étale cohomology, Drinfeld modular curves, and Monsky-Washnitzer cohomology. The exposition is concise, self-contained, rich in examples and exercises, and will serve as an excellent graduate-level text for the classroom or for self-study.




Quantum Mechanics Built on Algebraic Geometry


Book Description

This book presents a novel standpoint concerning contemporary physics, namely, quantum mechanics with a view toward algebraic geometry. As is well-known, algebraic geometry is the study of geometric objects delineated by polynomials, and the polynomial representations are ubiquitous in physics. For this reason, quantum mechanics is also an object of algebraic geometry. An example is the eigenvalue problem. It is a set of polynomial equations and has traditionally been the question of linear algebra. However, the modern method of computational algebraic geometry accurately unravels the information encapsulated in the polynomials. This approach shall not remain as a plaything. It has betokened an innovative style of electronic structure computation. The objects of this new method include the simultaneous determination of the wave-functions and the movements of nuclei, or the prediction of the required structure that shall show the desired property. Accordingly, this book explains the basic ideas of computational algebraic geometry and related topics, such as Groebner bases, primary ideal decomposition, Dmodules, Galois, class field theory, etc. The intention of the author is, nevertheless, not to give an irksome list of abstract concepts. He hopes that the readers shall use algebraic geometry as the active tool of the computations. For this reason, this book abundantly presents the model computations, by which the readers shall learn how to apply algebraic geometry toward quantum mechanics. The readers shall also see the modern computer algebra could facilitate the study when you would like to apply abstract mathematical ideas to definite physical problems.




Algebraic Geometry For Robotics And Control Theory


Book Description

The development of inexpensive and fast computers, coupled with the discovery of efficient algorithms for dealing with polynomial equations, has enabled exciting new applications of algebraic geometry and commutative algebra. Algebraic Geometry for Robotics and Control Theory shows how tools borrowed from these two fields can be efficiently employed to solve relevant problem arising in robotics and control theory.After a brief introduction to various algebraic objects and techniques, the book first covers a wide variety of topics concerning control theory, robotics, and their applications. Specifically this book shows how these computational and theoretical methods can be coupled with classical control techniques to: solve the inverse kinematics of robotic arms; design observers for nonlinear systems; solve systems of polynomial equalities and inequalities; plan the motion of mobile robots; analyze Boolean networks; solve (possibly, multi-objective) optimization problems; characterize the robustness of linear; time-invariant plants; and certify positivity of polynomials.




Applications of Algebraic Topology


Book Description

This monograph is based, in part, upon lectures given in the Princeton School of Engineering and Applied Science. It presupposes mainly an elementary knowledge of linear algebra and of topology. In topology the limit is dimension two mainly in the latter chapters and questions of topological invariance are carefully avoided. From the technical viewpoint graphs is our only requirement. However, later, questions notably related to Kuratowski's classical theorem have demanded an easily provided treatment of 2-complexes and surfaces. January 1972 Solomon Lefschetz 4 INTRODUCTION The study of electrical networks rests upon preliminary theory of graphs. In the literature this theory has always been dealt with by special ad hoc methods. My purpose here is to show that actually this theory is nothing else than the first chapter of classical algebraic topology and may be very advantageously treated as such by the well known methods of that science. Part I of this volume covers the following ground: The first two chapters present, mainly in outline, the needed basic elements of linear algebra. In this part duality is dealt with somewhat more extensively. In Chapter III the merest elements of general topology are discussed. Graph theory proper is covered in Chapters IV and v, first structurally and then as algebra. Chapter VI discusses the applications to networks. In Chapters VII and VIII the elements of the theory of 2-dimensional complexes and surfaces are presented.