Strongly Sublinear Algorithms for Testing Pattern Freeness
Abstract: For a permutation , a function contains a -appearance if there exists such that for all , if and only if . The function is -free if it has no -appearances. In this paper, we investigate the problem of testing whether an input function is -free or whether differs on at least values from every -free function. This is a generalization of the well-studied monotonicity testing and was first studied by Newman, Rabinovich, Rajendraprasad and Sohler (Random Structures and Algorithms 2019). We show that for all constants , , and permutation , there is a one-sided error -testing algorithm for -freeness of functions that makes queries. We improve significantly upon the previous best upper bound by Ben-Eliezer and Canonne (SODA 2018). Our algorithm is adaptive, while the earlier best upper bound is known to be tight for nonadaptive algorithms.
Paper Prompts
Sign up for free to create and run prompts on this paper.