Papers
Topics
Authors
Recent
Search
2000 character limit reached

Faster and simpler algorithms for finding large patterns in permutations

Published 23 Feb 2019 in cs.DS and math.CO | (1902.08809v2)

Abstract: Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this area is deciding whether a given permutation of length nn contains a given pattern of length kk. In this work we give two new algorithms for this well-studied problem, one whose running time is n0.44k+o(k)n^{0.44k+o(k)}, and one whose running time is the better of O(1.6181n)O(1.6181^n) and nk/2+o(k)n^{k/2+o(k)}. These results improve the earlier best bounds of Ahal and Rabinovich (2000), and Bruner and Lackner (2012), and are the fastest algorithms for the problem when k=Ω(log⁡n)k = \Omega(\log n). When k=o(log⁡n)k = o(\log n), the parameterized algorithm of Guillemot and Marx (2013) dominates. Our second algorithm uses polynomial space and is significantly simpler than all previous approaches with comparable running times, including an nk/2+o(k)n^{k/2+o(k)} algorithm proposed by Guillemot and Marx. Our approach can be summarized as follows: "for every matching of the even-valued entries of the pattern, try to match all odd-valued entries left-to-right". For the special case of patterns that are Jordan-permutations, we show an improved, subexponential running time.

Authors (1)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.