Subexponential pattern matching for permutations avoiding a fixed pattern
Statement
Let be a text permutation of length , let be a pattern permutation, and let be an arbitrary permutation of length . Suppose that avoids .
Fixed-pattern avoidance conjecture. The permutation pattern matching problem with text and pattern can be solved in time .
This conjecture would unify and generalize several subexponential algorithms for restricted families of permutations. The source states that characterizing the base 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.