Efficient Removal Lemmas for Matrices

@inproceedings{Alon2016EfficientRL,
title={Efficient Removal Lemmas for Matrices},
author={Noga Alon and Omri Ben-Eliezer},
booktitle={APPROX-RANDOM},
year={2016}
}
• Published in APPROX-RANDOM 2016
• Mathematics, Computer Science
• The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the following (ordered) matrix removal lemma: For any finite alphabet $\Sigma$, any hereditary property $\mathcal{P}$ of matrices over $\Sigma$, and any $\epsilon > 0$, there exists $f_{\mathcal{P}}(\epsilon)$ such that for any matrix $M$ over $\Sigma$ that is… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

3

Earthmover Resilience and Testing in Ordered Structures

• Computer Science, Mathematics
• Electronic Colloquium on Computational Complexity
• 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Testing Hereditary Properties of Ordered Graphs and Matrices

• Computer Science, Mathematics
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
VIEW 14 EXCERPTS

Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs

• Mathematics, Computer Science
• SIAM J. Comput.
• 2007
VIEW 8 EXCERPTS

Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects

• Mathematics, Computer Science
• APPROX-RANDOM
• 2007
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays

• Mathematics, Computer Science
• ICALP
• 2016

Removal lemmas with polynomial bounds

• Mathematics, Computer Science
• STOC 2017
• 2016
VIEW 2 EXCERPTS

Easily Testable Graph Properties

• Computer Science, Mathematics
• Comb. Probab. Comput.
• 2015

Graph removal lemmas

• Mathematics, Computer Science
• Surveys in Combinatorics
• 2013
VIEW 1 EXCERPT

Bounds for graph regularity and removal lemmas

• Mathematics, Computer Science
• ArXiv
• 2012
VIEW 1 EXCERPT

A new proof of the graph removal lemma

• Jacob Fox
• Computer Science, Mathematics
• ArXiv
• 2010
VIEW 1 EXCERPT