Discrete Differential Calculus on Simplicial Complexes and Constrained Homology
Shiquan Ren

TL;DR
This paper develops a discrete differential calculus framework on finite sets and simplicial complexes, enabling the construction of constrained homology and cohomology groups, with applications to hypergraph theory.
Contribution
It introduces a novel differential calculus approach on finite sets and simplicial complexes, leading to new methods for constructing constrained homology and cohomology groups.
Findings
Defined constrained homology groups using differential calculus.
Constructed constrained cohomology groups for independent hypergraphs.
Established connections between simplicial complexes and hypergraph complements.
Abstract
Let be a finite set. Let be a simplicial complex with its vertices in . In this paper, we discuss some differential calculus on . We construct some constrained homology groups of by using the differential calculus on . Moreover, we define an independent hypergraph to be the complement of a simplicial complex in the complete hypergraph on . Let be an independent hypergraph with its vertices in . We construct some constrained cohomology groups of by using the differential calculus on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models
