SearcharxivSearch

arXiv · 1601.04533

Gauss-Bonnet for multi-linear valuations

Abstract

We prove Gauss-Bonnet and Poincare-Hopf formulas for multi-linear valuations on finite simple graphs G=(V,E) and answer affirmatively a conjecture of Gruenbaum from 1970 by constructing higher order Dehn-Sommerville valuations which vanish for all d-graphs without boundary. An example of a quadratic valuation is the Wu characteristic w(G) which sums (-1)^(dim(x)+dim(y)) over all intersecting pairs of complete subgraphs x,y of a G. More generally, an intersection number w(A,B) sums (-1)^(dim(x)+dim(y)) over pairs x,y, where x is in A and y is in B and x,y intersect. w(G) is a quadratic Euler characteristic X(G), where X sums (-1)^dim(x) over all complete subgraphs x of G. We prove that w is multiplicative, like Euler characteristic: w(G x H) = w(G) w(H) for any two graphs and that w is invariant under Barycentric refinements. We construct a curvature K satisfying Gauss-Bonnet w(G) = sum K(a). We also prove w(G) = X(G)-X(dG) for Euler characteristic X which holds for any d-graph G with boundary dG. We also show higher order Poincare-Hopf formulas: there is for every multi-linear valuation X and function f an index i(a) such that sum i(a)=X(G). For d-graphs G and X=w it agrees with the Euler curvature. For the vanishing multi-valuations which were conjectured to exist, like for the quadratic valuation X(G) = (V X) Y with X=(1,-1,1,-1,1),Y=(0,-2,3,-4,5) on 4-graphs, discrete 4 manifolds, where V_{ij}(G) is the f-matrix counting the number of i and j-simplices in G intersecting, the curvature is constant zero. For all graphs and multi-linear Dehn-Sommerville relations, the Dehn-Sommerville curvature K(v) at a vertex is a Dehn-Sommerville valuation on the unit sphere S(v). We show X V(G) Y = v(G) Y for any linear valuation Y of a d-graph G with f-vector v(G). This provides examples for the Gruenbaum conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Oliver Knill. 2016-01-18. Gauss-Bonnet for multi-linear valuations. https://arxiv.org/abs/1601.04533

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

KEEP EXPLORING

Related papers

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM