Related papers: Differential Calculus on Hypergraphs and Mayer-Vie…
We introduce Mayer path homology, a new homology theory for directed path complexes obtained by equipping path complexes with an $N$-nilpotent differential. The main novelty of this work is the introduction of an $N$-differential on path…
Persistent homology is an effective method for extracting topological information, represented as persistent diagrams, of spatial structure data. Hence it is well-suited for the study of protein structures. Attempts to incorporate…
The Euler-Koszul complex is the fundamental tool in the homological study of A-hypergeometric differential systems and functions. We compare Euler-Koszul homology with D-module direct images from the torus to the base space through orbits…
We study a family of invariants of compact metric spaces that combines the Curvature Sets defined by Gromov in the 1980s with Vietoris-Rips Persistent Homology. For given integers $k\geq 0$ and $n\geq 1$ we consider the dimension $k$…
We investigate higher topological cyclic homology as an approach to studying chromatic phenomena in homotopy theory. Higher topological cyclic homology is constructed from the fixed points of a version of topological Hochschild homology…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
In this article, discrete variants of several results from vector calculus are studied for classical finite difference summation by parts operators in two and three space dimensions. It is shown that existence theorems for scalar/vector…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly quadratic in the number of vertices $n$, and therefore a…
In this paper, three Computational Topology methods (namely effective homology, persistent homology and discrete vector fields) are mixed together to produce algorithms for homological digital image processing. The algorithms have been…
This paper is devoted to the horizontal (``characteristic'') cohomology of systems of differential equations. Recent results on computing the horizontal cohomology via the compatibility complex are generalized. New results on the Vinogradov…
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,…
In a series of publications we developed "differential geometry" on discrete sets based on concepts of noncommutative geometry. In particular, it turned out that first order differential calculi (over the algebra of functions) on a discrete…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
Independence complexes of circle graphs are purely combinatorial objects. However, when constructed from some diagram of a link $L$, they reveal topological properties of $L$, more specifically, of its Khovanov homology. We analyze the…
Persistent homology has been widely used to study the topology of point clouds in $\mathbb{R}^n$. Standard approaches are very sensitive to outliers, and their computational complexity depends badly on the number of data points. In this…
Our main objective is to demonstrate how homological perturbation theory (HPT) results over the last 40 years immediately or with little extra work give some of the Koszul duality results that have appeared in the last decade. Higher…
Persistent (co)homology is a central construction in topological data analysis, where it is used to quantify prominence of features in data to produce stable descriptors suitable for downstream analysis. Persistence is challenging to…
In this paper, we generalize the embedded homology groups of hypergraphs initially given in [S. Bressan, J. Li, S. Ren, and J. Wu, The embedded homology of hypergraphs and applications, Asian J. Math. 23(3)(2019) 479-500] and study the…