Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Fredholm determinants in topology

Published 25 Dec 2016 in math.GN, cs.DM, and math.CO | (1612.08229v1)

Abstract: Given an abstract simplicial complex G, the connection graph G' of G has as vertex set the faces of the complex and connects two if they intersect. If A is the adjacency matrix of that connection graph, we prove that the Fredholm characteristic det(1+A) takes values in {-1,1} and is equal to the Fermi characteristic, which is the product of the w(x), where w(x)=(-1)dim(x). The Fredholm characteristic is a special value of the Bowen-Lanford zeta function and has various combinatorial interpretations. The unimodularity theorem proven here shows that it is a cousin of the Euler characteristic as the later is the sum of the w(x). Unimodularity implies that the matrix 1+A has an inverse which takes integer values. Experiments suggest the conjecture that the range of the Green function values, the union of the entries of the inverse of 1+A form a combinatorial invariant of the simplicial complex and do not change under Barycentric or edge refinements.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.