On the spectra of k-uniform threshold hypergraphs
Combinatorics
2026-02-26 v1
Abstract
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by means of combinatorial numbers, derived from edge counts. An important problem addressed in Spectral Graph Theory is to find graphs with few distinct eigenvalues. Our characterization allows us to construct k-uniform threshold hypergraphs having an arbitrary number of vertices with few distinct eigenvalues.
Cite
@article{arxiv.2602.21382,
title = {On the spectra of k-uniform threshold hypergraphs},
author = {Miriam Abdón and Lucas Portugal and Renata Del-Vecchio and Renata de Freitas},
journal= {arXiv preprint arXiv:2602.21382},
year = {2026}
}
Comments
16 pages