pith. sign in

arxiv: 1907.07541 · v1 · pith:SMINKV5Nnew · submitted 2019-07-17 · 🧮 math.CO

A Conjectural Brouwer Inequality for Higher-Dimensional Laplacian Spectra

Rediet Abebe This is my paper

Pith reviewed 2026-05-24 20:27 UTC · model grok-4.3

classification 🧮 math.CO
keywords Brouwer inequalityLaplacian spectrumsimplicial complexesshifted complexespartial sumsspectral combinatoricssimplicial trees
0
0 comments X

The pith

Brouwer's conjectural inequalities for Laplacian eigenvalue sums generalize to higher-dimensional simplicial complexes.

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

The paper extends a family of inequalities conjectured by Brouwer for graphs, which bound the sums of the first k Laplacian eigenvalues, to abstract simplicial complexes in any dimension. It establishes that these bounds hold for all shifted simplicial complexes and gives linear-in-dimension bounds for simplicial trees. The inequalities are also proven for the first two and the final partial sums in every simplicial complex, and for the t-th partial sum whenever the complex has dimension at least t and matching number larger than t. If true in full generality, this would mean spectral bounds on graphs lift directly to higher-dimensional combinatorial objects without new obstructions.

Core claim

The Brouwer family of inequalities on partial sums of Laplacian eigenvalues extends from graphs to simplicial complexes, holding for shifted complexes with the same form, for simplicial trees with tighter linear bounds, for the initial and terminal partial sums in all cases, and for the t-th sum under dimension and matching conditions.

What carries the argument

The partial sums of the eigenvalues of the combinatorial Laplacian defined on the faces of an abstract simplicial complex, together with interlacing and monotonicity properties that carry over from the graph case.

If this is right

  • The inequalities hold for every shifted simplicial complex.
  • Simplicial trees satisfy the inequalities with bounds linear in dimension.
  • Every simplicial complex satisfies the inequalities for its first, second, and last partial eigenvalue sums.
  • The t-th partial sum inequality holds for complexes whose dimension is at least t and whose matching number exceeds t.
  • For graphs, equality holds in the t-th inequality when t equals the size of the largest clique minus one.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the full conjecture holds, it would imply that the Laplacian spectrum of any simplicial complex obeys the same partial-sum bounds as its 1-skeleton graph.
  • The machinery developed may apply to other spectral conjectures involving higher-dimensional complexes.
  • Testing the inequality on random simplicial complexes of moderate dimension could provide numerical evidence toward the general case.
  • The equality case for graphs suggests a connection between clique structure and eigenvalue multiplicity that might generalize.

Load-bearing premise

The standard combinatorial Laplacian on simplicial complexes preserves the interlacing and monotonicity properties that the graph-case proofs rely upon.

What would settle it

A shifted simplicial complex, or a complex with dimension at least t and matching number greater than t, whose t-th partial sum of Laplacian eigenvalues exceeds the conjectured bound.

Figures

Figures reproduced from arXiv: 1907.07541 by Rediet Abebe.

