Signless Laplacian spectral radius of simplicial complexes without holes

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…