Related papers: Cup Product Persistence and Its Efficient Computat…
We study the stable cohomology groups of the mapping class groups of surfaces with twisted coefficients given by the $d^{th}$ exterior powers of the first rational homology of the unit tangent bundles of the surfaces…
When $k<n$, we study the coherent systems that come from a BGN extension in which the quotient bundle is strictly semistable. In this case we describe a stratification of the moduli space of coherent systems. We also describe the strata as…
In this paper, we show that the pointwise finite-dimensional two-parameter persistence module $\mathbb{HF}_*^{(\bullet,\bullet]}$, defined in terms of interlevel filtered Floer homology, is rectangle-decomposable. This allows for the…
Persistent homology has become an important tool for extracting geometric and topological features from data, whose multi-scale features are summarized in a persistence diagram. From a statistical perspective, however, persistence diagrams…
An explicit numerical strategy that practically preserves invariants is derived for conservative systems by combining an explicit high-order Runge-Kutta (RK) scheme with a simple modification of the standard projection approach, which is…
Zigzag persistence is a powerful extension of the standard persistence which allows deletions of simplices besides insertions. However, computing zigzag persistence usually takes considerably more time than the standard persistence. We…
Persistence modules that decompose into interval modules are important in topological data analysis because we can interpret such intervals as the lifetime of topological features in the data. We can classify the settings in which…
We define a category of filtered topological spaces and explore some of its homotopy theoretic properties, including a filtered analogue of CW approximation. With this, we define and study a filtered (weighted) variant of the Euler…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
We provide a differential structure on arbitrary cleft extensions $B:=A^{\mathrm{co}H}\subseteq A$ for an $H$-comodule algebra $A$. This is achieved by constructing a covariant calculus on the corresponding crossed product algebra…
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…
A topological invariant of a polynomial map $p:X\to B$ from a complex surface containing a curve $C\subset X$ to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus $g$…
In the previous three papers in this series, [WKO1]-[WKO3] (arXiv:1405.1956, arXiv:1405.1955, and to appear), Z. Dancso and I studied a certain theory of "homomorphic expansions" of "w-knotted objects", a certain class of knotted objects in…
Let $I=(\mathbb{Z}^3,26,6,B)$ be a 3D digital image, let $Q(I)$ be the associated cubical complex and let $\partial Q(I)$ be the subcomplex of $Q(I)$ whose maximal cells are the quadrangles of $Q(I)$ shared by a voxel of $B$ in the…
The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of…
We show in this work that homology in degree d of a congruence group, in a very general framework, defines a weakly polynomial functor of degree at most 2d and we describe this functor modulo polynomial functors of smaller degree. Our main…
In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
Based on previous results of digital topology, this paper focuses on algorithms of topological invariants of objects in 2D and 3D Digital Spaces. We specifically interest in solving hole counting of 2D objects and genus of closed surface in…
Computing persistence over changing filtrations give rise to a stack of 2D persistence diagrams where the birth-death points are connected by the so-called `vines'. We consider computing these vines over changing filtrations for zigzag…