Related papers: An algorithmic discrete gradient field and the coh…

For a positive integer $n$ and a finite simplicial complex $K$, we describe an algorithmic procedure constructing a maximal discrete gradient field $W(K,n)$ on Abrams' discretized configuration space $\text{DConf}(K,n)$. Computer…

Bouc (1992) first studied the topological properties of $M_n$, the matching complex of the complete graph of order $n$, in connection with Brown complexes and Quillen complexes. Bj\"{o}rner et al. (1994) showed that $M_n$ is homotopically…

One of the primary methods of studying the topology of configurations of points in a graph and configurations of disks in a planar region has been to examine discrete combinatorial models arising from the underlying spaces. Despite the…

In this corrigendum to arXiv:2305.02973, we justify that the motivation behind Conjecture 5.1 is based on a mistaken notion. Moreover, we prove a stronger theorem that disproves the conjecture, and obtain an optimal gradient vector field on…

We address the basic question in discrete Morse theory of combining discrete gradient fields that are partially defined on subsets of the given complex. This is a well-posed question when the discrete gradient field $V$ is generated using a…

The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…

Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the author determines the topology (homotopy type) of the abstract…

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…

In this paper higher order mimetic discretizations are introduced which are firmly rooted in the geometry in which the variables are defined. The paper shows how basic constructs in differential geometry have a discrete counterpart in…

In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these…

We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…

Grothendieck has proved that each class in the de Rham cohomology of a smooth complex affine variety can be represented by a differential form with polynomial coefficients. After having proved a single exponential bound for the degrees of…

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…

For the double complex structure of grading-restricted vertex algebra cohomology defined in \cite{Huang}, we introduce a multiplication of elements of double complex spaces. We show that the orthogonality and bi-grading conditions applied…

We develop a discrete Morse theory for open simplicial complexes $K=X\setminus T$ where $X$ is a simplicial complex and $T$ a subcomplex of $X$. A discrete Morse function $f$ on $K$ gives rise to a discrete Morse function on the order…

We give algorithms for the computation of the algebraic de Rham cohomology of open and closed algebraic sets inside projective space or other smooth complex toric varieties. The methods, which are based on Gr\"obner basis computations in…

The cohomological dimension of a field is the largest degree with non-vanishing Galois cohomology. Serre's "Conjecture II" predicts that for every perfect field of cohomological dimension $2$, every torsor over the field for a semisimple,…

We design in this work a discrete de Rham complex on manifolds. This complex, written in the framework of exterior calculus, has the same cohomology as the continuous de Rham complex, is of arbitrary order of accuracy and, in principle, can…

We analyze constrained and unconstrained minimization problems on patches of tetrahedra sharing a common vertex with discontinuous piecewise polynomial data of degree p. We show that the discrete minimizers in the spaces of piecewise…

Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…