Related papers: A graph theoretical Gauss-Bonnet-Chern Theorem

We investigate the geometric characteristics of constant gaussian curvature surfaces obtained from solutions of the $G(m,n)$ sigma model. Most of these solutions are related to the Veronese sequence. We show that we can distinguish surfaces…

The Gaussian curvature $K$ is a fundamental geometric quantity discovered by Gauss in the case of surfaces embedded in $\mathbb{R}^3$. One can naturally extend the definition of the Gaussian curvature to arbitrary submanifolds of…

As an interesting application of the Einstein-Gauss-Bonnet theory and our work on the Gauss-Bonnet-Chern mass (Ge, Wang, Wu), we obtain a positive mass theorem for asymptotically flat graphs in $\R^{n+1}$ under a condition that $R+\alpha…

A graph $G$ is total weight $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a proper total…

We give a zero curvature proof of Dehn-Sommerville for finite simple graphs. It uses a parametrized Gauss-Bonnet formula telling that the curvature of the valuation G to f_G(t)=1+f0 t + ... + fd t^(d+1) defined by the f-vector of G is the…

We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…

We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…

We study discrete curvatures computed from nets of curvature lines on a given smooth surface, and prove their uniform convergence to smooth principal curvatures. We provide explicit error bounds, with constants depending only on properties…

We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…

In this paper, we show how to discretize the abelian Chern-Simons gauge theory on generic planar lattices/graphs (with or without translational symmetries) embedded in arbitrary 2D closed orientable manifolds. We find that, as long as a…

This paper studies the relationship between the sections and the Chern or Pontrjagin classes of a vector bundle by the theory of connection. Our results are natural generalizations of the Gauss-Bonnet Theorem.

We construct a Cartesian product G x H for finite simple graphs. It satisfies the Kuenneth formula: H^k(G x H) is a direct sum of tensor products H^i(G) x H^j(G) with i+j=k and so p(G x H,x) = p(G,x) p(H,y) for the Poincare polynomial…

We establish the existence of hypersurfaces with constant mean curvature and a prescribed boundary in Euclidean space, represented as radial graphs over domains of the unit sphere. Under the assumptions that the mean curvature of the…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It…

The Euler Characteristic Transform (ECT) is an efficiently-computable geometrical-topological invariant that characterizes the global shape of data. In this paper, we introduce the Local Euler Characteristic Transform ($\ell$-ECT), a novel…

This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

In this paper, we give a height estimate for constant mean curvature graphs. Using this result we prove two results of uniqueness for the Dirichlet problem associated to the constant mean curvature equation on unbounded domains.