DOCSLIB.ORG

DICTIONARY of DISTANCES This Page Intentionally Left Blank DICTIONARY of DISTANCES

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DICTIONARY of DISTANCES This Page Intentionally Left Blank DICTIONARY of DISTANCES DICTIONARY OF DISTANCES This page intentionally left blank DICTIONARY OF DISTANCES ELENA DEZA Moscow Pedagogical State University and Donghua University MICHEL-MARIE DEZA Ecole Normale Superieure, Paris, and Shanghai University Amsterdam • Boston • Heidelberg • London • New York • Oxford Paris • San Diego • San Francisco • Singapore • Sydney • Tokyo ELSEVIER Radarweg 29, PO Box 211, 1000 AE Amsterdam, The Netherlands The Boulevard, Langford Lane, Kidlington, Oxford OX5 1GB, UK First edition 2006 Copyright © 2006 Elsevier B.V. All rights reserved No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means electronic, mechanical, photocopying, recording or otherwise without the prior written permission of the publisher Permissions may be sought directly from Elsevier’s Science & Technology Rights Department in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333; Email: [email protected]. Alternatively you can submit your request online by visiting the Elsevier web site at http://elsevier.com/locate/permissions, and selecting: Obtaining permission to use Elsevier material Notice No responsibility is assumed by the publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress British Library Cataloguing in Publica tion Data A catalogue record for this book is available from the British Library ISBN-13: 978-0-444-52087-6 ISBN-10: 0-444-52087-2 For information on all Elsevier publications visit our website at books.elsevier.com Printed and bound in The Netherlands 0607080910 10987654321 On 2 April 2006 it was 100 years from the submission by Maurice FRÉCHET of his outstanding doctoral dissertation Sur quelques points du calcul functionnel that introduced (within a systematic study of functional operations) the notion of metric space. It was also 92 years from 1914, the date of publication by Felix HAUSDORFF of his famous Grundzüge der Mengenlehre where the theory of topological and metric spaces was created. Let this Dictionary be our homage to the memory of these great mathematicians and their lives of dignity through the hard ways of the first half of the XX century. Maurice FRÉCHET (1878–1973) coined Felix HAUSDORFF (1868–1942) coined in 1906 the concept of écart (semi-metric) in 1914 the term metric space v This page intentionally left blank Preface The concept of distance is one of the basic ones in the whole of human experience. In everyday life it usually means some degree of closeness between two physical objects or ideas, i.e., length, time interval, gap, rank difference, coolness or remoteness, while the term metric is often used as a standard for a measurement. But here we consider, except in the last two chapters, the mathematical meaning of these terms. The mathematical notions of distance metric (i.e., a function d(x,y) from X × X to the set of real numbers satisfying d(x,y) 0 with equality only for x = y, d(x,y) = d(y,x), and d(x,y) d(x,z) + d(z,y)) and of metric space (X, d) were originated a century ago by M. Fréchet (1906) and F. Hausdorff (1914) as a special case of an infinite topological space. The triangle inequality above appears already in Euclid. The infinite metric spaces are seen usually as a generalization of the metric |x − y| on the real numbers. Their main classes are the measurable spaces (add measure) and Banach spaces (add norm and completeness). However, starting from K. Menger (1928) and, especially, L.M. Blumenthal (1953), an explosion of interest in finite metric spaces occurred. Another trend: many mathematical theories, in the process of their generalization, settled on the level of metric space. Now finite distance metrics have become an essential tool in many areas of Mathemat- ics and its applications include Geometry, Probability, Statistics, Coding/Graph Theory, Clustering, Data Analysis, Pattern Recognition, Networks, Engineering, Computer Graph- ics/Vision, Astronomy, Cosmology, Molecular Biology, and many other areas of science. Devising the most suitable distance metrics has become a standard task for many re- searchers. Especially intense ongoing searches for such distances occur, for example, in Genetics, Image Analysis, Speech Recognition, Information Retrieval. Often the same dis- tance metric appears independently in several different areas; for example, the edit distance between words, the evolutionary distance in Biology, the Levenstein distance in Coding Theory, and the Hamming+Gap or shuffle-Hamming distance. This body of knowledge has become too large and disparate to operate within. The number of worldwide web entries offered by Google on the topics “distance”, “metric space” and “distance metric” approach 300 million (i.e., about 4% of all), 12 million and 6 million, respectively, not to mention all the printed information outside the Web, or the vast “invisible Web” of searchable databases. However, this huge amount of information on distances is too scattered: the works evaluating distance from some list usually treat very specific areas and are hardly accessible for non-experts. Therefore, many researchers, including us, keep and cherish a collection of distances for use in their own areas of science. In view of the growing general need for an accessible interdisciplinary source for a vast multitude of researchers, we have expanded our private collection into this Dictionary. Some additional material was reworked from various en- vii viii Preface cyclopedia, especially, Encyclopedia of Mathematics ([EM98]), MathWorld ([Weis99]), PlanetMath ([PM]), and Wikipedia ([WFE]). However, the majority of distances should be extracted directly from specialist literature. The vast reservoir of concepts defined in this Dictionary, aims to be a thought-provoking archive and a valuable resource. Besides distances themselves, we have collected here many distance-related notions (especially in Chapter 1) and paradigms, enabling people from applications to get those, arcane for non-specialists, research tools, in ready-to-use fashion. This and the appearance of some distances in different contexts can be a source of new research. At a time when over-specialization and terminology barriers isolate researchers, this Dictionary tries to be “centripetal” and “ecumenical”, providing some access and altitude of vision but without taking the route of scientific vulgarization. This attempted balance defined the structure and style of the Dictionary. The Dictionary is divided into 28 chapters grouped into 7 Parts of about the same length. The titles of parts are purposely approximative: they just allow a reader to figure out her/his area of interest and competence. For example, Parts II, III and IV, V require some culture in, respectively, pure and applied Mathematics. Part VII can be read by a layman. The chapters are thematic lists, by areas of Mathematics or applications which can be read independently. When necessary, a chapter or a section starts with a short introduction: a field trip with the main concepts. Besides those introductions, the main properties and uses of distances are given, within items, only exceptionally. We also tried, when it was easy, to trace distances to their originator(s), but the proposed extensive bibliography has a less general ambition: it is just to provide convenient sources for a quick search. Each chapter consists of items ordered in a way that hints of connections between them. All item titles and selected key terms can be traced in the large Subject Index (about 1400 entries); they are boldfaced unless the meaning is clear from the context. So, the definitions are easy to locate, by subject, in chapters and/or, by alphabetic order, in the index. The introductions and definitions are reader-friendly and as far as possible independent of each other; still they are interconnected, in the 3-dimensional HTML manner, by hyperlink-like boldfaced references to similar definitions. Many nice curiosities appear in this “Who is Who” of distances. Examples of such sundry terms are: ubiquitous Euclidean distance (“as-the-crow-flies”), flower-shop met- ric (shortest way between two points, visiting a “flower-shop” point first), knight-move metric on a chessboard, Gordian distance of knots, Earth Mover distance, biotope distance, Procrustes distance, lift metric, post-office metric, Internet hop metric, WWW hyperlink quasi-metric, Moscow metric, dogkeeper distance. Besides abstract distances, the distances having physical meaning appear also (especially in Part VI); they range from 1.6×10−35 m (Planck length) to 7.4×1026 m (the estimated size of observable Universe, about 46×1060 Planck lengths). The number of distance metrics is infinite and therefore, our Dictionary cannot enu- merate all of them. But we were inspired by several successful thematic dictionaries on other infinite lists; for example, on Integer Sequences, Inequalities, Numbers, Random Processes, and by atlases of Functions, Groups, Fullerenes, etc. On the other hand, the largeness of the scope forced us often to switch into a laconic tutorial style. Preface ix The target audience consists of all researchers working on some measuring schemes and, to a certain degree, of students and a part of the general public interested in science. We have tried to address, even if incompletely, all scientific uses of the notion of dis- tance. However some distances did not made it into this Dictionary due to space limitations (being too specific and/or complex) or our oversight. In general, the size/interdisciplinarity cut-off, i.e., decision where to stop, was our main headache. We would be grateful to the readers who send us their favorite distances missed here.
Load more

