is_square_path_coloring
deforiginal
A word y : Fin n → Fin q is a square path coloring if y i ≠ y j for all i, j : Fin n with j.val = i.val + 1 or j.val = i.val + 2.
Statement
def is_square_path_coloring {n q : ℕ} (y : Fin n → Fin q) : Prop
- Related work
- arXiv:2611.01064; Open Problem OP-1480
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 3
- op_1499_quaternary_length_twoFor every quaternary word y of length 2 (y : Fin 2 → Fin 4), the two-deletion hinge sums satisfy qary_two_deletion_hinge 4 2 2 y ≥ 2^2 + 2…
- op_1503_spaced_word_two_iffFor any word y : Fin n → Fin q, y is 2-spaced if and only if y is a proper coloring of the square of the path (is_square_path_coloring y).
- op_1499_ternary_length_twoFor every ternary word y of length 2 (y : Fin 2 → Fin 3), the two-deletion hinge sums satisfy qary_two_deletion_hinge 3 2 2 y ≥ 2^2 + 2 -…
Read back from the Lean
For natural numbers $n$ and $q$, a function $y : \mathrm{Fin}\ n \to \mathrm{Fin}\ q$ satisfies is_square_path_coloring if and only if for all $i, j \in \mathrm{Fin}\ n$, whenever $i.\mathrm{val} + 1 = j.\mathrm{val}$ or $i.\mathrm{val} + 2 = j.\mathrm{val}$, the colors differ: $y(i) \neq y(j)$.
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
/-- A word y : Fin n → Fin q is a square path coloring if adjacent elements and distance-two elements are distinct. -/ def is_square_path_coloring {n q : ℕ} (y : Fin n → Fin q) : Prop := ∀ (i j : Fin n), (i.val + 1 = j.val ∨ i.val + 2 = j.val) → y i ≠ y j