Related papers: Differential Calculus on Hypergraphs and Mayer-Vie…
We use a Mayer-Vietoris-like spectral sequence to establish vanishing results for the cohomology of complements of linear and elliptic hyperplane arrangements, as part of a more general framework involving duality and abelian duality…
Recently, multi-scale notions of local homology (a variant of persistent homology) have been used to study the local structure of spaces around a given point from a point cloud sample. Current reconstruction guarantees rely on constructing…
We study the cohomology of forested graph complexes with ordered and unordered hairs whose cohomology computes the cohomology of a family of groups $\Gamma_{g,r}$ that generalize the (outer) automorphism group of free groups. We give…
Algorithms for the symbolic computation of conserved densities, fluxes, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations are presented. In the algorithms we use discrete versions of…
The Dolbeault resolution of the sheaf of holomorphic vector fields $Lie$ on a complex manifold $M$ relates $Lie$ to a sheaf of differential graded Lie algebras, known as the Fr\"olicher-Nijenhuis algebra $g$. We establish - following B. L.…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These algorithms make use of the clearing optimization and can be…
In this paper, we present a novel workflow consisting of algebraic algorithms and data structures for fast and topologically accurate conversion of vector data models such as Boundary Representations into voxels (topological voxelization);…
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…
Popular network models such as the mixed membership and standard stochastic block model are known to exhibit distinct geometric structure when embedded into $\mathbb{R}^{d}$ using spectral methods. The resulting point cloud concentrates…
To a coarse structure we associate a Grothendieck topology which is determined by coarse covers. A coarse map between coarse spaces gives rise to a morphism of Grothendieck topologies. This way we define sheaves and sheaf cohomology on…
We present a theory and applications of discrete exterior calculus on simplicial complexes of arbitrary finite dimension. This can be thought of as calculus on a discrete space. Our theory includes not only discrete differential forms but…
It is well known that the validity of the so called Lenard-Magri scheme of integrability of a bi-Hamiltonian PDE can be established if one has some precise information on the corresponding 1st variational Poisson cohomology for one of the…
The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth…
We develop a theory of persistent homology for directed simplicial complexes which detects persistent directed cycles in odd dimensions. We relate directed persistent homology to classical persistent homology, prove some stability results,…
In this paper, we present a formalization of an algorithm to construct admissible discrete vector fields in the Coq theorem prover taking advantage of the SSReflect library. Discrete vector fields are a tool which has been welcomed in the…
A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filtration of complexes $(K_i)$, we introduce a zigzag Morse…
We introduce the notion of a template for discrete Morse theory. Templates provide a memory efficient approach to the computation of homological invariants (e.g., homology, persistent homology, Conley complexes) of cell complexes. We…
We construct worst-case examples for the standard reduction algorithm for computing persistent homology. Our constructions are similar to the worst-case examples introduced by Morozov, but we replace the single-triangle arrangement with a…