A Common Recursion for Laplacians of Matroids and Shifted Simplicial Complexes
نویسندگان
چکیده
A recursion due to Kook expresses the Laplacian eigenvalues of a matroid M in terms of the eigenvalues of its deletion M−e and contraction M/e by a fixed element e, and an error term. We show that this error term is given simply by the Laplacian eigenvalues of the pair (M−e, M/e). We further show that by suitably generalizing deletion and contraction to arbitrary simplicial complexes, the Laplacian eigenvalues of shifted simplicial complexes satisfy this exact same recursion. We show that the class of simplicial complexes satisfying this recursion is closed under a wide variety of natural operations, and that several specializations of this recursion reduce to basic recursions for natural invariants. We also find a simple formula for the Laplacian eigenvalues of an arbitrary pair of shifted complexes in terms of a kind of generalized degree sequence.
منابع مشابه
Relaxations of the matroid axioms I: Independence, Exchange and Circuits
Motivated by a question of Duval and Reiner about higher Laplacians of simplicial complexes, we describe various relaxations of the defining axioms of matroid theory to obtain larger classes of simplicial complexes that contain pure shifted simplicial complexes. The resulting classes retain some of the matroid properties and allow us to classify matroid properties according to the relevant axio...
متن کاملMatroids vs. Shifted simplicial complexes
The families of matroid independence complexes and pure shifted simplicial complexes are two remarkable classes of simplicial complexes that share several structural properties, but for which theorems are typically proved in different ways. In a groundbreaking paper Kook, Reiner and Stanton [4] proved that matroid complexes are Laplacian integral. Afterwards Duval and Reiner [1] proved the anal...
متن کاملLaplacians on Shifted Multicomplexes
The Laplacian of an undirected graph is a square matrix, whose eigenvalues yield important information. We can regard graphs as one-dimensional simplicial complexes, and as whether there is a generalisation of the Laplacian operator to simplicial complexes. It turns out that there is, and that is useful for calculating real Betti numbers [8]. Duval and Reiner [5] have studied Laplacians of a sp...
متن کاملA Relative Laplacian Spectral Recursion
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...
متن کاملCellular Spanning Trees and Laplacians of Cubical Complexes
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, pr...
متن کامل