Related papers: "Barcodes" for continuous maps and a brief introdu…

(lecture delivered at the Congress of the Romanian mathematicians, Brasov, June 2011) Using graph representations a new class of computable topological invariants associated with a tame real or angle valued map were recently introduced,…

In this note we recall the relations between the barcodes in level and sub-level persistence and make precise their relation with the Morse-Novikov complex of a Morse real- or angle-valued map. The results in this papers are implicit in my…

In this paper we review the definition of the invariants "bar codes" and "Jordan cells" of real and angle valued tame maps as proposed in Burghelea and Dey and Carlsson et al and prove the homotopy invariance of the sum # B^c_r +#B^o_{r-1}$…

The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special…

We extend the configurations discussed in Burghelea's book and Burghelea-Haller's paper on topology of angle-valued maps, equivalently the closed, open and closed-open bar codes from real- or angle-valued maps, to topological closed one…

We study circle valued maps and consider the persistence of the homology of their fibers. The outcome is a finite collection of computable invariants which answer the basic questions on persistence and in addition encode the topology of the…

In this paper one presents a collection of results about the "bar codes" and "Jordan blocks" introduced by Burghelea-Day as "computer friendly" invariants of a tame angle-valued map and one relates these invariants to the Betti numbers,…

Intending to introduce a method for the topological analysis of fields, we present a pipeline that takes as an input a weighted and based chain complex, produces a factored chain complex, and encodes it as a barcode of tagged intervals…

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…

We introduce graphcodes, a novel multi-scale summary of the topological properties of a dataset that is based on the well-established theory of persistent homology. Graphcodes handle datasets that are filtered along two real-valued scale…

We define notions of differentiability for maps from and to the space of persistence barcodes. Inspired by the theory of diffeological spaces, the proposed framework uses lifts to the space of ordered barcodes, from which derivatives can be…

In this paper a class of linear maps on the 2-torus and some planar piecewise isometries are discussed. For these discontinuous maps, by introducing codings underlying the map operations, symbolic descriptions of the dynamics and…

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…

We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our…

We propose to study neural networks' loss surfaces by methods of topological data analysis. We suggest to apply barcodes of Morse complexes to explore topology of loss surfaces. An algorithm for calculations of the loss function's barcodes…

We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

Graphcodes were recently introduced as a technique to employ two-parameter persistence modules in machine learning tasks (Kerber and Russold, NeurIPS 2024). We show in this work that a compressed version of graphcodes yields a description…

Sparse representations have been successfully applied to signal processing, computer vision and machine learning. Currently there is a trend to learn sparse models directly on structure data, such as region covariance. However, such methods…

Persistence modules and barcodes are used in symplectic topology to define various invariants of Hamiltonian diffeomorphisms, however numerical methods for computing these barcodes are not yet well developed. In this paper we define one…