min_binary_deletion_collision
def
For natural numbers k and n, min_binary_deletion_collision k n is the minimum over all binary words w of length n of binary_deletion_collision k n w.
Statement
def min_binary_deletion_collision (k n : ℕ) : ℕ- Defined in
- arXiv:2611.01064: Maximal input entropy for binary two-deletion and two-insertion channels
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- binary_deletion_collisionFor natural numbers k and n and a binary word w of length n, binary_deletion_collision k n w is the sum over all binary words u of length…
- Used by 4
- min_binary_deletion_collision_three_fourThe minimum three-deletion collision sum min_binary_deletion_collision 3 4 equals 8.
- min_q_ary_deletion_collision_two_eq_min_binaryFor all k and n, the minimum q-ary k-deletion collision sum over words of length n with q = 2 equals the minimum binary k-deletion…
- op_1359_q_two_of_binary_two_deletion_lawIf the binary two-deletion law holds, that is, (min_binary_deletion_collision 2 n - binom(n,2)) / n^(3/2) tends to 2√2, then the q = 2…
- min_binary_deletion_collision_two_fourThe minimum two-deletion collision sum min_binary_deletion_collision 2 4 equals 10.
Read back from the Lean
The definition min_binary_deletion_collision k n computes the minimum value of binary_deletion_collision k n w over all boolean sequences w : Fin n → Bool.
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 minimum k-deletion collision sum over all binary words of length n. -/ def min_binary_deletion_collision (k n : ℕ) : ℕ := (Finset.univ.image (fun w : Fin n → Bool => binary_deletion_collision k n w)).min' (Finset.Nonempty.image Finset.univ_nonempty _)