A Relative Laplacian spectral recursion

Details A Relative Laplacian spectral recursion A Relative Laplacian spectral recursion

2005-07-06

arxiv.org/abs/math/0507130v1

Mathematics

Combinatorics

17 pages

Scientific paper

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 intervals in the Boolean algebra. The deletion modulo contraction term is replaced by the result of removing from the interval all pairs of faces in the interval that differ only by vertex e. We show that shifted pairs and some matroid pairs satisfy this recursion. We also show that the class of intervals satisfying this recursion is closed under a wide variety of operations, including duality and taking skeleta.

Affiliated with

Also associated with

No associations

Rating

A Relative Laplacian spectral recursion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Relative Laplacian spectral recursion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Relative Laplacian spectral recursion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611771