simple_graph_t_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 t-chromatic symmetric function ps_n(Z_G(x; t)) is the bivariate polynomial in Polynomial (Polynomial ℕ) defined as the sum over all proper colorings c : G.Coloring (Fin n) of Polynomial.monomial (Finset.univ.image c).card (Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ)), where the outer indeterminate represents t and the inner indeterminate represents q.
Statement
noncomputable def simple_graph_t_chromatic_principal_specialization {V : Type*} [Fintype V] (G : SimpleGraph V) (n : ℕ) : Polynomial (Polynomial ℕ)
- Defined in
- arXiv:2610.31785, Definition 3.8
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 12
- simple_graph_t_chromatic_ps_min_add_max_q_degreeFor a finite simple graph G and n ∈ ℕ, if d and D are the least and greatest exponents j of q such that some coefficient of t^k q^j in…
- simple_graph_coloring_two_colours_const_on_bipartitionLet G be a connected finite simple graph with a proper 2-coloring b : V → Fin 2, and let u0, w0 be adjacent with b u0 = 0 and b w0 = 1.…
- simple_graph_t_chromatic_ps_coloring_count_revFor a finite simple graph G, natural numbers n, k and j ≤ (n-1)|V|, the number of proper colorings c : V → Fin n with exactly k colors and…
- simple_graph_t_chromatic_ps_coeff_t_two_of_edgeLet G be a connected finite simple graph with a proper 2-coloring b : V → Fin 2 and an edge u0 w0 with b u0 = 0, b w0 = 1. Let s0, s1 be…
- simple_graph_t_chromatic_ps_q_coeff_symmLet n ≥ 2 and let G be a finite simple graph with at least 2 vertices that has a proper coloring with n colors. Let d and D be the minimum…
- simple_graph_t_chromatic_ps_coeff_coeffFor a finite simple graph G and natural numbers n, k, j, the coefficient of t^k q^j in the n-th principal specialization ps_n(Z_G(x; t))…
- simple_graph_t_chromatic_ps_coeff_t_eq_sumFor a finite simple graph G and natural numbers n, k, the coefficient of t^k in ps_n(Z_G(x; t)) is the polynomial in q equal to the sum of…
- 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…
- simple_graph_t_chromatic_ps_coeff_t_two_connected_bipartiteLet n ≥ 2 and let G be a connected finite simple graph with at least 2 vertices that has a proper coloring with n colors, and let b : V →…
- simple_graph_t_chromatic_ps_vertex_count_eqLet n ≥ 2 and let G be a finite simple graph with at least 2 vertices that has a proper coloring with n colors (χ_G(n) > 0). Let d and D…
- fin_pair_ne_sum_pow_swapFor natural numbers n, a, b, the sum over ordered pairs (j1, j2) of distinct elements of Fin n of X^(a j1 + b j2) in ℕ[X] equals the sum…
Read back from the Lean
Given a finite type V, a simple graph G on V, and a natural number n, simple_graph_t_chromatic_principal_specialization G n is the bivariate polynomial in Polynomial (Polynomial ℕ) defined as the sum over all proper vertex colorings c : G.Coloring (Fin n) of G with colors in {0, 1, …, n - 1} of:
X^k · Y^s
where:
- X is the variable of the outer polynomial and k = (Finset.univ.image c).card is the number of distinct colors used by c on V,
- Y is the variable of the inner polynomial, with coefficient 1, and s = ∑ v : V, (c v : ℕ) is the sum over all vertices v : V of the numerical value of the color c v ∈ {0, 1, …, n - 1} coerced to ℕ.
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(Z_G(x; t)) of the t-chromatic symmetric function of a graph G. -/ noncomputable def simple_graph_t_chromatic_principal_specialization {V : Type*} [Fintype V] (G : SimpleGraph V) (n : ℕ) : Polynomial (Polynomial ℕ) := ∑ c : G.Coloring (Fin n), Polynomial.monomial (Finset.univ.image c).card (Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ))