Search arXivSearch

arXiv · 1710.01264

Relationships between cycle spaces, gain graphs, graph coverings, fundamental groups, path homology, and graph curvature

Abstract

We prove a homology vanishing theorem for graphs with positive Bakry-Émery curvature, analogous to a classic result of Bochner on manifolds \cite{Bochner}. Specifically, we prove that if a graph has positive curvature at every vertex, then its first homology group is trivial, where the notion of homology that we use for graphs is the path homology developed by Grigor'yan, Lin, Muranov, and Yau \cite{Grigoryan2}. %\Hm{added the fundamental group curvature relation} We moreover prove that the fundamental group is finite for graphs with positive Bakry-Émery curvature, analogous to a classic result of Myers on manifolds \cite{Myers1941}. The proofs draw on several separate areas of graph theory. We study graph coverings, gain graphs, and cycle spaces of graphs, in addition to the Bakry-Émery curvature and the path homology. The main results follow as a consequence of several different relationships developed among these different areas. Specifically, we show that a graph with positive curvature can have no non-trivial infinite cover preserving 3-cycles and 4-cycles, and give a combinatorial interpretation of the first path homology in terms of the cycle space of a graph. We relate cycle spaces of graphs to gain graphs with abelian gain group, and relate these to coverings of graphs. Along the way, we prove other new facts about gain graphs, coverings, and cycles spaces that are of related interest. Furthermore, we relate gain graphs to graph homotopy and the fundamental group developed by Grigor'yan, Lin, Muranov, and Yau \cite{Grigoryan_homotopy}, and obtain an alternative proof to their result that the abelianization of the fundamental group is isomorphic to the first path homology over the integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Kempton, Florentin Munch, Shing-Tung Yau. 2017-12-05. Relationships between cycle spaces, gain graphs, graph coverings, fundamental groups, path homology, and graph curvature. https://arxiv.org/abs/1710.01264

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO