DOCSLIB.ORG

The Algebra of Entanglement and the Geometry of Composition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Algebra of Entanglement and the Geometry of Composition The algebra of entanglement and the geometry of composition Amar Hadzihasanovic Wolfson College University of Oxford arXiv:1709.08086v2 [math.CT] 27 Sep 2017 A thesis submitted for the degree of Doctor of Philosophy Trinity 2017 Abstract String diagrams turn algebraic equations into topological moves. These moves have often-recurring shapes, involving the sliding of one diagram past another. In the past, this fact has mostly been considered in terms of its computational convenience; this thesis investigates its deeper reasons. In the first part of the thesis, we individuate, at its root, the dual nature of polygraphs — freely generated higher categories — as presentations of higher algeb- raic theories, and as combinatorial descriptions of “directed spaces”: CW complexes whose cells have their boundary subdivided into an input and an output region. Op- erations of polygraphs modelled on operations of topological spaces, including an asymmetric tensor product refining the topological product of spaces, can then be used as the foundation of a compositional universal algebra, where sliding moves of string diagrams for an algebraic theory arise from tensor products of sub-theories. Such compositions come automatically with higher-dimensional coherence cells. We provide several examples of compositional reconstructions of higher algebraic theor- ies, including theories of braids, homomorphisms of algebras, and distributive laws of monads, from operations on polygraphs. In this regard, the standard formalism of polygraphs, based on strict ω-categories, suffers from some technical problems and inadequacies, including the difficulty of computing tensor products. As a solution, we propose a notion of regular polygraph, barring cell boundaries that are degenerate, that is, not homeomorphic to a disk of the appropriate dimension. We develop the theory of globular posets, based on ideas of poset topology, in order to specify a category of shapes for cells of regular poly- graphs. We prove that these shapes satisfy our non-degeneracy requirement, and show how to calculate their tensor products. Then, we introduce a notion of weak unit for regular polygraphs, allowing us to recover weakly degenerate boundaries in low dimensions. We prove that the existence of weak units is equivalent to the existence of cells satisfying certain divisibility properties — an elementary notion of equivalence cell — which prompts new questions on the relation between units and equivalences in higher categories. In the second part of the thesis, we turn to specific applications of diagrammatic algebra to quantum theory. First, we re-evaluate certain aspects of quantum theory from the point of view of categorical universal algebra, which leads us to define a 2-dimensional refinement of the category of Hilbert spaces. Then, we focus on the problem of axiomatising fragments of quantum theory, and present the ZW calculus, the first complete diagrammatic axiomatisation of the theory of qubits. The ZW calculus has specific advantages over its predecessors, the ZX calculi, including the existence of a computationally meaningful normal form, and of a frag- ment whose diagrams can be interpreted physically as setups of fermionic oscillat- ors. Moreover, the choice of its generators reflects an operational classification of entangled quantum states, which is not well-understood for states of more than 3 qubits: our result opens the way for a compositional understanding of entanglement for generic multipartite states. We conclude with preliminary results on generalisa- tions of the ZW calculus to quantum systems of arbitrary finite dimension, including the definition of a universal set of generators in each dimension. Preface This thesis is a report of some results, and the state of my thoughts on a variety of subjects, after four years spent as a doctoral student in the Oxford Quantum Group. The overarching theme is the relationship between algebra, or computation, and geometry, or topology; another recurring theme is compositionality. That algebra is useful for geometry is a notion by now ingrained in mathematical thinking at any level. The converse is somewhat less mainstream, driven recently to the spotlight by the contributions of higher/homotopical algebra and higher category theory to a number of fields, including physics via topological quantum field theory. Even so, in many cases geometry inspires at most a change of environment for algebraic structures, where the algebraic concepts are interpreted in a less rigid context — “weaker”, in higher-categorical jargon — yet by themselves remain atomic and unvaried. That is, we may have “homomorphisms up to homotopy”, but the concept of homomorphism is still fundamentally algebraic. Is it? Being already interested, as a student, in category theory and mathematical physics, at some point in 2012 I saw a variant of = (1) in a paper of Bob Coecke’s on categorical quantum mechanics, and I was introduced to string diagrams. The fact that adjunctions, the omnipresent concept of categorical algebra, is encapsulated in graphical equations such as (1) struck me immediately; the following year I applied to become Bob’s student, largely because of the appeal that the diagrammatic approach, central to categorical quantum mechanics, had on me. Later on, thanks to Dan Marsden, I was exposed to = (2) and related equations, capturing the notion of algebra homomorphism in great gener- ality; similar pictures describe modules and their intertwiners. They endow the basic i ingredients of algebra with specific geometries, comprising planar isotopy (1) and “slid- ing rules” such as (2), and hinting at a connection at the most fundamental level. Sliding rules are particularly common in diagrammatic algebra, and after a while I was com- pelled to ask: why these specific pictures? Are there general combinatorial-geometric processes by which equations of a certain shape arise? With time, this question, and others spawned by its partial answers, have become the main focus of my research; they are the subject of the first three chapters, to which the geometry of composition in the title refers. The key to understanding came from an entirely separate line of applications of topology to algebra, namely, homotopical methods in rewriting theory, and in particular their recent reworking into the theory of polygraphs, due to Albert Burroni and others. A polygraph is a presentation of a higher category or algebraic theory, but it is also a combinatorial model of a CW complex, made up of abstract “directed cells”: it is my claim, in this thesis, that the specific efficacy of string diagrams and their higher-dimensional generalisations rests on this analogy. On the other hand, the algebra of entanglement refers to certain algebraic theories, relevant to quantum information theory, on which I worked before and besides focussing on the questions above. Entanglement is a property of quantum systems that trans- lates, diagrammatically, into connectedness, hence a topological property; yet Bob and Aleks Kissinger linked it to the properties of certain algebras in the category of Hilbert spaces (Section 4.3). It seemed an ideal testing ground for the dual algebraic-topological nature of string diagrams, and it led me to develop the ZW calculus, the first complete diagrammatic axiomatisation of the theory of qubits, which is the main subject of the last two chapters. In fact, the bulk of my work on the ZW calculus came before and was a catalyst for the broader scope of the first part. Even from this short summary, then, it should be clear that the structure of the thesis does not reflect chronology in any meaningful way. The path to the current shape of this work has been (unsurprisingly) tortuous, full of wrong intuitions and all-out changes of mind; more will come in the future, no doubt. So, before leaving you to the post-processed flow of arguments, I will attempt a quick recollection of my actual thought process through its main turns, and thus provide an alternative summary of the thesis. I hope that the knowledge of some abandoned ideas may complement the surviving ones. Early in 2014, I followed Bob’s suggestion to look into the “GHZ/W calculus”, as an early sketch of the ZW calculus was called. I had recently learned about its precursor, the ZX calculus (Section 4.2), whose completeness for the stabiliser fragment of quantum mechanics was proved by Miriam Backens around that time, and what I especially liked about it was the undirectedness: the generators were symmetrical with respect to the swapping and transposition of wires, so the string diagrams could effectively be manipu- lated as labelled graphs. The GHZ/W calculus did not initially share this property, and I decided that I had to make it undirected as well. My intuition, at the time, was that these graph-like string diagrams reveal a deeper, ii undirected geometry of processes, which gets lost in the “bureaucracy” of categorical algebra, with its need for direction and composition functors and structural morphisms; in this I was influenced by Bob’s comments in this direction, and those of Jean-Yves Girard, and others, on proof nets being a kind of de-bureaucratised proof theory. In other words, the geometry is fundamental, while the categorical algebra is imposed on it to express compositions combinatorially. In the early summer of 2014 I discovered a normal form for ZW diagrams, and in August 2014 I had a complete axiomatisation, together with a proof of completeness for what is called the vanilla ZW calculus in Section 5.1. The proof for the general R-labelled case, Theorem 5.27, came only a couple of years later, not because it is substantially different or more complicated, but because I had not tried. The case R = C of Theorem 5.27 is completeness for the theory of qubits, what had escaped the ZX calculi for nearly a decade: it means that any calculation on pure quantum states of a number of qubits that can be performed with vector calculus, or matrix calculus, can also be performed diagrammatically, using the axioms of the ZW calculus.
Load more

