ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Nq(n,2,t)N_q(n,2,t) denote the maximum, over pairs of distinct qq-ary strings of length nn, of the size of the intersection of their sets of length-n−tn-t deletion traces. For q⩾4q\geqslant 4 and sufficiently large nn, define

x=(0,1,2,0,1,w),y=(1,0,2,1,0,w),\mathbf{x}=(0,1,2,0,1,\mathbf{w}),\qquad \mathbf{y}=(1,0,2,1,0,\mathbf{w}),

where w=(w1,…,wn−5)\mathbf{w}=(w_1,\ldots,w_{n-5}) and wi≡i+1(modq)w_i\equiv i+1\pmod q.

Extremal intersection conjecture. For q⩾4q\geqslant 4 and sufficiently large nn, we have

Nq(n,2,t)=∣Dt(x)∩Dt(y)∣.N_q(n,2,t)=|D_t(\mathbf{x})\cap D_t(\mathbf{y})|.

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 q⩾4q\geqslant 4 are not determined even when t=2t=2; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.