Search arXivSearch

arXiv · 1905.04831

Dehn-Sommerville from Gauss-Bonnet

Abstract

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 anti-derivative F of f evaluated on the unit sphere S(x). Gauss Bonnet is then parametrized, f_G(t) = sum_x F_(S(x))(t), and holds for all simplicial complexes G. The Gauss-Bonnet formula chi(G)=sum_x K(x) for Euler characteristic chi(G) is the special case t=-1. Dehn-Sommerville is equivalent to the reflection symmetry f_G(t)+(-1)^d f_G(-1-t)=0 which is equivalent to the same symmetry for F. Gauss-Bonnet therefore relates Dehn-Sommerville for G with Dehn-Sommerville for the unit spheres S(x), where it is a zero curvature condition. A class X_d of complexes for which Dehn-Sommerville holds is defined inductively by requiring chi(G)=1+(-1)^d and S(x) in X_(d-1) for all x. It starts with X_(-1)={}. Examples are simplicial spheres, including homology spheres, any odd-dimensional discrete manifold, any even-dimensional discrete manifold with chi(G)=2. It also contains non-orientable ones for which Poincar'e-duality fails or stranger spaces like spaces where the unit spheres allow for two disjoint copies of manifolds with chi(G)=1. Dehn-Sommerville is present in the Barycentric limit. It is a symmetry for the Perron-Frobenius eigenvector of the Barycentric refinement operator A. The even eigenfunctions of A^T, the Barycentric Dehn-Sommerville functionals, vanish on X like 22 f1 - 33 f2 + 40 f3 - 45f4=0 for all 4-manifolds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Knill. 2019-05-13. Dehn-Sommerville from Gauss-Bonnet. https://arxiv.org/abs/1905.04831

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO