Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph (Q2306299)

A thorough probe on the spectrum of a hypergraph is an upcoming topic of research in the area of hypergraph theory. A knowledge of the spectrum may help to decipher certain attributes of the hypergraph itself. Keeping this in mind several researchers contributed to this line of research. In particular, the problem of determining all the eigenvalues of a general hypergraph is a very difficult. The author of this paper proposes a technique to determine the spectrum of a complete $k$-uniform hypergraph with $n$ vertices. He also constructs the spectrum of a complete 4-uniform hypergraph with $n$ vertices with some examples. The paper is well written and is interesting to read.