Symmetric ABPs for bounded-pathwidth patterns
Lax461425.ABPsForPatterns · concepts/Lax461425/ABPsForPatterns.lean · lax-461425
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For , the homomorphism polynomial of a pattern of pathwidth at most on matrices is computed by a matrix-symmetric ABP whose vertex orbits have size at most .
Concept map
Lean source view on GitHub
| 1 | import Lax461425.SymmetricABPs |
| 2 | import Lax461425.PatternWidths |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Symmetric ABPs for bounded-pathwidth patterns |
| 7 | type: theorem |
| 8 | --- |
| 9 | For `n ≥ 1`, the homomorphism polynomial of a pattern of pathwidth at most `k` on `n × n` |
| 10 | matrices is computed by a matrix-symmetric ABP whose vertex orbits have size at most |
| 11 | `n^(k+1)`. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax461425.ABPsForPatterns |
| 15 | |
| 16 | open SymmetricABPs HomomorphismPolynomials PatternWidths |
| 17 | |
| 18 | /-- Homomorphism polynomials of patterns of pathwidth at most `k` have matrix-symmetric ABPs |
| 19 | with vertex orbits of size at most `n^(k+1)`. -/ |
| 20 | axiom exists_abp {K : Type*} [CommSemiring K] {n k : ℕ} (hn : 1 ≤ n) |
| 21 | (F : Pattern) (hF : PathwidthLE k F) : |
| 22 | ∃ G : ABP (Fin n × Fin n) K, |
| 23 | G.Computes (hom K F n) ∧ G.IsMatrixSymmetric ∧ G.orbitSize ≤ n ^ (k + 1) |
| 24 | |
| 25 | end Lax461425.ABPsForPatterns |
| 26 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments