ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be a text permutation of length nn, let π\pi be a pattern permutation, and let σ\sigma be an arbitrary permutation of length O(1)O(1). Suppose that π\pi avoids σ\sigma.

Fixed-pattern avoidance conjecture. The permutation pattern matching problem with text tt and pattern π\pi can be solved in time 2o(n)2^{o(n)}.

This conjecture would unify and generalize several subexponential algorithms for restricted families of permutations. The source states that characterizing the base c(π)c(\pi) of the Stanley–Wilf bound remains a deep open question, and presents this as a natural open direction.

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.