Spectral properties of <i>k</i> -uniform threshold hypergraphs

In this article we introduce a definition of k-uniform threshold hypergraph through a binary sequence, a natural extension of the classical definition for threshold 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.