Michael Joswig – författare

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.

The goal of this book is to explain, at the graduate student level, connections between tropical geometry and optimization. Building bridges between these two subject areas is fruitful in two ways. Through tropical geometry optimization algorithms become applicable to questions in algebraic geometry. Conversely, looking at topics in optimization through the tropical geometry lens adds an additional layer of structure. The author covers contemporary research topics that are relevant for applications such as phylogenetics, neural networks, combinatorial auctions, game theory, and computational complexity. This self-contained book grew out of several courses given at Technische Universitat Berlin and elsewhere, and the main prerequisite for the reader is a basic knowledge in polytope theory. It contains a good number of exercises, many examples, beautiful figures, as well as explicit tools for computations using $\texttt{polymake}$.

This book constitutes the proceedings of the 7th International Conference on Mathematical Software, ICMS 2020, held in Braunschweig, Germany, in July 2020.

This book presents version 1.0 of the new Computer Algebra System OSCAR.Written in Julia, OSCAR builds on and vastly extends four cornerstone systems:ANTIC for number theory, GAP for group and representation theory,  polymake for polyhedral and tropical geometry, and  Singular for commutative algebra and algebraic geometry.It offers powerful computational tools that transcend the boundaries of the individual disciplines involved.It is freely available, open source software. The book is an invitation to use OSCAR.  With discussions of theoretical and algorithmic aspects included, it offers a multitude of explicit code snippets.  These are valuable for interested researchers from graduate students through established experts.

In many fields of modern mathematics specialised scientific software becomes increasingly important. Hence, tremendous effort is taken by numerous groups all over the world to develop appropriate solutions.This book contains surveys and research papers on mathematical software and algorithms. The common thread is that the field of mathematical applications lies on the border between algebra and geometry. Topics include polyhedral geometry, elimination theory, algebraic surfaces, Grobner bases, triangulations of point sets and the mutual relationship. This diversity is accompanied by the abundance of available software systems which often handle only special mathematical aspects. Therefore the volume's other focus is on solutions towards the integration of mathematical software systems. This includes low-level and XML based high-level communication channels as well as general framework for modular systems.

In many fields of modern mathematics specialised scientific software becomes increasingly important. Hence, tremendous effort is taken by numerous groups all over the world to develop appropriate solutions.This book contains surveys and research papers on mathematical software and algorithms. The common thread is that the field of mathematical applications lies on the border between algebra and geometry. Topics include polyhedral geometry, elimination theory, algebraic surfaces, Gröbner bases, triangulations of point sets and the mutual relationship. This diversity is accompanied by the abundance of available software systems which often handle only special mathematical aspects. Therefore the volume's other focus is on solutions towards the integration of mathematical software systems. This includes low-level and XML based high-level communication channels as well as general framework for modular systems.

The ICMS Developer's Meeting is an international congress for which the main theme is mathematical software. The 2010 meeting was the third of a series of meetings of similar theme, the ?rst being held in Beijing, China in 2002,and the second in Castro-Urdiales, Spain in 2006. The ?eld of mathematics has numerous branches, and in each branch we ?nd that algorithms, and also implementations and applications of software s- tems, are studied. Researchers who endeavor to make such studies also have international meetings within their speci?c branches of mathematics, and these meetings have made signi?cant contributions to the ?elds in which they lie. The ICMS (International Congresseson Mathematical Software), on the other hand, is a general (not branch speci?c) meeting on mathematical software, which is held every four years, and is a rare opportunity for developers of mathematical softwarefrom di?erent branchesof mathematics, as well as mathematicians who are interested in mathematical software, to gather together.