Pith. sign in

REVIEW 5 minor 26 references

Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes

T0 review · 0 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Pith's one-line read In every simplicial complex, the top up-Laplacian spectrum is majorized by the conjugate face-degree sequence.

desk verdict Solid paper: proves the right higher-dimensional analog of Grone–Merris–Bai, gives a Brouwer-type bound, and kills the Duval–Reiner conjecture with an explicit construction; only soft spot is a delegated lemma and a routine numerical claim. read the letter →

arxiv 2607.20910 v1 pith:AM5KWRHB submitted 2026-07-23 math.CO

classification math.CO MSC 05C5005E4515A1855U10
keywords simplicialcomplexLaplacianeigenvaluesmajorizationconjugatedegreesequenceGrone-Merris-BaitheoremBrouwer-typeinequalityDuval-Reinerconjecturelinkgraph
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that the eigenvalues of the top up-Laplacian of any $r$-dimensional simplicial complex are controlled, in the majorization order, by the degrees of its top faces: the sums of the $\ell$ largest eigenvalues never exceed the sums of the $\ell$ largest conjugate face degrees, with total sums equal. This is a direct higher-dimensional analogue of the Grone-Merris-Bai theorem for graphs, recovered when $r=1$, and it replaces the Duval-Reiner conjecture, which proposed the same control by vertex degrees. The paper also establishes a Brouwer-type bound on sums of the $\ell$ largest up-Laplacian eigenvalues in terms of the numbers of $r$-faces and $(r-2)$-faces, recovering the graph Brouwer-Kothari-Tudose theorem when $r=1$. On the negative side, it constructs pure $r$-dimensional complexes on any $n\ge r+5$ vertices whose spectra violate the Duval-Reiner conjecture at the fifth partial sum, so that conjecture fails in every dimension $r\ge2$. A sympathetic reading is that the right degree sequence for higher-dimensional Laplacian majorization is the face-degree sequence, not the vertex-degree sequence.

What carries the argument

The load-bearing identity is the decomposition $rL^{\mathrm{down}}_r(K)=\sum_{\eta\in S_{r-2}(K)}L^{\mathrm{down}}_r(K;\eta)$, where $L^{\mathrm{down}}_r(K;\eta)$ is the local down Laplacian acting on the $r$-faces that contain $\eta$. Lemma 3.1 identifies each local piece, up to a signed permutation, with $L^{\mathrm{down}}_1(\mathrm{lk}\,\eta)\oplus O$, i.e., the edge Laplacian of the link graph of $\eta$ together with a zero block. This reduces the whole high-dimensional problem to graph Laplacians: the partial eigenvalue sums of $L^{\mathrm{down}}_r(K)$ are at most the sums of the corresponding partial sums over the link graphs, and those are controlled by the classical graph theorems. The double-counting steps then convert the link-level degree information into face-degree information for $K$, producing both Theorem 1.3 and Theorem 1.6.

What would settle it

Falsify the reduction by computing, in exact arithmetic, the eigenvalues of $L^{\mathrm{down}}_r(K;\eta)$ for a complex with an arbitrary vertex ordering that does not put the vertices of $\eta$ first: they must match the eigenvalues of $L^{\mathrm{down}}_1(\mathrm{lk}\,\eta)\oplus O$. Falsify the counterexample by running a Sturm sequence or interval-arithmetic certificate on $p(x)=x^5-19x^4+133x^3-413x^2+527x-175$; if the five roots are not real, or if $\alpha_1+\alpha_2\le12$, the constructed complex no longer violates the fifth partial sum.

Watch

Extended reading notes

Core claim

