no. 14 · Friday 13 November 2026
Triangle Families with Large Edge Up-Laplacian Spectral Gap
Abstract
Let $\mathcal{T}$ be a finite nonempty family of $3$-element sets, viewed as the triangles of a $2$-dimensional simplicial complex, and let $λ(\mathcal{T})$ be the smallest positive eigenvalue of its edge up-Laplacian $δ_{1,\mathcal{T}}^Tδ_{1,\mathcal{T}}$, where $δ_{1,\mathcal{T}}$ is the signed edge-triangle incidence matrix. We view $λ(\mathcal{T})$ as an analogue of the algebraic connectivity one dimension up, and study the extremal function $φ(t)=\max_{|\mathcal{T}|=t}λ(\mathcal{T})$. For every $n \geq 3$, we show that $λ(\mathcal{T}) \leq n-1$ whenever $|\mathcal{T}|<\binom{n}{3}$ and that $φ\left(\binom{n}{3}\right)=n$, attained only by the complete triple system on $n$ points. For every $n\geq 5$, we show that $φ(t) \leq n-1$ for all $\binom{n}{3} < t < \binom{n+1}{3}$. In particular, $φ$ is not monotone, while $\max_{s \leq t} φ(s)=\max\left\{n : \binom{n}{3} \leq t \right\}$. We also prove that $φ(t)=Θ(t^{\frac{1}{3}}).$ The proofs rest on two local bounds: $λ(\mathcal{T}) \leq d+2$ for every edge lying in exactly $d$ triangles of $\mathcal{T}$, and, in the spirit of Garland's local-to-global method, $λ(\mathcal{T}) \leq 1 + μ$ for every nonzero Laplacian eigenvalue $μ$ of every connected component of every vertex link. Applying Fiedler's inequality between algebraic connectivity and minimum degree to the link, the second bound gives rigidity: an edge lying in exactly $d$ triangles with $λ(\mathcal{T}) > d+1$ must lie in a complete triple system on $d+2$ points that shares no edge with the rest of $\mathcal{T}$. When $\mathcal{T}$ is the set of all triangles of a connected graph, the smallest positive eigenvalue of the Helmholtzian (edge Hodge Laplacian) is the minimum of $λ(\mathcal{T})$ and the algebraic connectivity, so both bounds apply to it.
- comments
- 25 pages
- fields
- Combinatorics