相关论文: Betti number estimates for non-negatively curved g…

We study Ricci curvature properties of Hessian metrics on the leaves of the codimension-one foliation $\mathcal{F}_\omega = \ker\,\omega$ generated by the first Koszul form $\omega$ of a closed oriented Hessian manifold. Our main result…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

We study the equality of the extremal Betti numbers of the binomial edge ideal $J_G$ and those of its initial ideal ${\rm in}(J_G)$ of a closed graph $G$. We prove that in some cases there is an unique extremal Betti number for ${\rm…

We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of…

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

In this paper, we show that the Ricci curvature lower bound in Ollivier's Wasserstein metric sense of a continuous time jumping Markov process on a graph can be characterized by some optimal coupling generator and provide the construction…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

The first $\ell^2$ Betti number of a group is non-decreasing under various embeddings arising from first order logic. Strict inequality is proved for elementary embeddings of non-abelian proper subgroups within torsion free hyperbolic…

An ordered graph $H$ on $n$ vertices is a graph whose vertices have been labeled bijectively with $\{1,...,n\}$. The ordered Ramsey number $r_<(H)$ is the minimum $n$ such that every two-coloring of the edges of the complete graph $K_n$…

In any dimension $n+1\ge 4$ we construct a sequence of closed $(n+1)$-dimensional Riemannian manifolds with positive Ricci curvature admitting embedded two-sided minimal hypersurfaces such that the following hold: (i) any such hypersurface…

Bresinsky defined a class of monomial curves in $\mathbb{A}^{4}$ with the property that the minimal number of generators or the first Betti number of the defining ideal is unbounded above. We prove that the same behaviour of unboundedness…

Characterizing shapes of high-dimensional objects via Ricci curvatures plays a critical role in many research areas in mathematics and physics. However, even though several discretizations of Ricci curvatures for discrete combinatorial…

We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…

Curvature serves as a potent and descriptive invariant, with its efficacy validated both theoretically and practically within graph theory. We employ a definition of generalized Ricci curvature proposed by Ollivier, which Lin and Yau later…

We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…

In this article, we prove gradient estimates under Bakry-Emery curvature bounds for unbounded graph Laplacians which satisfy an ellipticity assumption. As applications, we study completeness and finiteness of stochastically complete graphs…

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…