The positive core claim is Theorem 1.3: for every $r$-dimensional simplicial complex $K$, the spectrum of the $(r-1)$-dimensional up-Laplacian satisfies $\lambda_{r-1}(K)\preccurlyeq d^\top_{r-1}(K)$, meaning that for each $\ell$ the $\ell$ largest eigenvalues sum to at most the $\ell$ largest conjugate degrees of the $(r-1)$-faces, and the total sums coincide. The proof works with the $r$-dimensional down Laplacian, which shares the nonzero spectrum of the $(r-1)$-up-Laplacian. The paper decomposes $rL^{\mathrm{down}}_r(K)$ into local down Laplacians attached to each $(r-2)$-face $\eta$, shows each local piece is, up to a signed permutation, the edge Laplacian of the link graph $\mathrm{lk}\,\eta$ padded with zeros, and then applies the graph Grone-Merris-Bai theorem link by link and sums the results. The second positive claim, Theorem 1.6, is the Brouwer-type inequality $\sum_{i=1}^\ell \lambda_{r-1,i}(K)\le \frac{r+1}{2}f_r(K)+\frac{f_{r-2}(K)}{r}\binom{\ell+1}{2}$, obtained by applying the graph Brouwer bound to each link and double counting edges of links against $r$-faces. The negative claim is Proposition 5.3: for every $r\ge2$ and $n\ge r+5$, the constructed pure complex $K_{n,r}$ violates the fifth partial-sum inequality of the Duval-Reiner conjecture, whose conjectured upper bound uses conjugate vertex degrees $d^\top_0(K)$.

Load-bearing premise

The whole argument rests on the local identity that, up to a signed permutation, the part of the down Laplacian on $r$-faces around an $(r-2)$-face $\eta$ is exactly the edge Laplacian of the link graph of $\eta$ padded with zeros; if that identity ever failed for some vertex ordering, the reduction to graph theorems would collapse, and the counterexample separately depends on the computed claim that $p(x)$ has five real roots whose top two sum to more than $12$.

Editorial extensions

If this is right

  • For any $r$-dimensional complex, the $\ell$-th partial sum of the top $(r-1)$-up-Laplacian eigenvalues is bounded by the $\ell$-th partial sum of the conjugate $(r-1)$-face degree sequence, so the face-degree sequence is the correct higher-dimensional analogue of graph degrees for majorization.
  • The largest $(r-1)$-up-Laplacian eigenvalue is bounded by $\frac{r+1}{2}f_r(K)+\frac{f_{r-2}(K)}{r}$, a number computable directly from face counts; at $r=1$ this recovers the graph bound $f_1(G)+1$.
  • The Duval-Reiner conjecture fails in every dimension $r\ge2$: there is no way to repair the conjecture as a statement about vertex degrees, and the obstruction is already visible at the fifth partial sum.
  • Both main theorems collapse to the known graph results at $r=1$, so the extension is exact rather than approximate.
  • The counterexample family supplies pure complexes on every sufficiently large vertex count, so the failure of the Duval-Reiner conjecture is not confined to sporadic small examples.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is to test whether Theorem 1.3 survives under weighted faces: the link-graph reduction is linear, so face weights should translate to edge weights on each link graph, and weighted versions of the graph theorems would transfer if they are available.
  • The counterexample family may violate not only the fifth partial sum but later ones; computing the gap $\alpha_1+\alpha_2-12$ as a function of $q$ would show how far the vertex-degree majorization is from being true.
  • A rigorous interval-arithmetic or Sturm-sequence certificate for the five real roots would remove the only numerical computation in the paper, making Proposition 5.3 fully symbolic.
  • The failure of the vertex-degree conjecture suggests testing weakened majorization statements, for instance with conjugate degrees of $(r-2)$-faces or with an absolute constant factor, as the next plausible conjecture in this direction.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper proves two main results for finite simplicial complexes. Theorem 1.3 states that for every r-dimensional complex K, the spectrum of the (r-1)-dimensional up-Laplacian is majorized by the conjugate degree sequence of its (r-1)-faces, recovering the Grone-Merris-Bai theorem for graphs when r=1. Theorem 1.6 establishes a Brouwer-type upper bound for partial sums of these Laplacian eigenvalues, recovering the graph theorem of Brouwer-Kothari-Tudose when r=1. The proofs are based on a local decomposition of the r-dimensional down Laplacian into local Laplacians indexed by (r-2)-faces, together with a reduction of each local Laplacian to the edge Laplacian of a link graph. In Section 5 the paper constructs, for every r>=2 and n>=r+5, an explicit pure r-dimensional complex K_{n,r} that violates the fifth partial-sum inequality of the Duval-Reiner conjecture, thereby disproving that conjecture in all dimensions r>=2.

