AFTD Auto-Formalizing Theoretical Domains

petrial_nullity_poly

def

The nullity generating polynomial of a finite graph G on V: the sum over all vertex subsets F of w raised to the nullity of the partial Petrial matrix at F, i.e. w^(|V| - rank (petrial_matrix G F)). Equivalently, the coefficient of w^j is the number of F : Finset V for which petrial_matrix G F has nullity j.

Statement

noncomputable def petrial_nullity_poly {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Polynomial ℕ
Source
step towards op_1239_max_degree_three_tree_petrial_log_concave
Verified
15 Nov 2026
Axioms
none listed
Built on 1
  • petrial_matrixGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a finite subset F : Finset V,…

Lean source view module on GitHub

/-- The nullity generating polynomial of a finite graph: the coefficient of w^j counts the subsets F whose partial Petrial matrix has nullity j. -/
noncomputable def petrial_nullity_poly {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Polynomial ℕ := ∑ F : Finset V, Polynomial.X ^ (Fintype.card V - (petrial_matrix G F).rank)
See it in the graphDiscuss this resultChallenge it