Recommended publications
  • Arxiv:1712.06224V3 [Math.MG] 27 May 2018 Yusu Wang3 Department of Computer Science, the Ohio State University
    Vietoris–Rips and Čech Complexes of Metric Gluings 03:1 Vietoris–Rips and Čech Complexes of Metric Gluings Michał Adamaszek MOSEK ApS Copenhagen, Denmark [email protected] https://orcid.org/0000-0003-3551-192X Henry Adams Department of Mathematics, Colorado State University Fort Collins, CO, USA [email protected] https://orcid.org/0000-0003-0914-6316 Ellen Gasparovic Department of Mathematics, Union College Schenectady, NY, USA [email protected] https://orcid.org/0000-0003-3775-9785 Maria Gommel Department of Mathematics, University of Iowa Iowa City, IA, USA [email protected] https://orcid.org/0000-0003-2714-9326 Emilie Purvine Computing and Analytics Division, Pacific Northwest National Laboratory Seattle, WA, USA [email protected] https://orcid.org/0000-0003-2069-5594 Radmila Sazdanovic1 Department of Mathematics, North Carolina State University Raleigh, NC, USA [email protected] https://orcid.org/0000-0003-1321-1651 Bei Wang2 School of Computing, University of Utah Salt Lake City, UT, USA [email protected] arXiv:1712.06224v3 [math.MG] 27 May 2018 https://orcid.org/0000-0002-9240-0700 Yusu Wang3 Department of Computer Science, The Ohio State University 1 Simons Collaboration Grant 318086 2 NSF IIS-1513616 and NSF ABI-1661375 3 NSF CCF-1526513, CCF-1618247, CCF-1740761, and DMS-1547357 Columbus, OH, USA [email protected] https://orcid.org/0000-0001-7950-4348 Lori Ziegelmeier Department of Mathematics, Statistics, and Computer Science, Macalester College Saint Paul, MN, USA [email protected] https://orcid.org/0000-0002-1544-4937 Abstract We study Vietoris–Rips and Čech complexes of metric wedge sums and metric gluings.
    [Show full text]
  • ALGEBRAIC TOPOLOGY Contents 1. Preliminaries 1 2. the Fundamental
    ALGEBRAIC TOPOLOGY RAPHAEL HO Abstract. The focus of this paper is a proof of the Nielsen-Schreier Theorem, stating that every subgroup of a free group is free, using tools from algebraic topology. Contents 1. Preliminaries 1 2. The Fundamental Group 2 3. Van Kampen's Theorem 5 4. Covering Spaces 6 5. Graphs 9 Acknowledgements 11 References 11 1. Preliminaries Notations 1.1. I [0, 1] the unit interval Sn the unit sphere in Rn+1 × standard cartesian product ≈ isomorphic to _ the wedge sum A − B the space fx 2 Ajx2 = Bg A=B the quotient space of A by B. In this paper we assume basic knowledge of set theory. We also assume previous knowledge of standard group theory, including the notions of homomorphisms and quotient groups. Let us begin with a few reminders from algebra. Definition 1.2. A group G is a set combined with a binary operator ? satisfying: • For all a; b 2 G, a ? b 2 G. • For all a; b; c 2 G,(a ? b) ? c = a ? (b ? c). • There exists an identity element e 2 G such that e ? a = a ? e = a. • For all a 2 G, there exists an inverse element a−1 2 G such that a?a−1 = e. A convenient way to describe a particular group is to use a presentation, which consists of a set S of generators such that each element of the group can be written Date: DEADLINE AUGUST 22, 2008. 1 2 RAPHAEL HO as a product of elements in S, and a set R of relations which define under which conditions we are able to simplify our `word' of product of elements in S.
    [Show full text]
  • Math 601 Algebraic Topology Hw 4 Selected Solutions Sketch/Hint
    MATH 601 ALGEBRAIC TOPOLOGY HW 4 SELECTED SOLUTIONS SKETCH/HINT QINGYUN ZENG 1. The Seifert-van Kampen theorem 1.1. A refinement of the Seifert-van Kampen theorem. We are going to make a refinement of the theorem so that we don't have to worry about that openness problem. We first start with a definition. Definition 1.1 (Neighbourhood deformation retract). A subset A ⊆ X is a neighbourhood defor- mation retract if there is an open set A ⊂ U ⊂ X such that A is a strong deformation retract of U, i.e. there exists a retraction r : U ! A and r ' IdU relA. This is something that is true most of the time, in sufficiently sane spaces. Example 1.2. If Y is a subcomplex of a cell complex, then Y is a neighbourhood deformation retract. Theorem 1.3. Let X be a space, A; B ⊆ X closed subspaces. Suppose that A, B and A \ B are path connected, and A \ B is a neighbourhood deformation retract of A and B. Then for any x0 2 A \ B. π1(X; x0) = π1(A; x0) ∗ π1(B; x0): π1(A\B;x0) This is just like Seifert-van Kampen theorem, but usually easier to apply, since we no longer have to \fatten up" our A and B to make them open. If you know some sheaf theory, then what Seifert-van Kampen theorem really says is that the fundamental groupoid Π1(X) is a cosheaf on X. Here Π1(X) is a category with object pints in X and morphisms as homotopy classes of path in X, which can be regard as a global version of π1(X).
    [Show full text]
  • Diagrammatics in Categorification and Compositionality
    Diagrammatics in Categorification and Compositionality by Dmitry Vagner Department of Mathematics Duke University Date: Approved: Ezra Miller, Supervisor Lenhard Ng Sayan Mukherjee Paul Bendich Dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2019 ABSTRACT Diagrammatics in Categorification and Compositionality by Dmitry Vagner Department of Mathematics Duke University Date: Approved: Ezra Miller, Supervisor Lenhard Ng Sayan Mukherjee Paul Bendich An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2019 Copyright c 2019 by Dmitry Vagner All rights reserved Abstract In the present work, I explore the theme of diagrammatics and their capacity to shed insight on two trends|categorification and compositionality|in and around contemporary category theory. The work begins with an introduction of these meta- phenomena in the context of elementary sets and maps. Towards generalizing their study to more complicated domains, we provide a self-contained treatment|from a pedagogically novel perspective that introduces almost all concepts via diagrammatic language|of the categorical machinery with which we may express the broader no- tions found in the sequel. The work then branches into two seemingly unrelated disciplines: dynamical systems and knot theory. In particular, the former research defines what it means to compose dynamical systems in a manner analogous to how one composes simple maps. The latter work concerns the categorification of the slN link invariant. In particular, we use a virtual filtration to give a more diagrammatic reconstruction of Khovanov-Rozansky homology via a smooth TQFT.
    [Show full text]
  • Duality and Traces for Indexed Monoidal Categories
    DUALITY AND TRACES FOR INDEXED MONOIDAL CATEGORIES KATE PONTO AND MICHAEL SHULMAN Abstract. By the Lefschetz fixed point theorem, if an endomorphism of a topological space is fixed-point-free, then its Lefschetz number vanishes. This necessary condition is not usually sufficient, however; for that we need a re- finement of the Lefschetz number called the Reidemeister trace. Abstractly, the Lefschetz number is a trace in a symmetric monoidal cate- gory, while the Reidemeister trace is a trace in a bicategory. In this paper, we show that for any symmetric monoidal category with an associated indexed symmetric monoidal category, there is an associated bicategory which produces refinements of trace analogous to the Reidemeister trace. This bicategory also produces a new notion of trace for parametrized spaces with dualizable fibers, which refines the obvious “fiberwise" traces by incorporating the action of the fundamental group of the base space. Our abstract framework lays the foundation for generalizations of these ideas to other contexts. Contents 1. Introduction2 2. Indexed monoidal categories5 3. Indexed coproducts8 4. Symmetric monoidal traces 12 5. Shadows from indexed monoidal categories 15 6. Fiberwise duality 22 7. Base change objects 27 8. Total duality 29 9. String diagrams for objects 39 10. String diagrams for morphisms 42 11. Proofs for fiberwise duality and trace 49 12. Proofs for total duality and trace 63 References 65 Date: Version of October 31, 2011. Both authors were supported by National Science Foundation postdoctoral fellowships during the writing of this paper. This version of this paper contains diagrams that use dots and dashes to distinguish different features, and is intended for printing on a black and white printer.
    [Show full text]
  • Lecture 2: Spaces of Maps, Loop Spaces and Reduced Suspension
    LECTURE 2: SPACES OF MAPS, LOOP SPACES AND REDUCED SUSPENSION In this section we will give the important constructions of loop spaces and reduced suspensions associated to pointed spaces. For this purpose there will be a short digression on spaces of maps between (pointed) spaces and the relevant topologies. To be a bit more specific, one aim is to see that given a pointed space (X; x0), then there is an entire pointed space of loops in X. In order to obtain such a loop space Ω(X; x0) 2 Top∗; we have to specify an underlying set, choose a base point, and construct a topology on it. The underlying set of Ω(X; x0) is just given by the set of maps 1 Top∗((S ; ∗); (X; x0)): A base point is also easily found by considering the constant loop κx0 at x0 defined by: 1 κx0 :(S ; ∗) ! (X; x0): t 7! x0 The topology which we will consider on this set is a special case of the so-called compact-open topology. We begin by introducing this topology in a more general context. 1. Function spaces Let K be a compact Hausdorff space, and let X be an arbitrary space. The set Top(K; X) of continuous maps K ! X carries a natural topology, called the compact-open topology. It has a subbasis formed by the sets of the form B(T;U) = ff : K ! X j f(T ) ⊆ Ug where T ⊆ K is compact and U ⊆ X is open. Thus, for a map f : K ! X, one can form a typical basis open neighborhood by choosing compact subsets T1;:::;Tn ⊆ K and small open sets Ui ⊆ X with f(Ti) ⊆ Ui to get a neighborhood Of of f, Of = B(T1;U1) \ ::: \ B(Tn;Un): One can even choose the Ti to cover K, so as to `control' the behavior of functions g 2 Of on all of K.
    [Show full text]
  • Persistent Homology of Unweighted Complex Networks Via Discrete
    www.nature.com/scientificreports OPEN Persistent homology of unweighted complex networks via discrete Morse theory Received: 17 January 2019 Harish Kannan1, Emil Saucan2,3, Indrava Roy1 & Areejit Samal 1,4 Accepted: 6 September 2019 Topological data analysis can reveal higher-order structure beyond pairwise connections between Published: xx xx xxxx vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and undirected networks using persistent homology. Leveraging on the features of discrete Morse theory, our method not only captures the topology of the clique complex of such graphs via the concept of critical simplices, but also achieves close to the theoretical minimum number of critical simplices in several analyzed model and real networks. This leads to a reduced fltration scheme based on the subsequence of the corresponding critical weights, thereby leading to a signifcant increase in computational efciency. We have employed our fltration scheme to explore the persistent homology of several model and real-world networks. In particular, we show that our method can detect diferences in the higher-order structure of networks, and the corresponding persistence diagrams can be used to distinguish between diferent model networks. In summary, our method based on discrete Morse theory further increases the applicability of persistent homology to investigate the global topology of complex networks. In recent years, the feld of topological data analysis (TDA) has rapidly grown to provide a set of powerful tools to analyze various important features of data1. In this context, persistent homology has played a key role in bring- ing TDA to the fore of modern data analysis.
    [Show full text]
  • The Joy of String Diagrams Pierre-Louis Curien
    The joy of string diagrams Pierre-Louis Curien To cite this version: Pierre-Louis Curien. The joy of string diagrams. Computer Science Logic, Sep 2008, Bertinoro, Italy. pp.15-22. hal-00697115 HAL Id: hal-00697115 https://hal.archives-ouvertes.fr/hal-00697115 Submitted on 14 May 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Joy of String Diagrams Pierre-Louis Curien Preuves, Programmes et Syst`emes,CNRS and University Paris 7 May 14, 2012 Abstract In the past recent years, I have been using string diagrams to teach basic category theory (adjunctions, Kan extensions, but also limits and Yoneda embedding). Us- ing graphical notations is undoubtedly joyful, and brings us close to other graphical syntaxes of circuits, interaction nets, etc... It saves us from laborious verifications of naturality, which is built-in in string diagrams. On the other hand, the language of string diagrams is more demanding in terms of typing: one may need to introduce explicit coercions for equalities of functors, or for distinguishing a morphism from a point in the corresponding internal homset. So that in some sense, string diagrams look more like a language ”`ala Church", while the usual mathematics of, say, Mac Lane's "Categories for the working mathematician" are more ”`ala Curry".
    [Show full text]
  • Graph Reconstruction by Discrete Morse Theory Arxiv:1803.05093V2 [Cs.CG] 21 Mar 2018
    Graph Reconstruction by Discrete Morse Theory Tamal K. Dey,∗ Jiayuan Wang,∗ Yusu Wang∗ Abstract Recovering hidden graph-like structures from potentially noisy data is a fundamental task in modern data analysis. Recently, a persistence-guided discrete Morse-based framework to extract a geometric graph from low-dimensional data has become popular. However, to date, there is very limited theoretical understanding of this framework in terms of graph reconstruction. This paper makes a first step towards closing this gap. Specifically, first, leveraging existing theoretical understanding of persistence-guided discrete Morse cancellation, we provide a simplified version of the existing discrete Morse-based graph reconstruction algorithm. We then introduce a simple and natural noise model and show that the aforementioned framework can correctly reconstruct a graph under this noise model, in the sense that it has the same loop structure as the hidden ground-truth graph, and is also geometrically close. We also provide some experimental results for our simplified graph-reconstruction algorithm. 1 Introduction Recovering hidden structures from potentially noisy data is a fundamental task in modern data analysis. A particular type of structure often of interest is the geometric graph-like structure. For example, given a collection of GPS trajectories, recovering the hidden road network can be modeled as reconstructing a geometric graph embedded in the plane. Given the simulated density field of dark matters in universe, finding the hidden filamentary structures is essentially a problem of geometric graph reconstruction. Different approaches have been developed for reconstructing a curve or a metric graph from input data. For example, in computer graphics, much work have been done in extracting arXiv:1803.05093v2 [cs.CG] 21 Mar 2018 1D skeleton of geometric models using the medial axis or Reeb graphs [10, 29, 20, 16, 22, 7].
    [Show full text]
  • Arxiv:2012.08669V1 [Math.CT] 15 Dec 2020 2 Preface
    Sheaf Theory Through Examples (Abridged Version) Daniel Rosiak December 12, 2020 arXiv:2012.08669v1 [math.CT] 15 Dec 2020 2 Preface After circulating an earlier version of this work among colleagues back in 2018, with the initial aim of providing a gentle and example-heavy introduction to sheaves aimed at a less specialized audience than is typical, I was encouraged by the feedback of readers, many of whom found the manuscript (or portions thereof) helpful; this encouragement led me to continue to make various additions and modifications over the years. The project is now under contract with the MIT Press, which would publish it as an open access book in 2021 or early 2022. In the meantime, a number of readers have encouraged me to make available at least a portion of the book through arXiv. The present version represents a little more than two-thirds of what the professionally edited and published book would contain: the fifth chapter and a concluding chapter are missing from this version. The fifth chapter is dedicated to toposes, a number of more involved applications of sheaves (including to the \n- queens problem" in chess, Schreier graphs for self-similar groups, cellular automata, and more), and discussion of constructions and examples from cohesive toposes. Feedback or comments on the present work can be directed to the author's personal email, and would of course be appreciated. 3 4 Contents Introduction 7 0.1 An Invitation . .7 0.2 A First Pass at the Idea of a Sheaf . 11 0.3 Outline of Contents . 20 1 Categorical Fundamentals for Sheaves 23 1.1 Categorical Preliminaries .
    [Show full text]
  • RGB Image-Based Data Analysis Via Discrete Morse Theory and Persistent Homology
    RGB IMAGE-BASED DATA ANALYSIS 1 RGB image-based data analysis via discrete Morse theory and persistent homology Chuan Du*, Christopher Szul,* Adarsh Manawa, Nima Rasekh, Rosemary Guzman, and Ruth Davidson** Abstract—Understanding and comparing images for the pur- uses a combination of DMT for the partitioning and skeletoniz- poses of data analysis is currently a very computationally ing (in other words finding the underlying topological features demanding task. A group at Australian National University of) images using differences in grayscale values as the distance (ANU) recently developed open-source code that can detect function for DMT and PH calculations. fundamental topological features of a grayscale image in a The data analysis methods we have developed for analyzing computationally feasible manner. This is made possible by the spatial properties of the images could lead to image-based fact that computers store grayscale images as cubical cellular complexes. These complexes can be studied using the techniques predictive data analysis that bypass the computational require- of discrete Morse theory. We expand the functionality of the ments of machine learning, as well as lead to novel targets ANU code by introducing methods and software for analyzing for which key statistical properties of images should be under images encoded in red, green, and blue (RGB), because this study to boost traditional methods of predictive data analysis. image encoding is very popular for publicly available data. Our The methods in [10], [11] and the code released with them methods allow the extraction of key topological information from were developed to handle grayscale images. But publicly avail- RGB images via informative persistence diagrams by introducing able image-based data is usually presented in heat-map data novel methods for transforming RGB-to-grayscale.
    [Show full text]
  • The Capacity of Wedge Sum of Spheres of Different Dimensions
    The Capacity of Wedge Sum of Spheres of Different Dimensions Mojtaba Mohareri, Behrooz Mashayekhy∗, Hanieh Mirebrahimi Department of Pure Mathematics, Center of Excellence in Analysis on Algebraic Structures, Ferdowsi University of Mashhad, P.O.Box 1159-91775, Mashhad, Iran. Abstract K. Borsuk in 1979, in the Topological Conference in Moscow, introduced the concept of the capacity of a compactum and raised some interesting questions about it. In this paper, during computing the capacity of wedge sum of finitely many spheres of different dimensions and the complex projective plane, we give a negative answer to a question of Borsuk whether the capacity of a compactum determined by its homology properties. Keywords: Homotopy domination, Homotopy type, Moore space, Polyhedron, CW-complex, Compactum. 2010 MSC: 55P15, 55P55, 55P20,54E30, 55Q20. 1. Introduction and Motivation K. Borsuk in [2], introduced the concept of the capacity of a compactum (compact metric space) as follows: the capacity C(A) of a compactum A is the cardinality of the set of all shapes of compacta X for which Sh(X) 6 Sh(A) (for more details, see [10]). For polyhedra, the notions shape and shape domination in the above definition arXiv:1611.00487v1 [math.AT] 2 Nov 2016 can be replaced by the notions homotopy type and homotopy domination, respec- tively. Indeed, by some known results in shape theory one can conclude that for any polyhedron P , there is a one to one functorial correspondence between the shapes of compacta shape dominated by P and the homotopy types of CW-complexes (not ∗Corresponding author Email addresses: [email protected] (Mojtaba Mohareri), [email protected] (Behrooz Mashayekhy), h−[email protected] (Hanieh Mirebrahimi) Preprint submitted to September 20, 2018 necessarily finite) homotopy dominated by P (for both pointed and unpointed poly- hedra) [6].
    [Show full text]