simple_graph_chromatic_principal_specialization
For a finite simple graph G on a finite vertex type V and a natural number n, the n-th principal specialization of the chromatic symmetric function ps_n(X_G(x)) is the polynomial in Polynomial ℕ defined as the sum over all proper colorings c : G.Coloring (Fin n) of Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ).
Statement
noncomputable def simple_graph_chromatic_principal_specialization {V : Type*} [Fintype V] (G : SimpleGraph V) (n : ℕ) : Polynomial ℕ
- Defined in
- arXiv:2610.31785, Definition 2.9 (Eq. 2.1)
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 2
- simple_graph_t_chromatic_ps_eval_oneFor any finite simple graph G on a finite vertex type V and any natural number n, evaluating the n-th principal specialization of the…
- simple_graph_t_chromatic_ps_determines_chromatic_psLet G and H be finite simple graphs on finite vertex types V and W, respectively, and let n be a positive integer. If the n-th principal…
Read back from the Lean
For a finite type V, a simple graph G on V, and a natural number n, simple_graph_chromatic_principal_specialization G n is the polynomial in Polynomial ℕ defined as the sum over all proper vertex colorings c : G.Coloring (Fin n) of the monomial X ^ (∑ v : V, (c v : ℕ)) with coefficient 1 (where each color c v ∈ Fin n is evaluated as a natural number in {0, ..., n - 1}).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The n-th principal specialization ps_n(X_G(x)) of the chromatic symmetric function of a graph G. -/ noncomputable def simple_graph_chromatic_principal_specialization {V : Type*} [Fintype V] (G : SimpleGraph V) (n : ℕ) : Polynomial ℕ := ∑ c : G.Coloring (Fin n), Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ)