Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Sharp Curvature Threshold for GLMY Path Homology

Published 24 Aug 2026 in math.AT and math.CO | (2608.23187v1)

Abstract: Let GG be a finite simple graph with at least one edge. We prove the sharp vanishing theorem [ κ{\min}{\mathrm{LLY}}(G)>\frac12 \quad\Longrightarrow\quad \PathH_1(G;\R)=0. ] Equivalently, nonzero first GLMY path homology forces an edge of Lin--Lu--Yau curvature at most $1/2$. The threshold $1/2$ is sharp and is attained by C5C_5. The proof combines the cycle-space description of first GLMY path homology with the limit-free Laplacian characterization of Lin--Lu--Yau curvature. As a secondary consequence of the curvature-preserving universal-cover method, we prove that if GG is connected and $κ</em>{\min}<sup>{\mathrm{LLY}}(G)&gt;0$, then $π_1(\Xshort{5}(G),o)$ is finite, where $\Xshort{5}(G)$ is obtained by filling every simple cycle of length at most five. Equivalently, the normal subgroup generated by based simple $5$-cycle loops has finite index in π1<sup>GLMY(G,o)π_1<sup>{\mathrm{GLMY}}(G,o). In higher degrees the situation is different: for each integer r1r\geq1, the Cartesian product Tr=C5<sup></sup>rT_r=C_5<sup>{\square</sup> r} has curvature $1/(2r)$ on every edge and, for every field $\F$, [ \PathH_p(T_r;\F)\cong\F{\binom rp}\qquad(0\leq p\leq r), ] so strict positivity of Lin--Lu--Yau curvature does not force higher-dimensional GLMY path homology to vanish.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.