The extremal intersection conjecture for q-ary deletion channels
Statement
Let denote the maximum, over pairs of distinct -ary strings of length , of the size of the intersection of their sets of length- deletion traces. For and sufficiently large , define
where and .
Extremal intersection conjecture. For and sufficiently large , we have
This conjecture proposes that the displayed pair of strings attains the maximum common deletion-trace intersection for sufficiently long strings over alphabets of size at least four. The preceding results determine the ternary case, while the corresponding values for are not determined even when ; the conjecture gives a candidate extremal pair for that unresolved range.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.