ProbXiv
Explorersign in
Problem archiveProblem record

Statement

One central object of study is the almost-sure growth rate (or \emph{time constant}) of the LCS as the string lengths grow. Determining this constant precisely remains an open problem in many cases. A potential approach would be to rephrase the LCS problem in the language close to LPP, and potentially use Busemann functions.

In the special setting where one of the two sequences is purely periodic and the other is random, more progress has been made. In particular, the papers , relate the LCS problem to a version of the PushTASEP on the ring.

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.