Significance. If the results are correct, as the referee's independent check and the stress-test notes indicate, the paper makes a substantial contribution: it gives the first higher-dimensional majorization theorem of Grone-Merris-Bai type for face degrees, a credible higher-dimensional Brouwer-type bound, and an explicit counterexample to a named conjecture. The proofs are largely self-contained and display an elegant double-counting technique; the reduction to link graphs makes the arguments transparent and reuses strong known graph results. The counterexample is constructive and checkable, and the recovery of the r=1 graph theorems is a nice sanity check. The paper is clearly written and the main claims are well motivated.

minor comments (5)
  1. [Section 3, Lemma 3.1] The general-ordering case of the key reduction is delegated to [8, Lemma 3.2] without stating that lemma or its proof. Since Lemma 3.1 is load-bearing for both Theorems 1.3 and 1.6, please state [8, Lemma 3.2] explicitly or include a proof in an appendix so the paper is self-contained.
  2. [Section 5] The assertion that p(x) has five real roots with 6.16382<alpha1<6.16383 and 5.83636<alpha2<5.83637 is supported only by "a direct computation." Please include a short certificate, for example a Sturm sequence or exact interval arithmetic, so that the counterexample is fully verifiable without rerunning a numerical computation.
  3. [Abstract and Section 3] There are several typos: "EIGENV ALUE" in the abstract and title spacing, and "Laplaican" for "Laplacian" in the abstract and in Sections 2 and 3. These should be corrected.
  4. [Section 5, Lemma 5.1] The notation "eigenvalues lambda in lambda_2(K)\setminus{7}" is slightly informal; it should be clarified that this refers to the multiset of eigenvalues with 7 removed according to its multiplicity.
  5. [Section 1, Remark 4.1] The equality case in the simplex example is stated without proof; a one-line verification that the up-Laplacian has eigenvalues (r+1,0,\ldots,0) would be helpful.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: main theorems reduce to external graph Laplacian theorems; the sole same-author citation is a technical signature-similarity lemma.

full rationale

The derivation is not circular. Theorem 1.3 and Theorem 1.6 are obtained by decomposing r L_r^down(K) into local operators indexed by (r-2)-faces (Lemmas 3.1-3.2), identifying each local operator, up to signed permutation, with the edge Laplacian of the link graph, and then applying the external graph theorems of Grone-Merris-Bai and Brouwer-Kothari-Tudose. The partial-sum bounds follow from Ky Fan's variational principle and the subadditivity lemma, while the total-sum equality is a double count. None of these steps defines the majorizing sequence in terms of the eigenvalues being bounded. The only same-author citation is [8, Lemma 3.2] in the proof of Lemma 3.1, used to pass from a convenient vertex ordering to the general ordering by a signature-matrix similarity; that lemma is a technical matrix-similarity statement, not the majorization conclusion, and it does not import the target result. The counterexample in Section 5 is a direct spectral computation: the base complex's characteristic polynomial is given explicitly, the interval bounds on alpha1 and alpha2 are concrete numerical assertions that can be checked directly, and Lemmas 5.1 and 5.2 compute the shifted spectra by explicit invariant subspaces. The final violation is an algebraic comparison with the conjugate degree sequence, not a fitted prediction. Thus there is no circular step; at most there is a benign same-author technical citation, reflected in the score of 2 rather than 0.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central results rest on a small set of standard theorems and one self-cited technical lemma. No parameters are fitted to data; the counterexample constants are computed roots of a displayed polynomial. No new particles, forces, dimensions, or other invented entities are introduced.

