The matroid strong-map spectral recursion conjecture

From papers

Let NN and NN' be matroids, and let NNN \rightarrow N' be a strong map. Write IN(N)IN(N) and IN(N)IN(N') for their independence complexes, and let (IN(N),IN(N))(IN(N),IN(N')) denote the resulting interval. Strong-map spectral recursion conjecture. If there is a strong map

NNN \rightarrow N'

then the interval (IN(N),IN(N))(IN(N),IN(N')) has integral Laplacian eigenvalues and satisfies the spectral recursion.

The conjecture extends the proved rank-difference-one case for matroid pairs. It is motivated by experimental evidence from randomly chosen matroids, but the paper reports no proof when the rank difference exceeds one.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Art M. Duval, “A Relative Laplacian spectral recursion”, arXiv:math/0507130 (2005).

Solutions 0

No solutions have been posted yet.