Discrete Differential Geometry (DDG) is an emerging discipline at the boundary between mathematics and computer science. It aims to translate concepts from classical differential geometry into a language that is purely finite and discrete, and can hence be used by algorithms to reason about geometric data. In contrast to standard numerical approximation, the central philosophy of DDG is to faithfully and exactly preserve key invariants of geometric objects at the discrete level. This process of translation from smooth to discrete helps to both illuminate the fundamental meaning behind geometric ideas and provide useful algorithmic guarantees. This volume is based on lectures delivered at the 2018 AMS Short Course ``Discrete Differential Geometry,'' held January 8-9, 2018, in San Diego, California. The papers in this volume illustrate the principles of DDG via several recent topics: discrete nets, discrete differential operators, discrete mappings, discrete conformal geometry, and discrete optimal transport.

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, and on pure mathematics and its practical applications. The interaction of these facets is demonstrated by concrete examples, including discrete conformal mappings, discrete complex analysis, discrete curvatures and special surfaces, discrete integrable systems, conformal texture mappings in computer graphics, and free-form architecture. This richly illustrated book will convince readers that this new branch of mathematics is both beautiful and useful. It will appeal to graduate students and researchers in differential geometry, complex analysis, mathematical physics, numerical methods, discrete geometry, as well as computer graphics and geometry processing.

This volume is based on lectures delivered at the 2022 AMS Short Course “3D Printing: Challenges and Applications” held virtually from January 3–4, 2022. Access to 3D printing facilities is quickly becoming ubiquitous across college campuses. However, while equipment training is readily available, the process of taking a mathematical idea and making it into a printable model presents a big hurdle for most mathematicians. Additionally, there are still many open questions around what objects are possible to print, how to design algorithms for doing so, and what kinds of geometries have desired kinematic properties. This volume is focused on the process and applications of 3D printing for mathematical education, research, and visualization, alongside a discussion of the challenges and open mathematical problems that arise in the design and algorithmic aspects of 3D printing. The articles in this volume are focused on two main topics. The first is to make a bridge between mathematical ideas and 3D visualization. The second is to describe methods and techniques for including 3D printing in mathematical education at different levels— from pedagogy to research and from demonstrations to individual projects. We hope to establish the groundwork for engaged academic discourse on the intersections between mathematics, 3D printing and education.

This volume is based on lectures delivered at the 2020 AMS Short Course “Mean Field Games: Agent Based Models to Nash Equilibria,” held January 13–14, 2020, in Denver, Colorado. Mean field game theory offers a robust methodology for studying large systems of interacting rational agents. It has been extraordinarily successful and has continued to develop since its inception. The six chapters that make up this volume provide an overview of the subject, from the foundations of the theory to applications in economics and finance, including computational aspects. The reader will find a pedagogical introduction to the main ingredients, from the forward-backward mean field game system to the master equation. Also included are two detailed chapters on the connection between finite games and mean field games, with a pedestrian description of the different methods available to solve the convergence problem. The volume concludes with two contributions on applications of mean field games and on existing numerical methods, with an opening to machine learning techniques.

This book provides a comprehensive, in-depth overview of elementary mathematics as explored in Mathematical Olympiads around the world. It expands on topics usually encountered in high school and could even be used as preparation for a first-semester undergraduate course. This first volume covers Real Numbers, Functions, Real Analysis, Systems of Equations, Limits and Derivatives, and much more. As part of a collection, the book differs from other publications in this field by not being a mere selection of questions or a set of tips and tricks that applies to specific problems. It starts from the most basic theoretical principles, without being either too general or too axiomatic. Examples and problems are discussed only if they are helpful as applications of the theory. Propositions are proved in detail and subsequently applied to Olympic problems or to other problems at the Olympic level. The book also explores some of the hardest problems presented at National and International Mathematics Olympiads, as well as many essential theorems related to the content. An extensive Appendix offering hints on or full solutions for all difficult problems rounds out the book.

This book constitutes the thoroughly refereed proceedings of the 20th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2017, held in Vienna, Austria, in September 2017. The 28 revised full papers presented together with 3 invited talks were carefully selected from 36 submissions. The papers are organized in topical sections on geometric transforms; discrete tomography; discrete modeling and visualization; morphological analysis; discrete shape representation, recognition and analysis; discrete and combinatorial topology; discrete models and tools; models for discrete geometry.

This book provides a comprehensive, in-depth overview of elementary mathematics as explored in Mathematical Olympiads around the world. It expands on topics usually encountered in high school and could even be used as preparation for a first-semester undergraduate course. This third and last volume covers Counting, Generating Functions, Graph Theory, Number Theory, Complex Numbers, Polynomials, and much more. As part of a collection, the book differs from other publications in this field by not being a mere selection of questions or a set of tips and tricks that applies to specific problems. It starts from the most basic theoretical principles, without being either too general or too axiomatic. Examples and problems are discussed only if they are helpful as applications of the theory. Propositions are proved in detail and subsequently applied to Olympic problems or to other problems at the Olympic level. The book also explores some of the hardest problems presented at National and International Mathematics Olympiads, as well as many essential theorems related to the content. An extensive Appendix offering hints on or full solutions for all difficult problems rounds out the book.

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors. Rather than featuring formal mathematical proofs, the book focuses on explanations and logical reasoning. It also includes thoughtful discussions of historical problems and modern questions. The book inspires readers to learn by working through examples, drawing graphs and exploring concepts. This book distinguishes itself from others covering the same topic. It strikes a balance of focusing on accessible problems for non-mathematical students while providing enough material for a semester-long course. Employs graph theory to teach mathematical reasoning Expressly written for non-mathematical students Promotes critical thinking and problem solving Provides rich examples and clear explanations without using proofs

Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Logic, Operations, and Computational Mathematics and Geometry. The editors have built Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Logic, Operations, and Computational Mathematics and Geometry in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

Applied topology is a modern subject which emerged in recent years at a crossroads of many methods, all of them topological in nature, which were used in a wide variety of applications in classical mathematics and beyond. Within applied topology, discrete Morse theory came into light as one of the main tools to understand cell complexes arising in different contexts, as well as to reduce the complexity of homology calculations. The present book provides a gentle introduction into this beautiful theory. Using a combinatorial approach—the author emphasizes acyclic matchings as the central object of study. The first two parts of the book can be used as a stand-alone introduction to homology, the last two parts delve into the core of discrete Morse theory. The presentation is broad, ranging from abstract topics, such as formulation of the entire theory using poset maps with small fibers, to heavily computational aspects, providing, for example, a specific algorithm of finding an explicit homology basis starting from an acyclic matching. The book will be appreciated by graduate students in applied topology, students and specialists in computer science and engineering, as well as research mathematicians interested in learning about the subject and applying it in context of their fields.