Michel-Marie Deza – författare

This book comes out of need and urgency (expressed especially in areas of Information Retrieval with respect to Image, Audio, Internet and Biology) to have a working tool to compare data.The book will provide powerful resource for all researchers using Mathematics as well as for mathematicians themselves. In the time when over-specialization and terminology fences isolate researchers, this Dictionary try to be "centripedal" and "oikoumeni", providing some access and altitude of vision but without taking the route of scientific vulgarisation. This attempted balance is the main philosophy of this Dictionary which defined its structure and style.Key features:- Unicity: it is the first book treating the basic notion of Distance in whole generality.- Interdisciplinarity: this Dictionary is larger in scope than majority of thematic dictionaries.- Encyclopedicity: while an Encyclopedia of Distances seems now too difficult to produce, this book (by its scope, short introductions and organization) provides the main material for it and for future tutorials on some parts of this material.- Applicability: the distances, as well as distance-related notions and paradigms, are provided in ready-to-use fashion.- Worthiness: the need and urgency for such dictionary was great in several huge areas, esp. Information Retrieval, Image Analysis, Speech Recognition and Biology.- Accessibility: the definitions are easy to locate by subject or, in Index, by alphabetic order; the introductions and definitions are reader-friendly and maximally independent one from another; still the text is structured, in the 3D HTML style, by hyperlink-like boldfaced references to similar definitions.* Covers a large range of subjects in pure and applied mathematics* Designed to be easily applied--the distances and distance-related notions and paradigms are ready to use* Helps users quickly locate definitions by subject or in alphabetical order; stand-alone entries include references to other entries and sources for further investigation

This monograph identifies polytopes that are “combinatorially ℓ1-embeddable”, within interesting lists of polytopal graphs, i.e. such that corresponding polytopes are either prominent mathematically (regular partitions, root lattices, uniform polytopes and so on), or applicable in chemistry (fullerenes, polycycles, etc.). The embeddability, if any, provides applications to chemical graphs and, in the first case, it gives new combinatorial perspective to “ℓ2-prominent” affine polytopal objects.The lists of polytopal graphs in the book come from broad areas of geometry, crystallography and graph theory. The book concentrates on such concise and, as much as possible, independent definitions. The scale-isometric embeddability — the main unifying question, to which those lists are subjected — is presented with the minimum of technicalities.

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 offers a comprehensive summary together with a global view, establishing both old and new links. Its treatment ranges from classical theorems of Menger and Schoenberg to recent developments such as approximation results for multicommodity flow and max-cut problems, metric aspects of Delaunay polytopes, isometric graph embeddings, and matrix completion problems. The discussion leads to many interesting subjects that cannot be found elsewhere, providing a unique and invaluable source for researchers and graduate students.

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.

This updated and revised third edition of the leading reference volume on distance metrics includes new items from very active research areas in the use of distances and metrics such as geometry, graph theory, probability theory and analysis. Among the new topics included are, for example, polyhedral metric space, nearness matrix problems, distances between belief assignments, distance-related animal settings, diamond-cutting distances, natural units of length, Heidegger’s de-severance distance, and brain distances. The publication of this volume coincides with intensifying research efforts into metric spaces and especially distance design for applications. Accurate metrics have become a crucial goal in computational biology, image analysis, speech recognition and information retrieval.Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available distances.As well as providing standalone introductions and definitions, the encyclopedia facilitates swift cross-referencing with easily navigable bold-faced textual links to core entries. In addition to distances themselves, the authors have collated numerous fascinating curiosities in their Who’s Who of metrics, including distance-related notions and paradigms that enable applied mathematicians in other sectors to deploy research tools that non-specialists justly view as arcane. In expanding access to these techniques, and in many cases enriching the context of distances themselves, this peerless volume is certain to stimulate fresh research.

