A common recursion for Laplacians of matroids and shifted simplicial complexes

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

31 pages; shortened by 25% from v1 by reducing level of detail

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A common recursion for Laplacians of matroids and shifted simplicial complexes 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 common recursion for Laplacians of matroids and shifted simplicial complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A common recursion for Laplacians of matroids and shifted simplicial complexes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-510170

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.