Related papers: Signed Barcodes for Multi-Parameter Persistence vi…
We consider the task of building compact deep learning pipelines suitable for deployment on storage and power constrained mobile devices. We propose a unified framework to learn a broad family of structured parameter matrices that are…
For any persistence module $M$ over a finite poset $\mathbf{P}$, and any interval $I$ of $\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the…
Characterization of medium-range order in amorphous materials and its relation to short-range order is discussed. A new topological approach is presented here to extract a hierarchical structure of amorphous materials, which is robust…
To improve persistence diagram representation learning, we propose Multiset Transformer. This is the first neural network that utilizes attention mechanisms specifically designed for multisets as inputs and offers rigorous theoretical…
We combine standard persistent homology with image persistent homology to define a novel way of characterizing shapes and interactions between them. In particular, we introduce: (1) a mixup barcode, which captures geometric-topological…
The signed permutation modules are a simultaneous generalization of the ordinary permutation modules and the twisted permutation modules of the symmetric group. In a recent paper Dave Benson and Peter Symonds defined a new invariant…
This paper analyzes the representation theoretic stability, in the sense of Thomas Church and Benson Farb, of the rank-selected homology of the Boolean lattice and the partition lattice, proving sharp uniform representation stability bounds…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
We consider the problem of generating hypothesis from data based on ideas from logic. We introduce a notion of barcodes, which we call sequent barcodes, that mirrors the barcodes in persistent homology theory in topological data analysis.…
We present a row reduction algorithm to compute the barcode decomposition of persistence modules. This algorithm dualises the standard persistence one and clarifies the symmetry between clear and compress optimisations.
Approaches to signal representation and coding theory have traditionally focused on how to best represent signals using parsimonious representations that incur the lowest possible distortion. Classical examples include linear and non-linear…
We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…
This paper reviews the description of "bar codes" for a continuous real-valued map and explains how to recover the Morse complex of a Morse function from them. In this presentation the bar codes appear as the support of two vector-space…
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…
Extended persistence is a technique from topological data analysis to obtain global multiscale topological information from a graph. This includes information about connected components and cycles that are captured by the so-called…
We investigate the relations between algebraic structures, spectral invariants, and persistence modules, in the context of monotone Lagrangian Floer homology with Hamiltonian term. Firstly, we use the newly introduced method of filtered…
Multiparameter persistence modules come up naturally in topological data analysis and topological robotics. Given a metric graph $(X,\delta)$, the second configuration space of $(X,\delta)$ with proximity parameters (for example, the…
We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we propose an efficient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical LDPC codes for the rank…
A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.
Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…