For large n, the maximum signless Laplacian spectral radius among n-vertex r-dimensional pure simplicial complexes without r-dimensional wheels is attained by specific extremal complexes, generalizing graph results and providing a spectral analogue of the Sós-Erdős-Brown theorem for r=2.
Signless Laplacian spectral radius of simplicial complexes without holes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study a spectral analog of the Tur\'an problem for simplicial complexes. Specifically, we consider the extremal problem of maximizing the signless Laplacian spectral radius among simplicial complexes without holes. We determine the structure of the simplicial complex attaining the maximum spectral radius, extending classical extremal results for graphs without cycles to the setting of higher-dimensional simplicial complexes. More generally, we establish an upper bound on the signless Laplacian spectral radius of simplicial complexes with prescribed Betti numbers. As an application, using the connection between the signless Laplacian spectral radius and the face numbers of a simplicial complex, we derive bounds on Tur\'an numbers for both hypergraphs and simplicial complexes. Our technique involves the canonical Alexander dual of perfect matchings and coloring of simplicial complexes.
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Signless Laplacian spectral radius of simplicial complexes without $r$-dimensional wheels
For large n, the maximum signless Laplacian spectral radius among n-vertex r-dimensional pure simplicial complexes without r-dimensional wheels is attained by specific extremal complexes, generalizing graph results and providing a spectral analogue of the Sós-Erdős-Brown theorem for r=2.