Exponential (Newton) recursion characterises the Schur polynomials
ProvedHararySachs.Hyper.exp_newtoncombinatoricspower-series
Let be a sequence of rationals. Let be the Schur polynomial of the mission (Definition 2), that is, the coefficient of in :
Let , and let be rationals with satisfying the Newton-type recursion
Then for every .
This is the coefficientwise form of the fact that is the unique power series with and . Applied with , it converts Newton's identities between the coefficients of the characteristic polynomial and the traces into the closed form required by trace_identity.
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_Operators
Formal statement
namespace HararySachs.Hyper
theorem exp_newton (D : ℕ) (t c : ℕ → ℚ) (h0 : c 0 = 1)
(hrec : ∀ d, 1 ≤ d → d ≤ D →
(d : ℚ) * c d = ∑ j ∈ Finset.Icc 1 d, (j : ℚ) * t j * c (d - j)) :
∀ d ≤ D, c d = schurP d t := by sorry
end HararySachs.Hyper
Source
Clark–Cooper, A Harary–Sachs theorem for hypergraphs, arXiv:1812.00468v2, Definition 2 (Schur polynomials ) and the exponential formula preceding Theorem 14; standard (e.g. Stanley, Enumerative Combinatorics Vol. 2, Section 5.1).