Search arXivSearch

arXiv · 1711.09527

One can hear the Euler characteristic of a simplicial complex

Abstract

We prove that that the number p of positive eigenvalues of the connection Laplacian L of a finite abstract simplicial complex G matches the number b of even dimensional simplices in G and that the number n of negative eigenvalues matches the number f of odd-dimensional simplices in G. The Euler characteristic X(G) of G therefore can be spectrally described as X(G)=p-n. This is in contrast to the more classical Hodge Laplacian H which acts on the same Hilbert space, where X(G) is not yet known to be accessible from the spectrum of H. Given an ordering of G coming from a build-up as a CW complex, every simplex x in G is now associated to a unique eigenvector of L and the correspondence is computable. The Euler characteristic is now not only the potential energy summing over all g(x,y) with g=L^{-1} but also agrees with a logarithmic energy tr(log(i L)) 2/(i pi) of the spectrum of L. We also give here examples of L-isospectral but non-isomorphic abstract finite simplicial complexes. One example shows that we can not hear the cohomology of the complex.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Knill. 2017-11-27. One can hear the Euler characteristic of a simplicial complex. https://arxiv.org/abs/1711.09527

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO