惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

GbyAI
GbyAI
Blog — PlanetScale
Blog — PlanetScale
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
I
InfoQ
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
D
DataBreaches.Net
L
LangChain Blog
F
Fortinet All Blogs
C
Check Point Blog
Google DeepMind News
Google DeepMind News
云风的 BLOG
云风的 BLOG
Engineering at Meta
Engineering at Meta
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Help Net Security
J
Java Code Geeks
月光博客
月光博客
H
Hackread – Cybersecurity News, Data Breaches, AI and More
IT之家
IT之家
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
宝玉的分享
宝玉的分享
Jina AI
Jina AI

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Betti number estimates for non-negatively curved graphs
Moritz Hehl, Florentin Münch · 2025-03-14 · via math.CO updates on arXiv.org

In this paper, we establish Betti number estimates for graphs with non-negative Ollivier curvature, and for graphs with non-negative Bakry-Émery curvature, providing a discrete analogue of a classical result by Bochner for manifolds. Specifically, we show that for graphs with non-negative Ollivier curvature, the first Betti number is bounded above by half of the minimum combinatorial vertex degree. In contrast, for graphs with non-negative Bakry-Émery curvature, we prove that the first Betti number of the path homology is bounded above by the minimum combinatorial vertex degree minus one. We further present various rigidity results, characterizing graphs that attain the upper bound on the first Betti number under non-negative Ollivier curvature. Remarkably, these graphs are precisely the discrete tori, similar to the Riemannian setting. Furthermore, we show that the results obtained using the Ollivier curvature extend to the setting of potentially non-reversible Markov chains. Additionally, we explore rigidity cases depending on the idleness parameter of the Ollivier curvature, i.e., we characterize rigidity for bone-idle graphs with non-negative Ollivier curvature that attain the upper Betti number bound. We further establish an upper bound on the first Betti number under a more general assumption, where non-negative Ollivier curvature is required only outside a finite subset. Finally, we provide several examples, e.g., we prove that for a potentially non-reversible Markov chain on a cycle of length at least five, there always exists a unique path metric with constant Ollivier curvature. Moreover, this metric has non-negative Ollivier curvature, and the upper Betti number bound is attained if and only if the curvature is zero.