Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Pattern matching in $(213,231)$-avoiding permutations (1511.01770v1)

Published 5 Nov 2015 in cs.DS and math.CO

Abstract: Given permutations $\sigma \in S_k$ and $\pi \in S_n$ with $k<n$, the \emph{pattern matching} problem is to decide whether $\pi$ matches $\sigma$ as an order-isomorphic subsequence. We give a linear-time algorithm in case both $\pi$ and $\sigma$ avoid the two size-$3$ permutations $213$ and $231$. For the special case where only $\sigma$ avoids $213$ and $231$, we present a $O(max(kn2,n2\log(\log(n)))$ time algorithm. We extend our research to bivincular patterns that avoid $213$ and $231$ and present a $O(kn4)$ time algorithm. Finally we look at the related problem of the longest subsequence which avoids $213$ and $231$.

Summary

We haven't generated a summary for this paper yet.