two_insertion_collision
def
For a binary word w of length m + 2, two_insertion_collision m w is the sum over all binary words u of length m of the square of two_deletion_num_embeddings m u w.
Statement
def two_insertion_collision (m : ℕ) (w : Fin (m + 2) → Bool) : ℕ- Defined in
- arXiv:2611.01064, Section 2
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Built on 1
- two_deletion_num_embeddingsFor a binary word w of length n and y of length n + 2, two_deletion_num_embeddings n w y is the number of strictly increasing index…
- Used by 2
- min_two_insertion_collision_five_lt_alternatingThe minimum two-insertion collision sum min_two_insertion_collision 5 is strictly less than two_insertion_collision 3 (alternating_word 5…
- min_two_insertion_collisionFor a natural number n, min_two_insertion_collision n is the minimum over all binary words w of length n of two_insertion_collision (n -…
Read back from the Lean
Given a natural number $m$ and a binary word $w : \mathrm{Fin}(m + 2) \to \mathrm{Bool}$, two_insertion_collision m w is defined as the sum over all binary words $u : \mathrm{Fin}(m) \to \mathrm{Bool}$ of the square of two_deletion_num_embeddings m u w.
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
/-- Sum of squares of two-insertion (two-deletion) embedding counts over subwords of length m. -/ def two_insertion_collision (m : ℕ) (w : Fin (m + 2) → Bool) : ℕ := ∑ u : Fin m → Bool, (two_deletion_num_embeddings m u w) ^ 2