Related papers: Reducing complexes in multidimensional persistent …
Due to advances in computer hardware and new algorithms, it is now possible to perform highly accurate many-body simulations of realistic materials with all their intrinsic complications. The success of these simulations leaves us with a…
In this paper, we study some useful properties of persistent pairs in a discrete Morse function on a simplicial complex $K$. In case of $\dim K=1$ (i.e., a graph), by using the properties, we characterize strongly connectedness of critical…
We consider iterative (`turbo') algorithms for compressed sensing. First, a unified exposition of the different approaches available in the literature is given, thereby enlightening the general principles and main differences. In particular…
In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…
We introduce a Morse theory for posets of Bestvina-Brady type combining matchings and height functions. This theory generalizes Forman's discrete Morse theory for regular CW-complexes and extends previous results on Morse theory for…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
Floer theory was originally devised to estimate the number of 1-periodic orbits of Hamiltonian systems. In earlier works, we constructed Floer homology for homoclinic orbits on two dimensional manifolds using combinatorial techniques. In…
In this paper, we consider topological featurizations of data defined over simplicial complexes, like images and labeled graphs, obtained by convolving this data with various filters before computing persistence. Viewing a convolution…
Morse complexes and Morse-Smale complexes are topological descriptors popular in topology-based visualization. Comparing these complexes plays an important role in their applications in feature correspondences, feature tracking, symmetry…
We show the existence of an MA-complete homology problem for a certain subclass of simplicial complexes. The problem is defined through a new concept of orientability of simplicial complexes that we call a "uniform orientable filtration",…
Bilateral filters have wide spread use due to their edge-preserving properties. The common use case is to manually choose a parametric filter type, usually a Gaussian filter. In this paper, we will generalize the parametrization and in…
Reduction of combinatorial filters involves compressing state representations that robots use. Such optimization arises in automating the construction of minimalist robots. But exact combinatorial filter reduction is an NP-complete problem…
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now widely used in topological data analysis,…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
This work addresses the problem of learning sparse representations of tensor data using structured dictionary learning. It proposes learning a mixture of separable dictionaries to better capture the structure of tensor data by generalizing…
We consider continuous Dirac operators defined on $\mathbf{R}^d$, $d\in\{1,2,3\}$, together with various discrete versions of them. Both forward-backward and symmetric finite differences are used as approximations to partial derivatives. We…
We study how powerful algebraic discrete Morse theory is when applied to hull resolutions. The main result describes all cases when the hull resolution of the edge ideal of the complement of a triangle-free graph can be made minimal using…
We present in this paper a framework which leverages the underlying topology of a data set, in order to produce appropriate coordinate representations. In particular, we show how to construct maps to real and complex projective spaces,…
In this work we address the reduction of face degrees of freedom (DOFs) for discrete elasticity complexes. Specifically, using serendipity techniques, we develop a reduced version of a recently introduced two-dimensional complex arising…