Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Bounds for Testing Forbidden Order Patterns

Published 29 Oct 2017 in cs.DS, cs.CC, and math.CO | (1710.10660v1)

Abstract: A sequence f ⁣:{1,…,n}→Rf\colon\{1,\dots,n\}\to\mathbb{R} contains a permutation π\pi of length kk if there exist i1<⋯<iki_1<\dots<i_k such that, for all x,yx,y, f(ix)<f(iy)f(i_x)<f(i_y) if and only if π(x)<π(y)\pi(x)<\pi(y); otherwise, ff is said to be π\pi-free. In this work, we consider the problem of testing for π\pi-freeness with one-sided error, continuing the investigation of [Newman et al., SODA'17]. We demonstrate a surprising behavior for non-adaptive tests with one-sided error: While a trivial sampling-based approach yields an ε\varepsilon-test for π\pi-freeness making Θ(ε−1/kn1−1/k)\Theta(\varepsilon^{-1/k} n^{1-1/k}) queries, our lower bounds imply that this is almost optimal for most permutations! Specifically, for most permutations π\pi of length kk, any non-adaptive one-sided ε\varepsilon-test requires ε−1/(k−Θ(1))n1−1/(k−Θ(1))\varepsilon^{-1/(k-\Theta(1))}n^{1-1/(k-\Theta(1))} queries; furthermore, the permutations that are hardest to test require Θ(ε−1/(k−1)n1−1/(k−1))\Theta(\varepsilon^{-1/(k-1)}n^{1-1/(k-1)}) queries, which is tight in nn and ε\varepsilon. Additionally, we show two hierarchical behaviors here. First, for any kk and l≤k−1l\leq k-1, there exists some π\pi of length kk that requires Θ~ε(n1−1/l)\tilde{\Theta}_{\varepsilon}(n^{1-1/l}) non-adaptive queries. Second, we show an adaptivity hierarchy for π=(1,3,2)\pi=(1,3,2) by proving upper and lower bounds for (one- and two-sided) testing of π\pi-freeness with rr rounds of adaptivity. The results answer open questions of Newman et al. and [Canonne and Gur, CCC'17].

Citations (12)

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.