A proof challenge: multiple alignment and information compression
This is an incremental theoretical problem for researchers in information theory and compression, focusing on a specific encoding proposition.
The paper poses a proof challenge regarding whether a multiple alignment concept can encode all redundancy in any one-dimensional sequence of symbols, without providing a result or concrete numbers.
These notes pose a "proof challenge": a proof, or disproof, of the proposition that "For any given body of information, I, expressed as a one-dimensional sequence of atomic symbols, a multiple alignment concept, described in the document, provides a means of encoding all the redundancy that may exist in I. Aspects of the challenge are described.