assumptions (6)
  • domain assumption K is a finite abstract simplicial complex with a fixed linear order on vertices and orthonormal chain bases.
    The entire paper works in this setting; orientations and inner products are fixed in Section 2.1 and are prerequisites for defining up and down Laplacians.
  • standard math Nonzero spectra of AB and B^T B coincide for rectangular matrices B.
    Used repeatedly in Lemma 3.3 and the proofs of Theorems 1.3 and 1.6 to pass between L^up_{r-1} and L^down_r, and between L^down_1(lkη) and L^up_0(lkη).
  • standard math Grone-Merris-Bai theorem for graphs (Theorem 1.1).
    Applied to each link graph lkη in the proof of Theorem 1.3. Cited as [2, 11].
  • standard math Brouwer-Kothari-Tudose theorem for graphs (Theorem 1.4).
    Applied to each link graph lkη in the proof of Theorem 1.6. Cited as [3, 17].
  • standard math Ky Fan max principle (Lemma 2.1).
    Used in Lemma 2.2 to bound partial eigenvalue sums of sums of positive semidefinite matrices.
  • standard math Signature-similarity lemma from the authors' prior work (reference [8, Lemma 3.2]).
    Used in Lemma 3.1 to handle arbitrary vertex orderings when identifying L^down_r(K;η) with L^down_1(lkη)⊕O. Self-cited, but the fact is elementary and does not carry the central content.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes." pith.science (2026). https://pith.science/paper/AM5KWRHB

@misc{pith2026260720910,
  author       = {Pith},
  title        = {Pith review of: Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AM5KWRHB}},
  note         = {Machine review of arXiv:2607.20910}
}
abstract

Let $K$ be an $r$-dimensional simplicial complex. We prove that the spectrum of its $(r - 1)$-dimensional up-Laplacian is majorized by the conjugate degree sequence of its $(r - 1)$-dimensional faces: \[ {\mathbf{\lambda}}_{r-1}(K) \preccurlyeq {\mathbf d}_{r-1}^\top(K). \] We also establish a Brouwer-type inequality: for every integer $\ell \geq 1$, \[ \sum_{i = 1}^{\ell}\lambda_{r-1,i}(K) \leq \frac{r + 1}{2}f_r(K) + \frac{f_{r - 2}(K)}{r} \binom{\ell + 1}{2}, \] where $\lambda_{r-1,i}(K)$ denotes the $i$-th largest eigenvalue in the spectrum ${\mathbf{\lambda}}_{r-1}(K)$, and $f_t(K)$ denotes the number of $t$-dimensional faces of $K$. These results provide higher-dimensional analogs of the Grone-Merris-Bai theorem and the Brouwer-Kothari-Tudose theorem and recover the corresponding graph results when $r=1$. We show that the Duval-Reiner conjecture on the majorization by the conjugate degree sequence of vertices fails in every dimension $r \geq 2$. More precisely, for every $n \geq r + 5$, we construct a pure $r$-dimensional complex on $n$ vertices that violates the conjectured inequality at the fifth partial sum.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

26 extracted references · 20 canonical work pages

  1. [1]

    Aharoni, E

    R. Aharoni, E. Berger, and R. Meshulam, Eigenvalues and homology of flag complexes and vector representations of graphs,Geom. Funct. Anal., 15 (2005), 555–566. 1

  2. [2]

    Bai, The Grone–Merris conjecture,Trans

    H. Bai, The Grone–Merris conjecture,Trans. Amer. Math. Soc., 363 (2011), 4463–4474. 1.1

  3. [3]

    A. E. Brouwer and W. H. Haemers,Spectra of graphs, Universitext, Springer, New York, 2012. 1.4

  4. [4]

    A. M. Duval, C. J. Klivans, and J. L. Martin, Simplicial matrix-tree theorems,Trans. Amer. Math. Soc., 361 (11) (2009), 6073–6114. 1

  5. [5]

    A. M. Duval and V. Reiner, Shifted simplicial complexes are Laplacian integral,Trans. Amer. Math. Soc., 354 (2002), 4313–4344. 1, 1.2

  6. [6]

    Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex,Comment

    B. Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex,Comment. Math. Helv., 17 (1) (1944), 240–255. 1

  7. [7]

    Fan, On a theorem of Weyl concerning eigenvalues of linear transformations I,Proc

    K. Fan, On a theorem of Weyl concerning eigenvalues of linear transformations I,Proc. Natl. Acad. Sci. USA, 35 (1949), 652–655. 2.1

  8. [8]

    Fan, C.-M

    Y.-Z. Fan, C.-M. She, and H.-Z. Zhang, Spectral radius of simplicial complexes without holes, arXiv: 2507.22518, 2025. 1, 3

