petrial_coeff
def
Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and k : ℕ, petrial_coeff G k is the cardinality of the finset of all F : Finset V such that the rank over ZMod 2 of petrial_matrix G F equals k.
Statement
noncomputable def petrial_coeff {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (k : ℕ) : ℕ
- Defined in
- arXiv:2611.07503, Eq. (1)
- Verified
- 06 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,…
- Used by 6
- petrial_log_concave_of_card_le_oneEvery simple graph on at most 1 vertex satisfies petrial_log_concave G.
- petrial_log_concaveA simple graph G on a finite type V with decidable equality and decidable adjacency has a log-concave partial Petrial polynomial if for…
- op_1239_at_most_two_nonzero_coeffs_log_concaveEvery simple graph G on a finite type V with decidable equality and decidable adjacency for which the number of k in the range from 0 to…
- op_1239_path_graph_petrial_log_concaveFor every n : ℕ, the path graph pathGraph n has a log-concave partial Petrial polynomial (petrial_log_concave (SimpleGraph.pathGraph n)).
- petrial_coeff_eq_zero_of_gt_cardFor any finite simple graph G and any integer k strictly greater than the number of vertices, petrial_coeff G k equals 0.
- petrial_coeff_sumFor any simple graph G on a finite type V with decidable equality and decidable adjacency, the sum of petrial_coeff G k for k in the range…
Read back from the Lean
Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a natural number k, petrial_coeff G k is the number of subsets F ⊆ V such that the matrix rank of petrial_matrix G F over ZMod 2 is equal to k.
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 k-th coefficient of the partial Petrial polynomial of a simple graph. -/ noncomputable def petrial_coeff {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (k : ℕ) : ℕ := ((Finset.univ : Finset (Finset V)).filter (fun F => (petrial_matrix G F).rank = k)).card