qary_multiple_deletion_hinge
For natural numbers t, q, n, and r, and a q-ary word y of length n (y : Fin n → Fin q), the t-deletion hinge sum is the sum over all words x : Fin (n + t) → Fin q of the excess embedding count q_ary_subsequence_num_embeddings q n (n + t) y x - r.
Statement
def qary_multiple_deletion_hinge (t q n r : ℕ) (y : Fin n → Fin q) : ℕ- Defined in
- knowledgebase, OP-1503
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- q_ary_subsequence_num_embeddingsFor words u of length m and w of length n over an alphabet of size q represented by Fin q, q_ary_subsequence_num_embeddings q m n u w is…
- Used by 6
- op_1537_binary_length_two_one_deletionFor any nonconstant binary word y : Fin 2 → Fin 2 of length 2, there exists a longest run [a, b) of y and an immediately adjacent run [a',…
- op_1534_binary_length_two_one_deletionFor every binary word y of length 2 (y : Fin 2 → Fin 2), the one-deletion hinge sums at thresholds r = 1 and r = 2 satisfy…
- op_1503_two_deletion_hinge_eqFor any alphabet size q, length n, threshold r, and word y : Fin n → Fin q, the multiple-deletion hinge sum for two deletions…
- op_1534_constant_word_deletion_envelope_eqFor integers t ≥ 1, q ≥ 2, and n ≥ 1, and any threshold r, the t-deletion hinge sum of the all-zero word qary_all_zero_word q n (by omega)…
- op_1537_ternary_length_two_one_deletionFor any nonconstant ternary word y : Fin 2 → Fin 3 of length 2, there exists a longest run [a, b) of y and an immediately adjacent run…
- op_1534_ternary_length_two_one_deletionFor every ternary word y of length 2 (y : Fin 2 → Fin 3), the one-deletion hinge sums at thresholds r = 1 and r = 2 satisfy…
Read back from the Lean
A definition of qary_multiple_deletion_hinge t q n r y, which takes natural numbers t, q, n, r and a function y : Fin n → Fin q (representing a length-$n$ word over an alphabet of size $q$), and returns the natural number given by the sum over all functions x : Fin (n + t) → Fin q of (q_ary_subsequence_num_embeddings q n (n + t) y x - r), where subtraction is the truncated subtraction on ℕ (i.e., $\max(0, \cdot - r)$).
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
/-- Hinge sum W_r(y) of excess embedding counts of a length-n word y into words of length n+t. -/ def qary_multiple_deletion_hinge (t q n r : ℕ) (y : Fin n → Fin q) : ℕ := ∑ x : Fin (n + t) → Fin q, (q_ary_subsequence_num_embeddings q n (n + t) y x - r)