Show all 26 references
  1. [9]

    Fan, H.-F

    Y.-Z. Fan, H.-F. Wu, and Y. Wang, The largest Laplacian eigenvalue and the balancedness of simplicial complexes,J. Algebraic Combin., 61 (2025), 53. 1

  2. [10]

    Fan and H.-Z

    Y.-Z. Fan and H.-Z. Zhang, Signless Laplacian spectral radius and link homology of simplicial com- plexes, arXiv: 2606.22825, 2026. 1

  3. [11]

    Grone and R

    R. Grone and R. Merris, The Laplacian spectrum of a graph II,SIAM J. Discrete Math., 7 (1994), 221–229. 1.1

  4. [12]

    Y. Han, L. Lu, and J. Wang, On the sum of the two largest eigenvalues of the curl-curl operator on graphs, arXiv: 2606.26512, 2026. 1

  5. [13]

    Horak and J

    D. Horak and J. Jost, Interlacing inequalities for eigenvalues of discrete Laplace operators,Ann. Global Anal. Geom., 43 (2013), 177–207. 1

  6. [14]

    Horak and J

    D. Horak and J. Jost, Spectra of combinatorial Laplace operators on simplicial complexes,Adv. Math., 244 (2013), 303–336. 1

  7. [15]

    Huang, The Duval-Reiner conjecture: counterexamples and the second partial-sum inequality, arXiv: 2607.20051, 2026

    J. Huang, The Duval-Reiner conjecture: counterexamples and the second partial-sum inequality, arXiv: 2607.20051, 2026. 1

  8. [16]

    Kaufman and I

    T. Kaufman and I. Oppenheim, High order random walks: Beyond spectral gap,Combinatorica, 40 (2020), 245–281. 1

  9. [17]

    P. K. Kothari and S. Tudose, On Brouwer’s Laplacian conjecture, arXiv: 2606.12197, 2026. 1.4

  10. [18]

    Lew, Spectral gaps, missing faces and minimal degrees,J

    A. Lew, Spectral gaps, missing faces and minimal degrees,J. Combin. Theory Ser. A, 169 (2020), 105127. 1

  11. [19]

    Lew, Sums of Laplacian eigenvalues and sums of degrees, arXiv: 2508.04209, 2025

    A. Lew, Sums of Laplacian eigenvalues and sums of degrees, arXiv: 2508.04209, 2025. 1.5

  12. [20]

    Lew, The spectral gaps of generalized flag complexes and a geometric Hall-type theorem,Int

    A. Lew, The spectral gaps of generalized flag complexes and a geometric Hall-type theorem,Int. Math. Res. Not., 2020 (11) (2020), 3364–3395. 1

  13. [21]

    Lubotzky, Ramanujan complexes and high dimensional expanders,Japan

    A. Lubotzky, Ramanujan complexes and high dimensional expanders,Japan. J. Math., 9 (2014), 137–169. 1

  14. [22]

    She, Y.-Z

    C.-M. She, Y.-Z. Fan, and Y.-M. Song, Spectral radius of2-dimensional simplicial complexes with given Betti number, arXiv: 2601.08171, 2026. 1

  15. [23]

    Song, H.-F

    Y.-M. Song, H.-F. Wu, and Y.-Z. Fan, The normalized Laplacian eigenvalue and incidence balanced- ness of simplicial complexes,Bull. Iran. Math. Soc., 51 (2025), 42. 1

  16. [24]

    X. Zhan, X. Huang, and H. Lin, Proof of Lew’s conjecture on the spectral gaps of simplicial com- plexes, J. Combin. Theory Ser. A, 217 (2026), 106091. 1

  17. [25]

    Zhang and Y.-Z

    H.-Z. Zhang and Y.-Z. Fan, Signless Laplacian spectral radius of simplicial complexes withoutr- dimensional wheels, arXiv: 2604.04536, 2026. 1

  18. [26]

    Zhang and Y.-Z

    H.-Z. Zhang and Y.-Z. Fan, Upper bounds for the largest Laplacian eigenvalue of simplicial com- plexes, arXiv: 2606.21233, 2026. 1 14 H.-Z. ZHANG, Y.-M. SONG, AND Y.-Z. F AN School of Mathematical Sciences, Anhui University, Hefei 230601, P. R. China Email address: zhanghz@stu...

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.