# Strongly Sublinear Algorithms for Testing Pattern Freeness

@inproceedings{Newman2022StronglySA, title={Strongly Sublinear Algorithms for Testing Pattern Freeness}, author={Ilan Newman and Nithin M. Varma}, booktitle={ICALP}, year={2022} }

For a permutation π : [k] → [k], a function f : [n] → R contains a π-appearance if there exists 1 ≤ i1 < i2 < · · · < ik ≤ n such that for all s, t ∈ [k], it holds that f(is) < f(it) if and only if π(s) < π(t). The function is π-free if it has no π-appearances. In this paper, we investigate the problem of testing whether an input function f is π-free or whether at least εn values in f need to be changed in order to make it π-free. This problem is a generalization of the well-studied…

## References

SHOWING 1-10 OF 42 REFERENCES

Testing for forbidden order patterns in an array

- Mathematics, Computer ScienceSODA
- 2017

A sequence f:[n]→R contains a pattern π∈Sk , that is, a permutations of [k], iff there are indices i1 < … < ik, such that f(ix) > f(iy) whenever π(x) > π(y). Otherwise, f is π‐free. We study the…

On the Number of Permutations Avoiding a Given Pattern

- MathematicsJ. Comb. Theory, Ser. A
- 2000

Here it is proved that for every fixed σ ∈ S k, F ( n, σ )⩽ c nγ *( n ) is an extremely slow growing function, related to the Ackermann hierarchy.

Finding Monotone Patterns in Sublinear Time

- Computer Science, Mathematics2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

It is shown that the non-adaptive query complexity of finding a length-k monotone subsequence of f : [n] → R, assuming that f is ε-far from free of such subsequences, is Θ((log n)^ ⌊log_2k⌋ ).

Improved Testing Algorithms for Monotonicity

- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 1999

Improved algorithms for testing monotonicity of functions are presented, given the ability to query an unknown function f: Σ n ↦ Ξ, and the test always accepts a monotone f, and rejects f with high probability if it is e-far from being monotones.

Finding small patterns in permutations in linear time

- Mathematics, Computer ScienceSODA
- 2014

A novel type of decompositions for permutations and a corresponding width measure is introduced and shown how to solve the Permutation Pattern problem in linear time if a bounded-width decomposition is given in the input.

Parameterized Property Testing of Functions

- Computer ScienceElectron. Colloquium Comput. Complex.
- 2017

This work parameterizes the query complexity of property testers in terms of the size r of the image of the input function, and obtains testers for monotonicity and convexity of functions of the form f:[n]→ R with query complexity O (log r), with no dependence on n.

Fast Property Testing and Metrics for Permutations

- Mathematics, Computer ScienceCombinatorics, Probability and Computing
- 2018

There are now several general results in this area which show that natural properties of combinatorial objects can be tested with ‘constant’ query complexity, depending only on ε and the property, and not on the size of the object being tested.

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids

- Computer ScienceSTOC '13
- 2013

The problem of monotonicity testing over the hypergrid and its special case, the hypercube, is a classic question in property testing and a general unified proof for O(n/ε) samples suffice for the edge tester is proved.

Finding and counting permutations via CSPs

- Computer Science, MathematicsIPEC
- 2019

Two new algorithms are given for permutation patterns and pattern avoidance, one whose running time is the better of the jats:inline-formula and the other a polynomial-space algorithm.