op_1239_candidate36_not_log_concave
theoremverified
The partial Petrial polynomial of op_1239_candidate36 is not log-concave.
Statement
theorem op_1239_candidate36_not_log_concave : letI : DecidableRel op_1239_candidate36.Adj := Classical.decRel _; ¬ petrial_log_concave op_1239_candidate36- Source
- Candidate for OP-1239; computations 28328 and 28332 checks the standard leaf-deletion recurrence from arXiv:2611.07503, Lemma 1.
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- op_1239_candidate36_petrial_coefficientsThe partial Petrial coefficients of op_1239_candidate36 in ranks 27, 28, and 29 are respectively 256, 32640, and 4666944.
- op_1239_coefficients_force_not_log_concaveAny finite simple graph whose partial Petrial coefficients in ranks 27, 28, and 29 are respectively 256, 32640, and 4666944 fails partial…
- petrial_coeffGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and k : ℕ, petrial_coeff G k is the…
- 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_candidate36The simple graph on the 36 vertices Fin 36 with the 35 undirected edges listed in its definition.
- Used by 1
- op_1239_subcubic_tree_counterexampleThere exists a tree on Fin 36 with maximum degree at most three whose partial Petrial polynomial is not log-concave.
Lean source view module on GitHub
theorem op_1239_candidate36_not_log_concave : letI : DecidableRel op_1239_candidate36.Adj := Classical.decRel _; ¬ petrial_log_concave op_1239_candidate36 := by letI : DecidableRel op_1239_candidate36.Adj := Classical.decRel _ obtain ⟨h1, h2, h3⟩ := op_1239_candidate36_petrial_coefficients exact op_1239_coefficients_force_not_log_concave op_1239_candidate36 h1 h2 h3