Search arXivSearch

arXiv · 2607.20910

Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes

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λ}_{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}λ_{r-1,i}(K) \leq \frac{r + 1}{2}f_r(K) + \frac{f_{r - 2}(K)}{r} \binom{\ell + 1}{2}, \] where $λ_{r-1,i}(K)$ denotes the $i$-th largest eigenvalue in the spectrum ${\mathbfλ}_{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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Huan-Zhi Zhang, Yi-Min Song, Yi-Zheng Fan. 2026-07-23. Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes. https://arxiv.org/abs/2607.20910

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO