Related papers: Persistent Cycle Representatives and Generalized L…

We define a hierarchy of special classes of constrained Willmore surfaces by means of the existence of a polynomial conserved quantity of some type, filtered by an integer. Type 1 with parallel top term characterises parallel mean curvature…

We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. The…

We construct a filtered simplicial complex $(X_L,f_L)$ associated to a subset $X\subset \mathbb{R}^d$, a function $f:X\rightarrow \mathbb{R}$ with compactly supported sublevel sets, and a collection of landmark points $L\subset…

We can view the Lipschitz constant as a height function on the space of maps between two manifolds and ask (as Gromov did nearly 30 years ago) what its ``Morse landscape'' looks like: are there high peaks, deep valleys and mountain passes?…

We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…

A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…

In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transform proposed in [1], and it is defined via a hierarchical…

We introduce a two-parameter framework that refines several classical graph invariants by imposing higher-order constraints along bounded-length geodesics. For integers $k,d\ge1$, a vertex set is called $k,d$-independent if every shortest…

Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…

The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice,…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

We study embeddings between reproducing kernel Hilbert spaces $H(K)$ of functions of $d \in \mathbb{N} \cup \{\infty\}$ variables. The kernels $K$ are superpositions of weighted finite tensor products of a fixed univariate kernel. The basic…

Correspondences between k-tuples of points are key in multiple view geometry and motion analysis. Regular transformations are posed by homographies between two projective planes that serves as structural models for images. Such…

We compute the singular support and the characteristic cycle of a rank 1 sheaf on a smooth variety in codimension 2 using ramification theory, when the ramification of the sheaf is clean. We develop a general theory, called the partially…

We show that recent results on randomized dimension reduction schemes that exploit structural properties of data can be applied in the context of persistent homology. In the spirit of compressed sensing, the dimension reduction is…

Representing Z/N as roots of unity, we restrict a natural U(1)-action on the Heegaard quantum sphere to Z/N, and call the quotient spaces Heegaard quantum lens spaces. Then we use this representation of Z/N to construct an associated…

I present the most fundamental features of an implemented system designed to manipulate representations of regular languages. The system is structured into two layers, allowing regular languages to be represented in an increasingly compact,…

We propose a study of multipartite entanglement through persistent homology, a tool used in topological data analysis. In persistent homology, a 1-parameter filtration of simplicial complexes called persistence complex is used to reveal…

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

A filtration over a simplicial complex $K$ is an ordering of the simplices of $K$ such that all prefixes in the ordering are subcomplexes of $K$. Filtrations are at the core of Persistent Homology, a major tool in Topological Data Analysis.…