Simplices and spectra of graphs
classification
🧮 math.MG
math.RT
keywords
algebraicallycodimensioncombinatoriallycompletecomputeedgesfacesfunctions
read the original abstract
In this note we show the n-2-dimensional volumes of codimension 2 faces of an n-dimensional simplex are algebraically independent functions of the lengths of edges. In order to prove this we compute the complete spectrum of a combinatorially interesting graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.