Search arXivSearch

arXiv · 2608.01694

Spectral Bounds and Shifted Complexes: Eigenvalues of the Up-Laplacian via Face Degrees

Abstract

Let $K$ be a finite $k$-dimensional simplicial complex with $k\ge1$, and let $\Lup_{k-1}(K)$ be its $(k-1)$-dimensional up-Laplacian. We resolve the equality case of a conjecture of Duval and Reiner: for a pure complex, the nonzero spectrum of $\Lup_{k-1}(K)$ equals ${d^{\mathrm v}(K)}^{\T}$, the conjugate vertex-degree partition, if and only if the complex is isomorphic to a shifted complex. In fact, we prove more: equality of the second power sums alone already forces shiftedness, and the gap between them equals twice the number of failed elementary shifts of facets. We next characterize equality in the Duval--Reiner bound $λ_1(\Lup_{k-1}(K))\ge d_1(K)+k$, where $d_1(K)$ is the maximum upper degree of a ridge. We introduce the \emph{clean ridge}, a higher-dimensional analogue of a dominating vertex, and combine it with a signed Sachs expansion for the associated signed facet-adjacency matrix to obtain a necessary and sufficient combinatorial criterion. When the signed facet-adjacency graph is connected and balanced---with balance equivalent to disorientability in dimension $k$---the criterion reduces to the simple condition that all facets share a common ridge. Finally, whenever $K$ has at least two facets, we prove the sharp bound \[ λ_2\bigl(\Lup_{k-1}(K)\bigr)\ge d_2(K)+k-1. \] This gives a higher-dimensional analogue of the second-index Brouwer--Haemers bound for graphs. The natural termwise extension to higher eigenvalue indices fails already at $m=3$, as a s

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vinayak Gupta. 2026-08-08. Spectral Bounds and Shifted Complexes: Eigenvalues of the Up-Laplacian via Face Degrees. https://arxiv.org/abs/2608.01694

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO