Leading coefficient of from block-homogeneity and normalisation of the resultant
ProvedHararySachs.Hyper.charPoly_coeff_of_blockHomogeneoushypergraphsresultantsspectral-graph-theory
Let be a hypergraph on vertices with edge set and let . Let be any polynomial in the coefficients () of forms of degree . Assume:
- block-homogeneity: is homogeneous of the same degree in each block , ;
- normalisation: .
Let be obtained by substituting into the coefficients of , as in charPoly. Then
This is pure algebra. Every monomial of has total degree . Each substituted coefficient has the form , where for the diagonal monomial and otherwise. So the coefficient of is .
Combined with for the resultant, this gives charPoly_coeff_top.
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly
Formal statement
namespace HararySachs.Hyper
theorem charPoly_coeff_of_blockHomogeneous (n k : ℕ) (E : Finset (Finset (Fin n)))
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ) (δ : ℕ)
(hδ : ∀ i : Fin n, res.IsWeightedHomogeneous
(fun v : ResVar n (fun _ => k - 1) => if v.1 = i then 1 else 0) δ)
(hnorm : MvPolynomial.aeval (fun v : ResVar n (fun _ => k - 1) =>
if v.2.1 = Finsupp.single v.1 (k - 1) then (1 : ℤ) else 0) res = 1) :
(charPoly (k := k) E res).coeff (n * δ) = 1 := by sorry
end HararySachs.Hyper
Source
Hu–Huang–Ling–Qi, J. Symbolic Comput. 50 (2013), Theorem 2.3 and Proposition 2.4; Cooper–Dutle, Spectra of uniform hypergraphs, Linear Algebra Appl. 436 (2012), Section 2.