Proof of Reconstruction with Lyndon patterns

groundedproofs/Lax100001Proofs/Results.lean · lax-100001

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

In the paper

  • page 13 of this submission's paper

Description

Rule Y asks only Lyndon words, its answers determine the word, and it asks at most 8L+20≤28(1+log⁡2n)8L + 20 \le 28(1 + \log_2 n) queries.