Figure 1
Figure 1. Figure 1: A threshold graph constructed by adding a cone, isolated, isolated, and cone node, in order. Example 9. We consider the following construction of a threshold graph built through a sequence of vertex additions: (cone, isolated, isolated, cone), shown in [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: an example of a star k-family: a star 2-family on 5 vertices. To define the Laplacian spectrum of simplicial complexes, we recall from [16] that, given a simplicial complex S, we have chain groups Ci(S) and simplicial maps between these chain group: 0 → . . . ∂3 −→ C2(S) ∂2 −→ C1(S) ∂1 −→ C0(S) ∂0 −→ 0. The Ci are vector spaces with the basis being the i-dimensional faces of the simplicial complex. The ∂ a… view at source ↗
read the original abstract

We present a generalization of Brouwer's conjectural family of inequalities -- a popular family of inequalities in spectral graph theory bounding the partial sum of the Laplacian eigenvalues of graphs -- for the case of abstract simplicial complexes of any dimension. We prove that this family of inequalities holds for shifted simplicial complexes, which generalize threshold graphs, and give tighter bounds (linear in the dimension of the complexes) for simplicial trees. We prove that the conjecture holds for the the first, second, and last partial sums for all simplicial complexes, generalizing many known proofs for graphs to the case of simplicial complexes. We also show that the conjecture holds for the tth partial sum for all simplicial complexes with dimension at least t and matching number greater than $t$. Returning to the special case of graphs, we expand on a known proof to show that the Brouwer's conjecture holds with equality for the tth partial sum where t is the maximum clique size of the graph minus one (or, equivalently, the number of cone vertices). Along the way, we develop machinery that may give further insights into related long-standing conjectures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The manuscript generalizes Brouwer's family of conjectural inequalities bounding partial sums of Laplacian eigenvalues from graphs to abstract simplicial complexes of arbitrary dimension. It proves the generalized inequalities hold for shifted simplicial complexes (extending threshold graphs), for simplicial trees with linear-in-dimension bounds, for the first/second/last partial sums on all simplicial complexes, and for the t-th partial sum when dimension is at least t and matching number exceeds t. It further establishes an equality case for graphs when t equals the maximum clique size minus one (equivalently, the number of cone vertices), and develops new combinatorial machinery on shifted complexes, matching numbers, and partial-sum interlacing that may inform related conjectures.

Significance. If the general conjecture holds, the work would extend a well-known family of spectral bounds from graph theory to higher-dimensional combinatorial objects, with the proved special cases already supplying concrete extensions and tighter bounds. The explicit combinatorial proofs for shifted complexes and the partial-sum regimes, together with the new machinery on interlacing and matching numbers, constitute a clear advance; these are strengths that stand independently of the unresolved general case.

minor comments (1)
  1. [Abstract] Abstract: the phrase 'for the the first, second, and last partial sums' contains a repeated word that should be corrected for clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their thorough and positive report, which accurately summarizes the contributions of the manuscript, and for the recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity; proofs are self-contained combinatorial extensions

full rationale

The paper states an explicit conjecture for arbitrary simplicial complexes and supplies independent combinatorial proofs only for listed special cases (shifted complexes, trees, partial sums, matching-number conditions). These proofs extend graph-case arguments via new machinery on interlacing and matching numbers without reducing any claimed result to a fitted parameter, self-definition, or load-bearing self-citation. The general case remains conjectural precisely where no proof is given, so the derivation chain does not collapse by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard definitions and properties of simplicial complexes and their Laplacians from algebraic combinatorics; no free parameters, invented entities, or ad-hoc axioms are introduced.

axioms (1)
  • domain assumption Standard definition and spectral properties of the Laplacian on abstract simplicial complexes
    Invoked throughout the statements about partial sums and shifted complexes.

pith-pipeline@v0.9.0 · 5720 in / 1284 out tokens · 23429 ms · 2026-05-24T20:27:22.223948+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    The Grone-Merris conjecture

    Hua Bai. The Grone-Merris conjecture. Transactions of the American Mathematical Society , 363(8):4463–4474, 2011

    work page 2011

  2. [2]

    Spectra of graphs

    Andries E Brouwer and Willem H Haemers. Spectra of graphs. Springer Science & Business Media, 2011

    work page 2011

  3. [3]

    Simplicial cycles and the computation of simplicial trees

    Massimo Caboara, Sara Faridi, and Peter Selinger. Simplicial cycles and the computation of simplicial trees. Journal of Symbolic Computation , 42(1-2):74–88, 2007

    work page 2007

  4. [4]

    On brouwer’s conjecture for the sum of k largest Laplacian eigenvalues of graphs

    Xiaodan Chen. On brouwer’s conjecture for the sum of k largest Laplacian eigenvalues of graphs. Linear Algebra and its Applications , 2019

    work page 2019

  5. [5]

    Note on an upper bound for sum of the Laplacian eigenvalues of a graph

    Xiaodan Chen, Jingjian Li, and Yingmei Fan. Note on an upper bound for sum of the Laplacian eigenvalues of a graph. Linear Algebra and its Applications , 541:258–265, 2018

    work page 2018

  6. [6]

    On Laplacian energy in terms of graph invariants

    Kinkar Ch Das, Seyed Ahmad Mojallal, and Ivan Gutman. On Laplacian energy in terms of graph invariants. Applied Mathematics and Computation , 268:83–92, 2015

    work page 2015

  7. [7]

    Upper bounds for the sum of Laplacian eigenvalues of graphs

    Zhibin Du and Bo Zhou. Upper bounds for the sum of Laplacian eigenvalues of graphs. Linear Algebra and its Applications , 436(9):3672–3683, 2012

    work page 2012

  8. [8]

    Shifted simplicial complexes are Laplacian integral

    Art Duval and Victor Reiner. Shifted simplicial complexes are Laplacian integral. Transactions of the American Mathematical Society , 354(11):4313–4344, 2002

    work page 2002

  9. [9]

    Simplicial trees: Properties and applications

    Sara Faridi. Simplicial trees: Properties and applications. In the abstract of a talk at the International Conference on Commutative Algebra & Combinatorics , 2003

    work page 2003

  10. [10]

    On the sum of the Laplacian eigenvalues of a tree

    Eliseu Fritscher, Carlos Hoppen, Israel Rocha, and Vilmar Trevisan. On the sum of the Laplacian eigenvalues of a tree. Linear Algebra and its Applications , 435(2):371–399, 2011. 17

    work page 2011

  11. [11]

    On the sum of the Laplacian eigenvalues of a graph and brouwer’s conjecture

    Hilal A Ganie, Ahmad M Alghamdi, and S Pirzada. On the sum of the Laplacian eigenvalues of a graph and brouwer’s conjecture. Linear Algebra and its Applications , 501:376–389, 2016

    work page 2016

  12. [12]

    The Laplacian spectrum of a graph II

    Robert Grone and Russell Merris. The Laplacian spectrum of a graph II. SIAM Journal on Discrete Mathematics, 7(2):221–229, 1994

    work page 1994

  13. [13]

    On the sum of the two largest Laplacian eigenvalues of trees

    Mei Guan, Mingqing Zhai, and Yongfeng Wu. On the sum of the two largest Laplacian eigenvalues of trees. Journal of Inequalities and Applications , 2014(1):242, 2014

    work page 2014

  14. [14]

    Laplacian energy of a graph

    Ivan Gutman and Bo Zhou. Laplacian energy of a graph. Linear Algebra and its applications , 414(1):29–37, 2006

    work page 2006

  15. [15]

    On the sum of Laplacian eigenvalues of graphs

    WH Haemers, Ali Mohammadian, and Behruz Tayfeh-Rezaie. On the sum of Laplacian eigenvalues of graphs. Linear Algebra and its Applications , 432(9):2214–2221, 2010

    work page 2010

  16. [16]

    Algebraic topology

    Allen Hatcher. Algebraic topology. Cambridge University Press, 2002

    work page 2002

  17. [17]

    Spectral threshold dominance, brouwer’s conjecture and maximality of Laplacian energy

    Christoph Helmberg and Vilmar Trevisan. Spectral threshold dominance, brouwer’s conjecture and maximality of Laplacian energy. Linear Algebra and its Applications , 512:18–31, 2017

    work page 2017

  18. [18]

    On variants of the Grone-Merris Conjecture

    Mayank. On variants of the Grone-Merris Conjecture . PhD thesis, Masters thesis, Eindhoven University of Technology, 2010

    work page 2010

  19. [19]

    Laplacian graph eigenvectors

    Russell Merris. Laplacian graph eigenvectors. Linear algebra and its applications , 278(1-3):221– 236, 1998

    work page 1998

  20. [20]

    Bounding the sum of the largest Laplacian eigenvalues of graphs

    Israel Rocha and Vilmar Trevisan. Bounding the sum of the largest Laplacian eigenvalues of graphs. Discrete Applied Mathematics, 170:95–103, 2014

    work page 2014

  21. [21]

    Spectral graph theory and its applications

    Daniel A Spielman. Spectral graph theory and its applications. In Foundations of Computer Science, 2007. FOCS’07. 48th Annual IEEE Symposium on , pages 29–38. IEEE, 2007

    work page 2007

  22. [22]

    On a conjecture for the sum of Laplacian eigenvalues

    Shouzhong Wang, Yufei Huang, and Bolian Liu. On a conjecture for the sum of Laplacian eigenvalues. Mathematical and Computer Modelling , 56(3-4):60–68, 2012

    work page 2012

  23. [23]

    On a conjecture for the signless Laplacian eigenvalues

    Jieshan Yang and Lihua You. On a conjecture for the signless Laplacian eigenvalues. Linear Algebra and its Applications , 446:115–132, 2014

    work page 2014

  24. [24]

    On sum of powers of the Laplacian eigenvalues of graphs

    Bo Zhou. On sum of powers of the Laplacian eigenvalues of graphs. Linear Algebra and its Applications, 429(8-9):2239–2246, 2008

    work page 2008

  25. [25]

    More on energy and Laplacian energy

    Bo Zhou. More on energy and Laplacian energy. MATCH Commun. Math. Comput. Chem , 64(1):75–84, 2010. 18

    work page 2010