This 4-th edition of the leading reference volume on distance metrics is characterized by updated and rewritten sections on some items suggested by experts and readers, as well a general streamlining of content and the addition of essential new topics. Though the structure remains unchanged, the new edition also explores recent advances in the use of distances and metrics for e.g. generalized distances, probability theory, graph theory, coding theory, data analysis.New topics in the purely mathematical sections include e.g. the Vitanyi multiset-metric, algebraic point-conic distance, triangular ratio metric, Rossi-Hamming metric, Taneja distance, spectral semimetric between graphs, channel metrization, and Maryland bridge distance. The multidisciplinary sections have also been supplemented with new topics, including: dynamic time wrapping distance, memory distance, allometry, atmospheric depth, elliptic orbit distance, VLBI distance measurements, the astronomical system of units, and walkability distance.Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available distances.As well as providing standalone introductions and definitions, the encyclopedia facilitates swift cross-referencing with easily navigable bold-faced textual links to core entries. In addition to distances themselves, the authors have collated numerous fascinating curiosities in their Who’s Who of metrics, including distance-related notions and paradigms that enable applied mathematicians in other sectors to deploy research tools that non-specialists justly view as arcane. In expanding access to these techniques, and in many cases enriching the context of distances themselves, this peerless volume is certain to stimulate fresh research.

This 4-th edition of the leading reference volume on distance metrics is characterized by updated and rewritten sections on some items suggested by experts and readers, as well a general streamlining of content and the addition of essential new topics. Though the structure remains unchanged, the new edition also explores recent advances in the use of distances and metrics for e.g. generalized distances, probability theory, graph theory, coding theory, data analysis.New topics in the purely mathematical sections include e.g. the Vitanyi multiset-metric, algebraic point-conic distance, triangular ratio metric, Rossi-Hamming metric, Taneja distance, spectral semimetric between graphs, channel metrization, and Maryland bridge distance. The multidisciplinary sections have also been supplemented with new topics, including: dynamic time wrapping distance, memory distance, allometry, atmospheric depth, elliptic orbit distance, VLBI distance measurements, the astronomical system of units, and walkability distance.Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available distances.As well as providing standalone introductions and definitions, the encyclopedia facilitates swift cross-referencing with easily navigable bold-faced textual links to core entries. In addition to distances themselves, the authors have collated numerous fascinating curiosities in their Who’s Who of metrics, including distance-related notions and paradigms that enable applied mathematicians in other sectors to deploy research tools that non-specialists justly view as arcane. In expanding access to these techniques, and in many cases enriching the context of distances themselves, this peerless volume is certain to stimulate fresh research.

The central theme of the present book is zigzags and central-circuits of three- or four-regular plane graphs, which allow a double covering or covering of the edgeset to be obtained. The book presents zigzag and central circuit structures of geometric fullerenes and several other classes of graph of interest in the fields of chemistry and mathematics. It also discusses the symmetries, parameterization and the Goldberg–Coxeter construction for those graphs.It is the first book on this subject, presenting full structure theory of such graphs. While many previous publications only addressed particular questions about selected graphs, this book is based on numerous computations and presents extensive data (tables and figures), as well as algorithmic and computational information. It will be of interest to researchers and students of discrete geometry, mathematical chemistry and combinatorics, as well as to lay mathematicians.

The central theme of the present book is zigzags and central-circuits of three- or four-regular plane graphs, which allow a double covering or covering of the edgeset to be obtained. The book presents zigzag and central circuit structures of geometric fullerenes and several other classes of graph of interest in the fields of chemistry and mathematics. It also discusses the symmetries, parameterization and the Goldberg–Coxeter construction for those graphs.It is the first book on this subject, presenting full structure theory of such graphs. While many previous publications only addressed particular questions about selected graphs, this book is based on numerous computations and presents extensive data (tables and figures), as well as algorithmic and computational information. It will be of interest to researchers and students of discrete geometry, mathematical chemistry and combinatorics, as well as to lay mathematicians.

Figurate numbers have a rich history with many applications. The main purpose of this book is to provide a thorough and complete presentation of the theory of figurate numbers, giving much of their properties, facts and theorems with full proofs. This book is the first of this topic written in unified systematic way. It also contains many exercises with solutions.