Author: Toshikazu Sunada
Publisher: Springer Science & Business Media
ISBN: 4431541772
Category : Mathematics
Languages : en
Pages : 236
Book Description
Geometry in ancient Greece is said to have originated in the curiosity of mathematicians about the shapes of crystals, with that curiosity culminating in the classification of regular convex polyhedra addressed in the final volume of Euclid’s Elements. Since then, geometry has taken its own path and the study of crystals has not been a central theme in mathematics, with the exception of Kepler’s work on snowflakes. Only in the nineteenth century did mathematics begin to play a role in crystallography as group theory came to be applied to the morphology of crystals. This monograph follows the Greek tradition in seeking beautiful shapes such as regular convex polyhedra. The primary aim is to convey to the reader how algebraic topology is effectively used to explore the rich world of crystal structures. Graph theory, homology theory, and the theory of covering maps are employed to introduce the notion of the topological crystal which retains, in the abstract, all the information on the connectivity of atoms in the crystal. For that reason the title Topological Crystallography has been chosen. Topological crystals can be described as “living in the logical world, not in space,” leading to the question of how to place or realize them “canonically” in space. Proposed here is the notion of standard realizations of topological crystals in space, including as typical examples the crystal structures of diamond and lonsdaleite. A mathematical view of the standard realizations is also provided by relating them to asymptotic behaviors of random walks and harmonic maps. Furthermore, it can be seen that a discrete analogue of algebraic geometry is linked to the standard realizations. Applications of the discussions in this volume include not only a systematic enumeration of crystal structures, an area of considerable scientific interest for many years, but also the architectural design of lightweight rigid structures. The reader therefore can see the agreement of theory and practice.
Topological Crystallography
Author: Toshikazu Sunada
Publisher: Springer Science & Business Media
ISBN: 4431541772
Category : Mathematics
Languages : en
Pages : 236
Book Description
Geometry in ancient Greece is said to have originated in the curiosity of mathematicians about the shapes of crystals, with that curiosity culminating in the classification of regular convex polyhedra addressed in the final volume of Euclid’s Elements. Since then, geometry has taken its own path and the study of crystals has not been a central theme in mathematics, with the exception of Kepler’s work on snowflakes. Only in the nineteenth century did mathematics begin to play a role in crystallography as group theory came to be applied to the morphology of crystals. This monograph follows the Greek tradition in seeking beautiful shapes such as regular convex polyhedra. The primary aim is to convey to the reader how algebraic topology is effectively used to explore the rich world of crystal structures. Graph theory, homology theory, and the theory of covering maps are employed to introduce the notion of the topological crystal which retains, in the abstract, all the information on the connectivity of atoms in the crystal. For that reason the title Topological Crystallography has been chosen. Topological crystals can be described as “living in the logical world, not in space,” leading to the question of how to place or realize them “canonically” in space. Proposed here is the notion of standard realizations of topological crystals in space, including as typical examples the crystal structures of diamond and lonsdaleite. A mathematical view of the standard realizations is also provided by relating them to asymptotic behaviors of random walks and harmonic maps. Furthermore, it can be seen that a discrete analogue of algebraic geometry is linked to the standard realizations. Applications of the discussions in this volume include not only a systematic enumeration of crystal structures, an area of considerable scientific interest for many years, but also the architectural design of lightweight rigid structures. The reader therefore can see the agreement of theory and practice.
Publisher: Springer Science & Business Media
ISBN: 4431541772
Category : Mathematics
Languages : en
Pages : 236
Book Description
Geometry in ancient Greece is said to have originated in the curiosity of mathematicians about the shapes of crystals, with that curiosity culminating in the classification of regular convex polyhedra addressed in the final volume of Euclid’s Elements. Since then, geometry has taken its own path and the study of crystals has not been a central theme in mathematics, with the exception of Kepler’s work on snowflakes. Only in the nineteenth century did mathematics begin to play a role in crystallography as group theory came to be applied to the morphology of crystals. This monograph follows the Greek tradition in seeking beautiful shapes such as regular convex polyhedra. The primary aim is to convey to the reader how algebraic topology is effectively used to explore the rich world of crystal structures. Graph theory, homology theory, and the theory of covering maps are employed to introduce the notion of the topological crystal which retains, in the abstract, all the information on the connectivity of atoms in the crystal. For that reason the title Topological Crystallography has been chosen. Topological crystals can be described as “living in the logical world, not in space,” leading to the question of how to place or realize them “canonically” in space. Proposed here is the notion of standard realizations of topological crystals in space, including as typical examples the crystal structures of diamond and lonsdaleite. A mathematical view of the standard realizations is also provided by relating them to asymptotic behaviors of random walks and harmonic maps. Furthermore, it can be seen that a discrete analogue of algebraic geometry is linked to the standard realizations. Applications of the discussions in this volume include not only a systematic enumeration of crystal structures, an area of considerable scientific interest for many years, but also the architectural design of lightweight rigid structures. The reader therefore can see the agreement of theory and practice.
Analysis and Geometry on Graphs and Manifolds
Author: Matthias Keller
Publisher: Cambridge University Press
ISBN: 1108587380
Category : Mathematics
Languages : en
Pages : 493
Book Description
The interplay of geometry, spectral theory and stochastics has a long and fruitful history, and is the driving force behind many developments in modern mathematics. Bringing together contributions from a 2017 conference at the University of Potsdam, this volume focuses on global effects of local properties. Exploring the similarities and differences between the discrete and the continuous settings is of great interest to both researchers and graduate students in geometric analysis. The range of survey articles presented in this volume give an expository overview of various topics, including curvature, the effects of geometry on the spectrum, geometric group theory, and spectral theory of Laplacian and Schrödinger operators. Also included are shorter articles focusing on specific techniques and problems, allowing the reader to get to the heart of several key topics.
Publisher: Cambridge University Press
ISBN: 1108587380
Category : Mathematics
Languages : en
Pages : 493
Book Description
The interplay of geometry, spectral theory and stochastics has a long and fruitful history, and is the driving force behind many developments in modern mathematics. Bringing together contributions from a 2017 conference at the University of Potsdam, this volume focuses on global effects of local properties. Exploring the similarities and differences between the discrete and the continuous settings is of great interest to both researchers and graduate students in geometric analysis. The range of survey articles presented in this volume give an expository overview of various topics, including curvature, the effects of geometry on the spectrum, geometric group theory, and spectral theory of Laplacian and Schrödinger operators. Also included are shorter articles focusing on specific techniques and problems, allowing the reader to get to the heart of several key topics.
Classical Topics in Discrete Geometry
Author: Károly Bezdek
Publisher: Springer Science & Business Media
ISBN: 1441906002
Category : Mathematics
Languages : en
Pages : 171
Book Description
Geometry is a classical core part of mathematics which, with its birth, marked the beginning of the mathematical sciences. Thus, not surprisingly, geometry has played a key role in many important developments of mathematics in the past, as well as in present times. While focusing on modern mathematics, one has to emphasize the increasing role of discrete mathematics, or equivalently, the broad movement to establish discrete analogues of major components of mathematics. In this way, the works of a number of outstanding mathema- cians including H. S. M. Coxeter (Canada), C. A. Rogers (United Kingdom), and L. Fejes-T oth (Hungary) led to the new and fast developing eld called discrete geometry. One can brie y describe this branch of geometry as the study of discrete arrangements of geometric objects in Euclidean, as well as in non-Euclidean spaces. This, as a classical core part, also includes the theory of polytopes and tilings in addition to the theory of packing and covering. D- crete geometry is driven by problems often featuring a very clear visual and applied character. The solutions use a variety of methods of modern mat- matics, including convex and combinatorial geometry, coding theory, calculus of variations, di erential geometry, group theory, and topology, as well as geometric analysis and number theory.
Publisher: Springer Science & Business Media
ISBN: 1441906002
Category : Mathematics
Languages : en
Pages : 171
Book Description
Geometry is a classical core part of mathematics which, with its birth, marked the beginning of the mathematical sciences. Thus, not surprisingly, geometry has played a key role in many important developments of mathematics in the past, as well as in present times. While focusing on modern mathematics, one has to emphasize the increasing role of discrete mathematics, or equivalently, the broad movement to establish discrete analogues of major components of mathematics. In this way, the works of a number of outstanding mathema- cians including H. S. M. Coxeter (Canada), C. A. Rogers (United Kingdom), and L. Fejes-T oth (Hungary) led to the new and fast developing eld called discrete geometry. One can brie y describe this branch of geometry as the study of discrete arrangements of geometric objects in Euclidean, as well as in non-Euclidean spaces. This, as a classical core part, also includes the theory of polytopes and tilings in addition to the theory of packing and covering. D- crete geometry is driven by problems often featuring a very clear visual and applied character. The solutions use a variety of methods of modern mat- matics, including convex and combinatorial geometry, coding theory, calculus of variations, di erential geometry, group theory, and topology, as well as geometric analysis and number theory.
Algebraic and Geometric Ideas in the Theory of Discrete Optimization
Author: Jesus A. De Loera
Publisher: SIAM
ISBN: 1611972434
Category : Mathematics
Languages : en
Pages : 320
Book Description
In recent years, many new techniques have emerged in the mathematical theory of discrete optimization that have proven to be effective in solving a number of hard problems. This book presents these recent advances, particularly those that arise from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside of the standard curriculum in optimization. These new techniques, all of which are presented with minimal prerequisites, provide a transition from linear to nonlinear discrete optimization. This book can be used as a textbook for advanced undergraduates or first-year graduate students in mathematics, computer science or operations research. It is also appropriate for mathematicians, engineers, and scientists engaged in computation who wish to gain a deeper understanding of how and why algorithms work.
Publisher: SIAM
ISBN: 1611972434
Category : Mathematics
Languages : en
Pages : 320
Book Description
In recent years, many new techniques have emerged in the mathematical theory of discrete optimization that have proven to be effective in solving a number of hard problems. This book presents these recent advances, particularly those that arise from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside of the standard curriculum in optimization. These new techniques, all of which are presented with minimal prerequisites, provide a transition from linear to nonlinear discrete optimization. This book can be used as a textbook for advanced undergraduates or first-year graduate students in mathematics, computer science or operations research. It is also appropriate for mathematicians, engineers, and scientists engaged in computation who wish to gain a deeper understanding of how and why algorithms work.
Applications of Discrete Geometry and Mathematical Morphology
Author: Ullrich Köthe
Publisher: Springer
ISBN: 3642323138
Category : Computers
Languages : en
Pages : 175
Book Description
This book constitutes the refereed proceedings of the first Workshop on Applications of Discrete Geometry and Mathematical Morphology, WADGMM 2010, held at the International Conference on Pattern Recognition in Istanbul, Turkey, in August 2010. The 11 revised full papers presented were carefully reviewed and selected from 25 submissions. The book was specifically designed to promote interchange and collaboration between experts in discrete geometry/mathematical morphology and potential users of these methods from other fields of image analysis and pattern recognition.
Publisher: Springer
ISBN: 3642323138
Category : Computers
Languages : en
Pages : 175
Book Description
This book constitutes the refereed proceedings of the first Workshop on Applications of Discrete Geometry and Mathematical Morphology, WADGMM 2010, held at the International Conference on Pattern Recognition in Istanbul, Turkey, in August 2010. The 11 revised full papers presented were carefully reviewed and selected from 25 submissions. The book was specifically designed to promote interchange and collaboration between experts in discrete geometry/mathematical morphology and potential users of these methods from other fields of image analysis and pattern recognition.
Geometric Analysis and Nonlinear Partial Differential Equations
Author: Stefan Hildebrandt
Publisher: Springer Science & Business Media
ISBN: 3642556272
Category : Mathematics
Languages : en
Pages : 663
Book Description
This book is not a textbook, but rather a coherent collection of papers from the field of partial differential equations. Nevertheless we believe that it may very well serve as a good introduction into some topics of this classical field of analysis which, despite of its long history, is highly modem and well prospering. Richard Courant wrote in 1950: "It has always been a temptationfor mathematicians to present the crystallized product of their thought as a deductive general theory and to relegate the individual mathematical phenomenon into the role of an example. The reader who submits to the dogmatic form will be easily indoctrinated. Enlightenment, however, must come from an understanding of motives; live mathematical development springs from specific natural problems which can be easily understood, but whose solutions are difficult and demand new methods or more general significance. " We think that many, if not all, papers of this book are written in this spirit and will give the reader access to an important branch of analysis by exhibiting interest ing problems worth to be studied. Most of the collected articles have an extensive introductory part describing the history of the presented problems as well as the state of the art and offer a well chosen guide to the literature. This way the papers became lengthier than customary these days, but the level of presentation is such that an advanced graduate student should find the various articles both readable and stimulating.
Publisher: Springer Science & Business Media
ISBN: 3642556272
Category : Mathematics
Languages : en
Pages : 663
Book Description
This book is not a textbook, but rather a coherent collection of papers from the field of partial differential equations. Nevertheless we believe that it may very well serve as a good introduction into some topics of this classical field of analysis which, despite of its long history, is highly modem and well prospering. Richard Courant wrote in 1950: "It has always been a temptationfor mathematicians to present the crystallized product of their thought as a deductive general theory and to relegate the individual mathematical phenomenon into the role of an example. The reader who submits to the dogmatic form will be easily indoctrinated. Enlightenment, however, must come from an understanding of motives; live mathematical development springs from specific natural problems which can be easily understood, but whose solutions are difficult and demand new methods or more general significance. " We think that many, if not all, papers of this book are written in this spirit and will give the reader access to an important branch of analysis by exhibiting interest ing problems worth to be studied. Most of the collected articles have an extensive introductory part describing the history of the presented problems as well as the state of the art and offer a well chosen guide to the literature. This way the papers became lengthier than customary these days, but the level of presentation is such that an advanced graduate student should find the various articles both readable and stimulating.
Digital and Discrete Geometry
Author: Li M. Chen
Publisher: Springer
ISBN: 3319120999
Category : Computers
Languages : en
Pages : 325
Book Description
This book provides comprehensive coverage of the modern methods for geometric problems in the computing sciences. It also covers concurrent topics in data sciences including geometric processing, manifold learning, Google search, cloud data, and R-tree for wireless networks and BigData. The author investigates digital geometry and its related constructive methods in discrete geometry, offering detailed methods and algorithms. The book is divided into five sections: basic geometry; digital curves, surfaces and manifolds; discretely represented objects; geometric computation and processing; and advanced topics. Chapters especially focus on the applications of these methods to other types of geometry, algebraic topology, image processing, computer vision and computer graphics. Digital and Discrete Geometry: Theory and Algorithms targets researchers and professionals working in digital image processing analysis, medical imaging (such as CT and MRI) and informatics, computer graphics, computer vision, biometrics, and information theory. Advanced-level students in electrical engineering, mathematics, and computer science will also find this book useful as a secondary text book or reference. Praise for this book: This book does present a large collection of important concepts, of mathematical, geometrical, or algorithmical nature, that are frequently used in computer graphics and image processing. These concepts range from graphs through manifolds to homology. Of particular value are the sections dealing with discrete versions of classic continuous notions. The reader finds compact definitions and concise explanations that often appeal to intuition, avoiding finer, but then necessarily more complicated, arguments... As a first introduction, or as a reference for professionals working in computer graphics or image processing, this book should be of considerable value." - Prof. Dr. Rolf Klein, University of Bonn.
Publisher: Springer
ISBN: 3319120999
Category : Computers
Languages : en
Pages : 325
Book Description
This book provides comprehensive coverage of the modern methods for geometric problems in the computing sciences. It also covers concurrent topics in data sciences including geometric processing, manifold learning, Google search, cloud data, and R-tree for wireless networks and BigData. The author investigates digital geometry and its related constructive methods in discrete geometry, offering detailed methods and algorithms. The book is divided into five sections: basic geometry; digital curves, surfaces and manifolds; discretely represented objects; geometric computation and processing; and advanced topics. Chapters especially focus on the applications of these methods to other types of geometry, algebraic topology, image processing, computer vision and computer graphics. Digital and Discrete Geometry: Theory and Algorithms targets researchers and professionals working in digital image processing analysis, medical imaging (such as CT and MRI) and informatics, computer graphics, computer vision, biometrics, and information theory. Advanced-level students in electrical engineering, mathematics, and computer science will also find this book useful as a secondary text book or reference. Praise for this book: This book does present a large collection of important concepts, of mathematical, geometrical, or algorithmical nature, that are frequently used in computer graphics and image processing. These concepts range from graphs through manifolds to homology. Of particular value are the sections dealing with discrete versions of classic continuous notions. The reader finds compact definitions and concise explanations that often appeal to intuition, avoiding finer, but then necessarily more complicated, arguments... As a first introduction, or as a reference for professionals working in computer graphics or image processing, this book should be of considerable value." - Prof. Dr. Rolf Klein, University of Bonn.
Discrete Geometric Analysis
Author: Martin T.Barlow
Publisher:
ISBN: 9784864970358
Category : Mathematics
Languages : en
Pages : 157
Book Description
This is a volume of lecture notes based on three series of lectures given by visiting professors of RIMS, Kyoto University during the year-long project 'Discrete Geometric Analysis', which took place in the Japanese academic year 2012-2013. The aim of the project was to make comprehensive research on topics related to discreteness in geometry, analysis and optimization.Discrete geometric analysis is a hybrid field of several traditional disciplines, including graph theory, geometry, discrete group theory, and probability. The name of the area was coined by Toshikazu Sunada, and since being introduced, it has been extending and making new interactions with many other fields.This volume consists of three chapters: (I) Loop Erased Walks and Uniform Spanning Trees, by Martin T Barlow; (II) Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks, by Tibor Jordán; (III) Analysis and Geometry on Groups, by Andrzej Zuk.The lecture notes are useful surveys that provide an introduction to the history and recent progress in the areas covered. They will also help researchers who work in related interdisciplinary fields to gain an understanding of the material from the viewpoint of discrete geometric analysis.Published by Mathematical Society of Japan and distributed by World Scientific Publishing Co. for all markets
Publisher:
ISBN: 9784864970358
Category : Mathematics
Languages : en
Pages : 157
Book Description
This is a volume of lecture notes based on three series of lectures given by visiting professors of RIMS, Kyoto University during the year-long project 'Discrete Geometric Analysis', which took place in the Japanese academic year 2012-2013. The aim of the project was to make comprehensive research on topics related to discreteness in geometry, analysis and optimization.Discrete geometric analysis is a hybrid field of several traditional disciplines, including graph theory, geometry, discrete group theory, and probability. The name of the area was coined by Toshikazu Sunada, and since being introduced, it has been extending and making new interactions with many other fields.This volume consists of three chapters: (I) Loop Erased Walks and Uniform Spanning Trees, by Martin T Barlow; (II) Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks, by Tibor Jordán; (III) Analysis and Geometry on Groups, by Andrzej Zuk.The lecture notes are useful surveys that provide an introduction to the history and recent progress in the areas covered. They will also help researchers who work in related interdisciplinary fields to gain an understanding of the material from the viewpoint of discrete geometric analysis.Published by Mathematical Society of Japan and distributed by World Scientific Publishing Co. for all markets
Lectures on Discrete Geometry
Author: Jiri Matousek
Publisher: Springer Science & Business Media
ISBN: 1461300398
Category : Mathematics
Languages : en
Pages : 491
Book Description
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
Publisher: Springer Science & Business Media
ISBN: 1461300398
Category : Mathematics
Languages : en
Pages : 491
Book Description
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
New Trends in Discrete and Computational Geometry
Author: Janos Pach
Publisher: Springer Science & Business Media
ISBN: 3642580432
Category : Mathematics
Languages : en
Pages : 342
Book Description
Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and computer aided design. The book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. All authors are well-known experts in these fields. They give concise and self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. Most of the methods and results discussed in the book have not appeared in any previously published monograph. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. Apart from mathematicians working in discrete and computational geometry this book will also be of great use to computer scientists and engineers, who would like to learn about the most recent results.
Publisher: Springer Science & Business Media
ISBN: 3642580432
Category : Mathematics
Languages : en
Pages : 342
Book Description
Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and computer aided design. The book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. All authors are well-known experts in these fields. They give concise and self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. Most of the methods and results discussed in the book have not appeared in any previously published monograph. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. Apart from mathematicians working in discrete and computational geometry this book will also be of great use to computer scientists and engineers, who would like to learn about the most recent results.