Reproduce “A graph theoretical Poincare-Hopf Theorem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Oliver Knill
The authors show that any finite simple graph with a vertex function has Euler characteristic equal to the sum of local vertex indices. The function need be injective on a vertex and its neighbors; each index is one minus the Euler characteristic of its lower-valued neighboring subgraph. In a 21-vertex example, both sums give −2, illustrating the identity rather than speed.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.