The characteristic polynomial of a -graph is monic of degree (leading coefficient)
ProvedHararySachs.Hyper.charPoly_coeff_tophypergraphsresultantsspectral-graph-theory
Let be a -uniform hypergraph on vertices with , with edge set , and let be its normalized adjacency hypermatrix. Let be the multivariate resultant of homogeneous forms of degree in variables. It is characterised by three properties:
- it vanishes exactly when the forms have a common nontrivial zero over ;
- it is normalized to on ;
- it is irreducible.
The characteristic polynomial is
Its coefficient of , where , equals .
Together with , this is the statement that is monic of degree . It follows from the homogeneity of the resultant (degree in the coefficients of each form) and its normalization, since enters only through the diagonal coefficients. (Edges have at least two vertices, so has no diagonal entries.) This fixes the constant term in the Newton recursion for the codegree coefficients.
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly
Formal statement
namespace HararySachs.Hyper
theorem charPoly_coeff_top (n k : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
(E : Finset (Finset (Fin n))) (hE : ∀ e ∈ E, e.card = k)
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
(hres : IsResultant n (fun _ => k - 1) res) :
(charPoly (k := k) E res).coeff (n * (k - 1) ^ (n - 1)) = 1 := by sorry
end HararySachs.Hyper
Source
Cooper–Dutle, Spectra of uniform hypergraphs, Linear Algebra Appl. 436 (2012), Section 2 (degree of the characteristic polynomial); Clark–Cooper, arXiv:1812.00468v2, Section 2.