Author: Mikhail I. Ostrovskii
Publisher: Walter de Gruyter
ISBN: 3110264013
Category : Mathematics
Languages : en
Pages : 384
Book Description
Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology. The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings. The topics include: (1) Embeddability of locally finite metric spaces into Banach spaces is finitely determined; (2) Constructions of embeddings; (3) Distortion in terms of Poincaré inequalities; (4) Constructions of families of expanders and of families of graphs with unbounded girth and lower bounds on average degrees; (5) Banach spaces which do not admit coarse embeddings of expanders; (6) Structure of metric spaces which are not coarsely embeddable into a Hilbert space; (7) Applications of Markov chains to embeddability problems; (8) Metric characterizations of properties of Banach spaces; (9) Lipschitz free spaces. Substantial part of the book is devoted to a detailed presentation of relevant results of Banach space theory and graph theory. The final chapter contains a list of open problems. Extensive bibliography is also included. Each chapter, except the open problems chapter, contains exercises and a notes and remarks section containing references, discussion of related results, and suggestions for further reading. The book will help readers to enter and to work in a very rapidly developing area having many important connections with different parts of mathematics and computer science.
Metric Embeddings
Author: Mikhail I. Ostrovskii
Publisher: Walter de Gruyter
ISBN: 3110264013
Category : Mathematics
Languages : en
Pages : 384
Book Description
Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology. The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings. The topics include: (1) Embeddability of locally finite metric spaces into Banach spaces is finitely determined; (2) Constructions of embeddings; (3) Distortion in terms of Poincaré inequalities; (4) Constructions of families of expanders and of families of graphs with unbounded girth and lower bounds on average degrees; (5) Banach spaces which do not admit coarse embeddings of expanders; (6) Structure of metric spaces which are not coarsely embeddable into a Hilbert space; (7) Applications of Markov chains to embeddability problems; (8) Metric characterizations of properties of Banach spaces; (9) Lipschitz free spaces. Substantial part of the book is devoted to a detailed presentation of relevant results of Banach space theory and graph theory. The final chapter contains a list of open problems. Extensive bibliography is also included. Each chapter, except the open problems chapter, contains exercises and a notes and remarks section containing references, discussion of related results, and suggestions for further reading. The book will help readers to enter and to work in a very rapidly developing area having many important connections with different parts of mathematics and computer science.
Publisher: Walter de Gruyter
ISBN: 3110264013
Category : Mathematics
Languages : en
Pages : 384
Book Description
Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology. The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings. The topics include: (1) Embeddability of locally finite metric spaces into Banach spaces is finitely determined; (2) Constructions of embeddings; (3) Distortion in terms of Poincaré inequalities; (4) Constructions of families of expanders and of families of graphs with unbounded girth and lower bounds on average degrees; (5) Banach spaces which do not admit coarse embeddings of expanders; (6) Structure of metric spaces which are not coarsely embeddable into a Hilbert space; (7) Applications of Markov chains to embeddability problems; (8) Metric characterizations of properties of Banach spaces; (9) Lipschitz free spaces. Substantial part of the book is devoted to a detailed presentation of relevant results of Banach space theory and graph theory. The final chapter contains a list of open problems. Extensive bibliography is also included. Each chapter, except the open problems chapter, contains exercises and a notes and remarks section containing references, discussion of related results, and suggestions for further reading. The book will help readers to enter and to work in a very rapidly developing area having many important connections with different parts of mathematics and computer science.
Handbook of Discrete and Computational Geometry
Author: Csaba D. Toth
Publisher: CRC Press
ISBN: 1351645919
Category : Computers
Languages : en
Pages : 2354
Book Description
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Publisher: CRC Press
ISBN: 1351645919
Category : Computers
Languages : en
Pages : 2354
Book Description
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Geometry of Cuts and Metrics
Author: Michel Marie Deza
Publisher: Springer
ISBN: 3642042953
Category : Mathematics
Languages : en
Pages : 580
Book Description
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.
Publisher: Springer
ISBN: 3642042953
Category : Mathematics
Languages : en
Pages : 580
Book Description
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.
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.
Embeddings of Finite Metrics
On Embeddings of Finite Metric Spaces Into Low Dimensional Normed Spaces
Volume Respecting Embeddings of Finite Metric Spaces
Dimensions, Embeddings, and Attractors
Author: James C. Robinson
Publisher: Cambridge University Press
ISBN: 9780521898058
Category : Mathematics
Languages : en
Pages : 218
Book Description
This accessible research monograph investigates how 'finite-dimensional' sets can be embedded into finite-dimensional Euclidean spaces. The first part brings together a number of abstract embedding results, and provides a unified treatment of four definitions of dimension that arise in disparate fields: Lebesgue covering dimension (from classical 'dimension theory'), Hausdorff dimension (from geometric measure theory), upper box-counting dimension (from dynamical systems), and Assouad dimension (from the theory of metric spaces). These abstract embedding results are applied in the second part of the book to the finite-dimensional global attractors that arise in certain infinite-dimensional dynamical systems, deducing practical consequences from the existence of such attractors: a version of the Takens time-delay embedding theorem valid in spatially extended systems, and a result on parametrisation by point values. This book will appeal to all researchers with an interest in dimension theory, particularly those working in dynamical systems.
Publisher: Cambridge University Press
ISBN: 9780521898058
Category : Mathematics
Languages : en
Pages : 218
Book Description
This accessible research monograph investigates how 'finite-dimensional' sets can be embedded into finite-dimensional Euclidean spaces. The first part brings together a number of abstract embedding results, and provides a unified treatment of four definitions of dimension that arise in disparate fields: Lebesgue covering dimension (from classical 'dimension theory'), Hausdorff dimension (from geometric measure theory), upper box-counting dimension (from dynamical systems), and Assouad dimension (from the theory of metric spaces). These abstract embedding results are applied in the second part of the book to the finite-dimensional global attractors that arise in certain infinite-dimensional dynamical systems, deducing practical consequences from the existence of such attractors: a version of the Takens time-delay embedding theorem valid in spatially extended systems, and a result on parametrisation by point values. This book will appeal to all researchers with an interest in dimension theory, particularly those working in dynamical systems.
Embeddings and Extensions in Analysis
Author: J.H. Wells
Publisher: Springer Science & Business Media
ISBN: 3642660371
Category : Mathematics
Languages : en
Pages : 117
Book Description
The object of this book is a presentation of the major results relating to two geometrically inspired problems in analysis. One is that of determining which metric spaces can be isometrically embedded in a Hilbert space or, more generally, P in an L space; the other asks for conditions on a pair of metric spaces which will ensure that every contraction or every Lipschitz-Holder map from a subset of X into Y is extendable to a map of the same type from X into Y. The initial work on isometric embedding was begun by K. Menger [1928] with his metric investigations of Euclidean geometries and continued, in its analytical formulation, by I. J. Schoenberg [1935] in a series of papers of classical elegance. The problem of extending Lipschitz-Holder and contraction maps was first treated by E. J. McShane and M. D. Kirszbraun [1934]. Following a period of relative inactivity, attention was again drawn to these two problems by G. Minty's work on non-linear monotone operators in Hilbert space [1962]; by S. Schonbeck's fundamental work in characterizing those pairs (X,Y) of Banach spaces for which extension of contractions is always possible [1966]; and by the generalization of many of Schoenberg's embedding theorems to the P setting of L spaces by Bretagnolle, Dachuna Castelle and Krivine [1966].
Publisher: Springer Science & Business Media
ISBN: 3642660371
Category : Mathematics
Languages : en
Pages : 117
Book Description
The object of this book is a presentation of the major results relating to two geometrically inspired problems in analysis. One is that of determining which metric spaces can be isometrically embedded in a Hilbert space or, more generally, P in an L space; the other asks for conditions on a pair of metric spaces which will ensure that every contraction or every Lipschitz-Holder map from a subset of X into Y is extendable to a map of the same type from X into Y. The initial work on isometric embedding was begun by K. Menger [1928] with his metric investigations of Euclidean geometries and continued, in its analytical formulation, by I. J. Schoenberg [1935] in a series of papers of classical elegance. The problem of extending Lipschitz-Holder and contraction maps was first treated by E. J. McShane and M. D. Kirszbraun [1934]. Following a period of relative inactivity, attention was again drawn to these two problems by G. Minty's work on non-linear monotone operators in Hilbert space [1962]; by S. Schonbeck's fundamental work in characterizing those pairs (X,Y) of Banach spaces for which extension of contractions is always possible [1966]; and by the generalization of many of Schoenberg's embedding theorems to the P setting of L spaces by Bretagnolle, Dachuna Castelle and Krivine [1966].
The Random Projection Method
Author: Santosh S. Vempala
Publisher: American Mathematical Soc.
ISBN: 0821837931
Category : Mathematics
Languages : en
Pages : 120
Book Description
Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups. The first group consists of combinatorial optimization problems such as maxcut, graph coloring, minimum multicut, graph bandwidth and VLSI layout. Presented in this context is the theory of Euclidean embeddings of graphs. The next group is machine learning problems, specifically, learning intersections of halfspaces and learning large margin hypotheses. The projection method is further refined for the latter application. The last set consists of problems inspired by information retrieval, namely, nearest neighbor search, geometric clustering and efficient low-rank approximation. Motivated by the first two applications, an extension of random projection to the hypercube is developed here. Throughout the book, random projection is used as a way to understand, simplify and connect progress on these important and seemingly unrelated problems. The book is suitable for graduate students and research mathematicians interested in computational geometry.
Publisher: American Mathematical Soc.
ISBN: 0821837931
Category : Mathematics
Languages : en
Pages : 120
Book Description
Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups. The first group consists of combinatorial optimization problems such as maxcut, graph coloring, minimum multicut, graph bandwidth and VLSI layout. Presented in this context is the theory of Euclidean embeddings of graphs. The next group is machine learning problems, specifically, learning intersections of halfspaces and learning large margin hypotheses. The projection method is further refined for the latter application. The last set consists of problems inspired by information retrieval, namely, nearest neighbor search, geometric clustering and efficient low-rank approximation. Motivated by the first two applications, an extension of random projection to the hypercube is developed here. Throughout the book, random projection is used as a way to understand, simplify and connect progress on these important and seemingly unrelated problems. The book is suitable for graduate students and research mathematicians interested in computational geometry.