Lew's higher-dimensional Brouwer Laplacian conjecture

From papers

Let KK be an rr-dimensional simplicial complex, let fr(K)f_r(K) denote the number of rr-faces, and let λr1,i(K)\lambda_{r-1,i}(K) be the eigenvalues of the up-Laplacian on (r1)(r-1)-faces, arranged in nonincreasing order. Lew's conjecture. For every integer 1\ell \geq 1,

i=1λr1,i(K)fr(K)+(2)+r.\sum_{i = 1}^{\ell}\lambda_{r-1,i}(K) \leq f_r(K) + \binom{\ell}{2} + r\ell.

This is proposed as a higher-dimensional analogue of Brouwer's Laplacian conjecture for graphs. The source does not report a resolution of Lew's conjecture.

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

Huan-Zhi Zhang, Yi-Min Song and Yi-Zheng Fan, “Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes”, arXiv:2607.20910 (2026).

Solutions 0

No solutions have been posted yet.