A Brouwer fixed-point theorem for graph endomorphisms

DOI10.1186/1687-1812-2013-85MaRDI QIDQ2249135zbMATHOpenAlexWikidataFDO

Publication date 8 July 2014

Published in Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.0782

Euler characteristic Lefschetz number dynamical zeta function Brouwer fixed point graph endormorphisms

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Fixed-point theorems (47H10) Index theory and related fixed-point theorems on manifolds (58J20) Stochastic network models in operations research (90B15) Fixed points and coincidences in algebraic topology (55M20) Relations of low-dimensional topology with graph theory (57M15)

Abstract: We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined as a graded sign of the permutation T induces on the simplex x multiplied by -1 if the dimension of x is odd. The Lefschetz number is defined as in the continuum as the super trace of T induced on cohomology. In the special case where T is the identity, the formula becomes the Euler-Poincare formula equating combinatorial and cohomological Euler characteristic. The theorem assures in general that if L(T) is nonzero, then T has a fixed clique. A special case is a discrete Brouwer fixed point theorem for graphs: if T is a graph endomorphism of a connected graph G, which is star-shaped in the sense that only the zeroth cohomology group is nontrivial, like for connected trees or triangularizations of star shaped Euclidean domains, then there is clique x which is fixed by T. Unlike in the continuum, the fixed point theorem proven here looks for fixed cliques, complete subgraphs which play now the role of "points" in the graph. Fixed points can so be vertices, edges, fixed triangles etc. If A denotes the automorphism group of a graph, we also look at the average Lefschetz number L(G) which is the average of L(T) over A. We prove that this is the Euler characteristic of the graph G/A and especially an integer. We also show that as a consequence of the Lefschetz formula, the zeta function zeta(T,z) is a product of two dynamical zeta functions and therefore has an analytic continuation as a rational function which is explicitly given by a product formula involving only the dimension and the signature of prime orbits of simplices in G.

Recommendations

Cites work

Cited in

(5)

Describes a project that uses

Uses Software

MathOverflow

This page was built for publication: A Brouwer fixed-point theorem for graph endomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249135)