相关论文: Greedy Morse matchings and discrete smoothness
We study the presence of abelian discrete symmetries in globally consistent orientifold compactifications based on rational conformal field theory. We extend previous work [1] by allowing the discrete symmetries to be a linear combination…
Accurate delineation of fine-scale structures is a very important yet challenging problem. Existing methods use topological information as an additional training loss, but are ultimately making pixel-wise predictions. In this paper, we…
In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
We denote the matching complex of the complete graph with $n$ vertices by $M_n$. Bouc first studied the topological properties of $M_n$ in connection with the Quillen complex. Later Bj\"{o}rner, Lov\'{a}sz, Vre\'{c}ica, and…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field $f$ defined on a $d$-dimensional simplicial complex $K$, with $d \leq 3$. Our work revisits the seminal algorithm…
We prove an infinite analogue of the main theorem of discrete Morse theory formulated in terms of discrete Morse matchings. Our theorem holds under the assumption that the given Morse matching induces finitely many equivalence classes of…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
Let $f$ be a Morse function on a closed manifold $M$, and $v$ be a Riemannian gradient of $f$ satisfying the transversality condition. The classical construction (due to Morse, Smale, Thom, Witten), based on the counting of flow lines…
Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is…
Chessboard complexes and their generalizations, as objects, and Discrete Morse theory, as a tool, are presented as a unifying theme linking different areas of geometry, topology, algebra and combinatorics. Edmonds and Fulkerson bottleneck…
In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery,…
In this paper, we study a class of discrete Morse functions, coming from Discrete Morse Theory, that are equivalent to a class of simplicial stacks, coming from Mathematical Morphology. We show that, as in Discrete Morse Theory, we can see…
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…
Fold maps are fundamental tools in the theory of singularities of differentiable maps and its applications to geometry. They are higher dimensional variants of Morse functions. Classes of special generic maps and round fold maps are…
On a smooth manifold, we associate to any closed differential form a mapping cone complex. The cohomology of this mapping cone complex can vary with the de Rham cohomology class of the closed form. We present a novel Morse theoretical…
We construct Morse homology groups associated with any regular function on a smooth complex algebraic variety, allowing singular and non-compact critical loci. These groups are generated by critical points of a certain large pertubation of…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
The purpose of this work is to develop a version of Forman's discrete Morse theory for simplicial complexes, based on internal strong collapses. Classical discrete Morse theory can be viewed as a generalization of Whitehead's collapses,…