Rekha R. Thomas – författare
Visar alla böcker från författaren Rekha R. Thomas. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Häftad, Engelska, 2006
706 kr
Skickas inom 5-8 vardagar
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for an advanced undergraduate or beginning graduate student. The book starts with the basics of polytope theory. Schlegel and Gale diagrams are introduced as geometric tools to visualize polytopes in high dimension and to unearth bizarre phenomena in polytopes. The heart of the book is a treatment of the secondary polytope of a point configuration and its connections to the state polytope of the toric ideal defined by the configuration. These polytopes are relatively recent constructs with numerous connections to discrete geometry, classical algebraic geometry, symplectic geometry, and combinatorics.The connections rely on Grobner bases of toric ideals and other methods from commutative algebra. The book is self-contained and does not require any background beyond basic linear algebra. With numerous figures and exercises, it can be used as a textbook for courses on geometric, combinatorial, and computational aspects of the theory of polytopes.
Häftad, Engelska, 2020
1 390 kr
Skickas inom 5-8 vardagar
This volume is based on lectures delivered at the 2019 AMS Short Course ""Sum of Squares: Theory and Applications'', held January 14-15, 2019, in Baltimore, Maryland. This book provides a concise state-of-the-art overview of the theory and applications of polynomials that are sums of squares. This is an exciting and timely topic, with rich connections to many areas of mathematics, including polynomial and semidefinite optimization, real and convex algebraic geometry, and theoretical computer science.The six chapters introduce and survey recent developments in this area; specific topics include the algebraic and geometric aspects of sums of squares and spectrahedra, lifted representations of convex sets, and the algorithmic and computational implications of viewing sums of squares as a meta algorithm. The book also showcases practical applications of the techniques across a variety of areas, including control theory, statistics, finance and machine learning.
Häftad, Engelska, 2012
1 719 kr
Skickas inom 5-8 vardagar
Provides a self-contained, accessible introduction to the mathematical advances and challenges resulting from the use of semidefinite programming in polynomial optimization. This quickly evolving research area with contributions from the diverse fields of convex geometry, algebraic geometry, and optimization is known as convex algebraic geometry.Each chapter addresses a fundamental aspect of convex algebraic geometry. The book begins with an introduction to nonnegative polynomials and sums of squares and their connections to semidefinite programming and quickly advances to several areas at the forefront of current research. These include:Semidefinite representability of convex sets.Duality theory from the point of view of algebraic geometry.Nontraditional topics such as sums of squares of complex forms and noncommutative sums of squares polynomials.