Related papers: A computational framework for weighted simplicial …
We develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…
A weighted simplicial complex is a simplicial complex with values (called weights) on the vertices. In this paper, we consider weighted simplicial complexes with $\mathbb{R}^2$-valued weights. We study the weighted homology and the weighted…
Simplicial versions of topological abelian gauge theories are constructed which reproduce the continuum expressions for the partition function and Wilson expectation value of linked loops, expressible in terms of R-torsion and linking…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…
A topology preserving skeleton is a synthetic representation of an object that retains its topology and many of its significant morphological properties. The process of obtaining the skeleton, referred to as skeletonization or thinning, is…
We prove that the Bredon homology or cohomology of the partition complex with fairly general coefficients is either trivial or computable in terms of constructions with the Steinberg module. The argument involves developing a theory of…
This survey paper introduces to a technique called Torsion Subcomplex Reduction (TSR) for computing torsion in the cohomology of discrete groups acting on suitable cell complexes. TSR enables one to skip machine computations on cell…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
This paper is dedicated to the study of weight complexes (defined on triangulated categories endowed with weight structures) and their applications. We introduce pure (co)homological functors that "ignore all non-zero weights"; these have a…
The paper contains a collection of results related to weight structures, $t$-structures, and (more generally) to torsion pairs. For any weight structure $w$ we study (co)homological pure functors; these "ignore all weights except weight…
In this paper, we investigate the question of how one can recover the homology of a simplicial complex $X$ equipped with a regular action of a finite group $G$ from the structure of its quotient space $X/G.$ Specifically, we describe a…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
Computing homology and cohomology is at the heart of many recent works and a key issue for topological data analysis. Among homological objects, homology generators are useful to locate or understand holes (especially for geometric…
In this paper we consider simplicial families, that is, simplicial objects indexed by a simplicial set. We develop a method to construct family hypercover refinements of a cover family based on the notion of \emph{n-spans} that we introduce…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
We give a list of statements on the geometry of elliptic threefolds phrased only in the language of topology and homological algebra. Using only notions from topology and homological algebra, we recover existing results and prove new…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…