ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is it asymptotically almost surely true that tpW3 pnqq “ n{2 ´ opnq? Is tpn, 3q “ n{2 ´ opnq?} Andrzej Ruciński Fix an alphabet A with |A| “ k ě 2 and consider words w P An . Definition 19. Define a pair of subwords w1 , w2 of w to be twins if they are identical and disjoint. Example 2. The overline and underlined words in 11012055 are twins. Let tpwq be the length of the longest pair of twins in w and tn,k “ minn tpwq. wPA |A|“k}

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.