Recommended publications
  • A Forbidden Subgraph Characterization of Some Graph Classes Using Betweenness Axioms
    A forbidden subgraph characterization of some graph classes using betweenness axioms Manoj Changat Department of Futures Studies University of Kerala Trivandrum - 695034, India e-mail: [email protected] Anandavally K Lakshmikuttyamma ∗ Department of Futures Studies University of Kerala, Trivandrum-695034, India e-mail: [email protected] Joseph Mathews Iztok Peterin C-GRAF, Department of Futures Studies University of Maribor University of Kerala, Trivandrum-695034, India FEECS, Smetanova 17, e-mail:[email protected] 2000 Maribor, Slovenia [email protected] Prasanth G. Narasimha-Shenoi Geetha Seethakuttyamma Department of Mathematics Department of Mathematics Government College, Chittur College of Engineering Palakkad - 678104, India Karungapally e-mail: [email protected] e-mail:[email protected] Simon Špacapan University of Maribor, FME, Smetanova 17, 2000 Maribor, Slovenia. e-mail: [email protected]. July 27, 2012 ∗ The work of this author (On leave from Mar Ivanios College, Trivandrum) is supported by the University Grants Commission (UGC), Govt. of India under the FIP scheme. 1 Abstract Let IG(x,y) and JG(x,y) be the geodesic and induced path interval between x and y in a connected graph G, respectively. The following three betweenness axioms are considered for a set V and R : V × V → 2V (i) x ∈ R(u,y),y ∈ R(x,v),x 6= y, |R(u,v)| > 2 ⇒ x ∈ R(u,v) (ii) x ∈ R(u,v) ⇒ R(u,x) ∩ R(x,v)= {x} (iii)x ∈ R(u,y),y ∈ R(x,v),x 6= y, ⇒ x ∈ R(u,v). We characterize the class of graphs for which IG satisfies (i), and the class for which JG satisfies (ii) and the class for which IG or JG satisfies (iii).
    [Show full text]
  • (Eds.) Innovations in Bayesian Networks
    Dawn E. Holmes and Lakhmi C. Jain (Eds.) InnovationsinBayesianNetworks Studies in Computational Intelligence,Volume 156 Editor-in-Chief Prof. Janusz Kacprzyk Systems Research Institute Polish Academy of Sciences ul. Newelska 6 01-447 Warsaw Poland E-mail: [email protected] Further volumes of this series can be found on our homepage: Vol. 145. Mikhail Ju. Moshkov, Marcin Piliszczuk springer.com and Beata Zielosko Partial Covers, Reducts and Decision Rules in Rough Sets, 2008 Vol. 134. Ngoc Thanh Nguyen and Radoslaw Katarzyniak (Eds.) ISBN 978-3-540-69027-6 New Challenges in Applied Intelligence Technologies, 2008 Vol. 146. Fatos Xhafa and Ajith Abraham (Eds.) ISBN 978-3-540-79354-0 Metaheuristics for Scheduling in Distributed Computing Vol. 135. Hsinchun Chen and Christopher C.Yang (Eds.) Environments, 2008 Intelligence and Security Informatics, 2008 ISBN 978-3-540-69260-7 ISBN 978-3-540-69207-2 Vol. 147. Oliver Kramer Self-Adaptive Heuristics for Evolutionary Computation, 2008 Vol. 136. Carlos Cotta, Marc Sevaux ISBN 978-3-540-69280-5 and Kenneth S¨orensen (Eds.) Adaptive and Multilevel Metaheuristics, 2008 Vol. 148. Philipp Limbourg ISBN 978-3-540-79437-0 Dependability Modelling under Uncertainty, 2008 ISBN 978-3-540-69286-7 Vol. 137. Lakhmi C. Jain, Mika Sato-Ilic, Maria Virvou, George A. Tsihrintzis,Valentina Emilia Balas Vol. 149. Roger Lee (Ed.) and Canicious Abeynayake (Eds.) Software Engineering, Artificial Intelligence, Networking and Computational Intelligence Paradigms, 2008 Parallel/Distributed Computing, 2008 ISBN 978-3-540-79473-8 ISBN 978-3-540-70559-8 Vol. 138. Bruno Apolloni,Witold Pedrycz, Simone Bassis Vol. 150. Roger Lee (Ed.) and Dario Malchiodi Software Engineering Research, Management and The Puzzle of Granular Computing, 2008 Applications, 2008 ISBN 978-3-540-79863-7 ISBN 978-3-540-70774-5 Vol.
    [Show full text]
  • Discrete Mathematics Rooted Directed Path Graphs Are Leaf Powers
    Discrete Mathematics 310 (2010) 897–910 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Rooted directed path graphs are leaf powers Andreas Brandstädt a, Christian Hundt a, Federico Mancini b, Peter Wagner a a Institut für Informatik, Universität Rostock, D-18051, Germany b Department of Informatics, University of Bergen, N-5020 Bergen, Norway article info a b s t r a c t Article history: Leaf powers are a graph class which has been introduced to model the problem of Received 11 March 2009 reconstructing phylogenetic trees. A graph G D .V ; E/ is called k-leaf power if it admits a Received in revised form 2 September 2009 k-leaf root, i.e., a tree T with leaves V such that uv is an edge in G if and only if the distance Accepted 13 October 2009 between u and v in T is at most k. Moroever, a graph is simply called leaf power if it is a Available online 30 October 2009 k-leaf power for some k 2 N. This paper characterizes leaf powers in terms of their relation to several other known graph classes. It also addresses the problem of deciding whether a Keywords: given graph is a k-leaf power. Leaf powers Leaf roots We show that the class of leaf powers coincides with fixed tolerance NeST graphs, a Graph class inclusions well-known graph class with absolutely different motivations. After this, we provide the Strongly chordal graphs largest currently known proper subclass of leaf powers, i.e, the class of rooted directed path Fixed tolerance NeST graphs graphs.
    [Show full text]
  • Synthetic Topology and Constructive Metric Spaces
    University of Ljubljana Faculty of Mathematics and Physics Department of Mathematics Davorin Leˇsnik Synthetic Topology and Constructive Metric Spaces Doctoral thesis Advisor: izr. prof. dr. Andrej Bauer arXiv:2104.10399v1 [math.GN] 21 Apr 2021 Ljubljana, 2010 Univerza v Ljubljani Fakulteta za matematiko in fiziko Oddelek za matematiko Davorin Leˇsnik Sintetiˇcna topologija in konstruktivni metriˇcni prostori Doktorska disertacija Mentor: izr. prof. dr. Andrej Bauer Ljubljana, 2010 Abstract The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are continuous with regard to it. We redefine synthetic topology in order to incorporate closed sets, and several generalizations are made. Real numbers are reconstructed (to suit the new background) as open Dedekind cuts. An extensive theory is developed when metric and intrinsic topology match. In the end the results are examined in four specific models. Math. Subj. Class. (MSC 2010): 03F60, 18C50 Keywords: synthetic, topology, metric spaces, real numbers, constructive Povzetek Disertacija predstavi podroˇcje sintetiˇcne topologije, zlasti njeno povezavo z metriˇcnimi prostori. Model sintetiˇcne topologije je kategoriˇcni model, v katerem objekti posedujejo intrinziˇcno topologijo v ustreznem smislu, glede na katero so vsi morfizmi zvezni. Definicije in izreki sintetiˇcne topologije so posploˇseni, med drugim tako, da vkljuˇcujejo zaprte mnoˇzice. Realna ˇstevila so (zaradi sin- tetiˇcnega ozadja) rekonstruirana kot odprti Dedekindovi rezi. Obˇsirna teorija je razvita, kdaj se metriˇcna in intrinziˇcna topologija ujemata. Na koncu prouˇcimo dobljene rezultate v ˇstirih izbranih modelih. Math. Subj. Class. (MSC 2010): 03F60, 18C50 Kljuˇcne besede: sintetiˇcen, topologija, metriˇcni prostori, realna ˇstevila, konstruktiven 8 Contents Introduction 11 0.1 Acknowledgements .................................
    [Show full text]
  • Cgweek Young Researchers Forum 2018
    CGWeek Young Researchers Forum 2018 Booklet of Abstracts 2018 This volume contains the abstracts of papers at “Computational Geometry: Young Researchers Forum” (CG:YRF), a satellite event of the 34th International Symposium on Computational Geometry, held in Budapest, Hungary on June 11-14, 2018. The CG:YRF program committee consisted of the following people: Don Sheehy (chair), University of Connecticut Peyman Afshani, Aarhus University Chao Chen, CUNY Queens College Elena Khramtcova, Université Libre de Bruxelles Irina Kostitsyna, TU Eindhoven Jon Lenchner, IBM Research, Africa Nabil Mustafa, ESIEE Paris Amir Nayyeri , Oregon State University Haitao Wang, Utah State University Yusu Wang, The Ohio State University There were 31 papers submitted to CG:YRF. Of these, 28 were accepted with revisions. Copyrights of the articles in these proceedings are maintained by their respective authors. More information about this conference and about previous and future editions is available online at http://www.computational-geometry.org/ Topology-aware Terrain Simplification Ulderico Fugacci Institute of Geometry, Graz University of Technology Kopernikusgasse 24, 8010 Graz, Austria [email protected] https://orcid.org/0000-0003-3062-997X Michael Kerber Institute of Geometry, Graz University of Technology Kopernikusgasse 24, 8010 Graz, Austria [email protected] https://orcid.org/0000-0002-8030-9299 Hugo Manet Département d’Informatique, École Normale Supérieure 45 rue d’Ulm, 75005 Paris, France [email protected] https://orcid.org/0000-0003-4649-2584 Abstract A common issue in terrain visualization is caused by oversampling of flat regions and of areas with constant slope. For a more compact representation, it is desirable to remove vertices in such areas, maintaining both the topological properties of the terrain and a good quality of the underlying mesh.
    [Show full text]
  • Introduction to Coding Theory
    Introduction Why Coding Theory ? Introduction Info Info Noise ! Info »?# Sink to Source Heh ! Sink Heh ! Coding Theory Encoder Channel Decoder Samuel J. Lomonaco, Jr. Dept. of Comp. Sci. & Electrical Engineering Noisy Channels University of Maryland Baltimore County Baltimore, MD 21250 • Computer communication line Email: [email protected] WebPage: http://www.csee.umbc.edu/~lomonaco • Computer memory • Space channel • Telephone communication • Teacher/student channel Error Detecting Codes Applied to Memories Redundancy Input Encode Storage Detect Output 1 1 1 1 0 0 0 0 1 1 Error 1 Erasure 1 1 31=16+5 Code 1 0 ? 0 0 0 0 EVN THOUG LTTRS AR MSSNG 1 16 Info Bits 1 1 1 0 5 Red. Bits 0 0 0 0 0 0 0 FRM TH WRDS N THS SNTNCE 1 1 1 1 0 0 0 0 1 1 1 Double 1 IT CN B NDRSTD 0 0 0 0 1 Error 1 Error 1 Erasure 1 1 Detecting 1 0 ? 0 0 0 0 1 1 1 1 Error Control Coding 0 0 1 1 0 0 31% Redundancy 1 1 1 1 Error Correcting Codes Applied to Memories Input Encode Storage Correct Output Space Channel 1 1 1 1 0 0 0 0 Mariner Space Probe – Years B.C. ( ≤ 1964) 1 1 Error 1 1 • 1 31=16+5 Code 1 0 1 0 0 0 0 Eb/N0 Pe 16 Info Bits 1 1 1 1 -3 0 5 Red. Bits 0 0 0 6.8 db 10 0 0 0 0 -5 1 1 1 1 9.8 db 10 0 0 0 0 1 1 1 Single 1 0 0 0 0 Error 1 1 • Mariner Space Probe – Years A.C.
    [Show full text]
  • Graph Convexity and Vertex Orderings by Rachel Jean Selma Anderson B.Sc., Mcgill University, 2002 B.Ed., University of Victoria
    Graph Convexity and Vertex Orderings by Rachel Jean Selma Anderson B.Sc., McGill University, 2002 B.Ed., University of Victoria, 2007 AThesisSubmittedinPartialFulfillmentofthe Requirements for the Degree of MASTER OF SCIENCE in the Department of Mathematics and Statistics c Rachel Jean Selma Anderson, 2014 University of Victoria All rights reserved. This thesis may not be reproduced in whole or in part, by photocopying or other means, without the permission of the author. ii Graph Convexity and Vertex Orderings by Rachel Jean Selma Anderson B.Sc., McGill University, 2002 B.Ed., University of Victoria, 2007 Supervisory Committee Dr. Ortrud Oellermann, Co-supervisor (Department of Mathematics and Statistics, University of Winnipeg) Dr. Gary MacGillivray, Co-supervisor (Department of Mathematics and Statistics, University of Victoria) iii Supervisory Committee Dr. Ortrud Oellermann, Co-supervisor (Department of Mathematics and Statistics, University of Winnipeg) Dr. Gary MacGillivray, Co-supervisor (Department of Mathematics and Statistics, University of Victoria) ABSTRACT In discrete mathematics, a convex space is an ordered pair (V, )where is a M M family of subsets of a finite set V ,suchthat: , V ,and is closed under ∅∈M ∈M M intersection. The elements of are called convex sets.ForasetS V ,theconvex M ⊆ hull of S is the smallest convex set that contains S.Apointx of a convex set X is an extreme point of X if X x is also convex. A convex space (V, )withtheproperty \{ } M that every convex set is the convex hull of its extreme points is called a convex geome- try.AgraphG has a P-elimination ordering if an ordering v1,v2,...,vn of the vertices exists such that vi has property P in the graph induced by vertices vi,vi+1,...,vn for all i =1, 2,...,n.
    [Show full text]
  • University of Cape Town Department of Mathematics and Applied Mathematics Faculty of Science
    The copyright of this thesis vests in the author. No quotation from it or information derived from it is to be published without full acknowledgementTown of the source. The thesis is to be used for private study or non- commercial research purposes only. Cape Published by the University ofof Cape Town (UCT) in terms of the non-exclusive license granted to UCT by the author. University University of Cape Town Department of Mathematics and Applied Mathematics Faculty of Science Convexity in quasi-metricTown spaces Cape ofby Olivier Olela Otafudu May 2012 University A thesis presented for the degree of Doctor of Philosophy prepared under the supervision of Professor Hans-Peter Albert KÄunzi. Abstract Over the last ¯fty years much progress has been made in the investigation of the hyperconvex hull of a metric space. In particular, Dress, Espinola, Isbell, Jawhari, Khamsi, Kirk, Misane, Pouzet published several articles concerning hyperconvex metric spaces. The principal aim of this thesis is to investigateTown the existence of an injective hull in the categories of T0-quasi-metric spaces and of T0-ultra-quasi- metric spaces with nonexpansive maps. Here several results obtained by others for the hyperconvex hull of a metric space haveCape been generalized by us in the case of quasi-metric spaces. In particular we haveof obtained some original results for the q-hyperconvex hull of a T0-quasi-metric space; for instance the q-hyperconvex hull of any totally bounded T0-quasi-metric space is joincompact. Also a construction of the ultra-quasi-metrically injective (= u-injective) hull of a T0-ultra-quasi- metric space is provided.
    [Show full text]
  • Basic Functional Analysis Master 1 UPMC MM005
    Basic Functional Analysis Master 1 UPMC MM005 Jean-Fran¸coisBabadjian, Didier Smets and Franck Sueur October 18, 2011 2 Contents 1 Topology 5 1.1 Basic definitions . 5 1.1.1 General topology . 5 1.1.2 Metric spaces . 6 1.2 Completeness . 7 1.2.1 Definition . 7 1.2.2 Banach fixed point theorem for contraction mapping . 7 1.2.3 Baire's theorem . 7 1.2.4 Extension of uniformly continuous functions . 8 1.2.5 Banach spaces and algebra . 8 1.3 Compactness . 11 1.4 Separability . 12 2 Spaces of continuous functions 13 2.1 Basic definitions . 13 2.2 Completeness . 13 2.3 Compactness . 14 2.4 Separability . 15 3 Measure theory and Lebesgue integration 19 3.1 Measurable spaces and measurable functions . 19 3.2 Positive measures . 20 3.3 Definition and properties of the Lebesgue integral . 21 3.3.1 Lebesgue integral of non negative measurable functions . 21 3.3.2 Lebesgue integral of real valued measurable functions . 23 3.4 Modes of convergence . 25 3.4.1 Definitions and relationships . 25 3.4.2 Equi-integrability . 27 3.5 Positive Radon measures . 29 3.6 Construction of the Lebesgue measure . 34 4 Lebesgue spaces 39 4.1 First definitions and properties . 39 4.2 Completeness . 41 4.3 Density and separability . 42 4.4 Convolution . 42 4.4.1 Definition and Young's inequality . 43 4.4.2 Mollifier . 44 4.5 A compactness result . 45 5 Continuous linear maps 47 5.1 Space of continuous linear maps . 47 5.2 Uniform boundedness principle{Banach-Steinhaus theorem .
    [Show full text]
  • Reed-Solomon Encoding and Decoding
    Bachelor's Thesis Degree Programme in Information Technology 2011 León van de Pavert REED-SOLOMON ENCODING AND DECODING A Visual Representation i Bachelor's Thesis | Abstract Turku University of Applied Sciences Degree Programme in Information Technology Spring 2011 | 37 pages Instructor: Hazem Al-Bermanei León van de Pavert REED-SOLOMON ENCODING AND DECODING The capacity of a binary channel is increased by adding extra bits to this data. This improves the quality of digital data. The process of adding redundant bits is known as channel encod- ing. In many situations, errors are not distributed at random but occur in bursts. For example, scratches, dust or fingerprints on a compact disc (CD) introduce errors on neighbouring data bits. Cross-interleaved Reed-Solomon codes (CIRC) are particularly well-suited for detection and correction of burst errors and erasures. Interleaving redistributes the data over many blocks of code. The double encoding has the first code declaring erasures. The second code corrects them. The purpose of this thesis is to present Reed-Solomon error correction codes in relation to burst errors. In particular, this thesis visualises the mechanism of cross-interleaving and its ability to allow for detection and correction of burst errors. KEYWORDS: Coding theory, Reed-Solomon code, burst errors, cross-interleaving, compact disc ii ACKNOWLEDGEMENTS It is a pleasure to thank those who supported me making this thesis possible. I am thankful to my supervisor, Hazem Al-Bermanei, whose intricate know- ledge of coding theory inspired me, and whose lectures, encouragement, and support enabled me to develop an understanding of this subject.
    [Show full text]
  • Equilateral Sets in Lp
    n Equilateral sets in lp Noga Alon ∗ Pavel Pudl´ak y May 23, 2002 Abstract We show that for every odd integer p 1 there is an absolute positive constant cp, ≥ n so that the maximum cardinality of a set of vectors in R such that the lp distance between any pair is precisely 1, is at most cpn log n. We prove some upper bounds for other lp norms as well. 1 Introduction An equilateral set (or a simplex) in a metric space, is a set A, so that the distance between any pair of distinct members of A is b, where b = 0 is a constant. Trivially, the maximum n 6 cardinality of such a set in R with respect to the (usual) l2-norm is n + 1. Somewhat surprisingly, the situation is far more complicated for the other lp norms. For a finite p > 1, ~ n ~ the lp-distance between two points ~a = (a1; : : : an) and b = (b1; : : : ; bn) in R is ~a b p = k − k n p 1=p ~ ~ ( k=1 ai bi ) . The l -distance between ~a and b is ~a b = max1 k n ai bi : For 1 1 ≤ ≤ P j − j n n k − k n j − j all p [1; ], lp denotes the space R with the lp-distance. Let e(lp ) denote the maximum 2 1 n possible cardinality of an equilateral set in lp . n Petty [6] proved that the maximum possible cardinality of an equilateral set in lp is at most 2n and that equality holds only in ln , as shown by the set of all 2n vectors with 0; 1- 1 coordinates.
    [Show full text]
  • The Range of Ultrametrics, Compactness, and Separability
    The range of ultrametrics, compactness, and separability Oleksiy Dovgosheya,∗, Volodymir Shcherbakb aDepartment of Theory of Functions, Institute of Applied Mathematics and Mechanics of NASU, Dobrovolskogo str. 1, Slovyansk 84100, Ukraine bDepartment of Applied Mechanics, Institute of Applied Mathematics and Mechanics of NASU, Dobrovolskogo str. 1, Slovyansk 84100, Ukraine Abstract We describe the order type of range sets of compact ultrametrics and show that an ultrametrizable infinite topological space (X, τ) is compact iff the range sets are order isomorphic for any two ultrametrics compatible with the topology τ. It is also shown that an ultrametrizable topology is separable iff every compatible with this topology ultrametric has at most countable range set. Keywords: totally bounded ultrametric space, order type of range set of ultrametric, compact ultrametric space, separable ultrametric space 2020 MSC: Primary 54E35, Secondary 54E45 1. Introduction In what follows we write R+ for the set of all nonnegative real numbers, Q for the set of all rational number, and N for the set of all strictly positive integer numbers. Definition 1.1. A metric on a set X is a function d: X × X → R+ satisfying the following conditions for all x, y, z ∈ X: (i) (d(x, y)=0) ⇔ (x = y); (ii) d(x, y)= d(y, x); (iii) d(x, y) ≤ d(x, z)+ d(z,y) . + + A metric space is a pair (X, d) of a set X and a metric d: X × X → R . A metric d: X × X → R is an ultrametric on X if we have d(x, y) ≤ max{d(x, z), d(z,y)} (1.1) for all x, y, z ∈ X.
    [Show full text]