Polyhedral Computation


Book Description




Polyhedral and Algebraic Methods in Computational Geometry


Book Description

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems and techniques that refer to polyhedral structures. The authors include a study on algorithms for computing convex hulls as well as the construction of Voronoi diagrams and Delone triangulations. The second part of the book develops the primary concepts of (non-linear) computational algebraic geometry. Here, the book looks at Gröbner bases and solving systems of polynomial equations. The theory is illustrated by applications in computer graphics, curve reconstruction and robotics. Throughout the book, interconnections between computational geometry and other disciplines (such as algebraic geometry, optimization and numerical mathematics) are established. Polyhedral and Algebraic Methods in Computational Geometry is directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.




Polyhedral Computation


Book Description

Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general-purpose algorithms. They are, however, highly structured, and attention has turned to exploiting this structure, particularly symmetry. Initial applications of this approach have permitted computations previously far out of reach, but much remains to be understood and validated experimentally. The papers in this volume give a good snapshot of the ideas discussed at a Workshop on Polyhedral Computation held at the CRM in Montréal in October 2006 and,




Computing the Continuous Discretely


Book Description

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart’s theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler–Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: “You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.” — MAA Reviews “The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography.” — Zentralblatt MATH “This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.” — Mathematical Reviews “Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course.” — CHOICE




Polyhedra


Book Description

Polyhedra have cropped up in many different guises throughout recorded history. In modern times, polyhedra and their symmetries have been cast in a new light by combinatorics an d group theory. This book comprehensively documents the many and varied ways that polyhedra have come to the fore throughout the development of mathematics. The author strikes a balance between covering the historical development of the theory surrounding polyhedra, and presenting a rigorous treatment of the mathematics involved. It is attractively illustrated with dozens of diagrams to illustrate ideas that might otherwise prove difficult to grasp. Historians of mathematics, as well as those more interested in the mathematics itself, will find this unique book fascinating.




Automated Technology for Verification and Analysis


Book Description

Annotation. This book constitutes the refereed proceedings of the 8th International Symposium on Automated Technology for Verification and Analysis, ATVA 2010, held in Singapore, in September 2010. The book includes 3 invited talks, 21 regular papers and 9 tool papers.




Computational Geometry of Positive Definite Quadratic Forms


Book Description

"Starting from classical arithmetical questions on quadratic forms, this book takes the reader step by step through the connections with lattice sphere packing and covering problems. As a model for polyhedral reduction theories of positive definite quadratic forms, Minkowski's classical theory is presented, including an application to multidimensional continued fraction expansions. The reduction theories of Voronoi are described in great detail, including full proofs, new views, and generalizations that cannot be found elsewhere. Based on Voronoi's second reduction theory, the local analysis of sphere coverings and several of its applications are presented. These include the classification of totally real thin number fields, connections to the Minkowski conjecture, and the discovery of new, sometimes surprising, properties of exceptional structures such as the Leech lattice or the root lattices." "Throughout this book, special attention is paid to algorithms and computability, allowing computer-assisted treatments. Although dealing with relatively classical topics that have been worked on extensively by numerous authors, this book is exemplary in showing how computers may help to gain new insights."--BOOK JACKET.




Convex Polytopes


Book Description

"The original edition [...] inspired a whole generation of grateful workers in polytope theory. Without it, it is doubtful whether many of the subsequent advances in the subject would have been made. The many seeds it sowed have since grown into healthy trees, with vigorous branches and luxuriant foliage. It is good to see it in print once again." --Peter McMullen, University College London




Computer Algebra in Scientific Computing


Book Description

This book constitutes the proceedings of the 24th International Workshop on Computer Algebra in Scientific Computing, CASC 2022, which took place in Gebze, Turkey, in August 2022. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of scientific computing with regard to their benefit from or use of computer algebra methods and software.




Mathematics and Computation


Book Description

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography