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}
}
  • Noga Alon, Omri Ben-Eliezer
  • 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
    Twitter Mentions

    Topics from this paper.

    Citations

    Publications citing this paper.

    Earthmover Resilience and Testing in Ordered Structures

    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

    VIEW 14 EXCERPTS

    Removal lemmas with polynomial bounds

    VIEW 2 EXCERPTS

    Easily Testable Graph Properties

    Graph removal lemmas

    VIEW 1 EXCERPT

    Bounds for graph regularity and removal lemmas

    VIEW 1 EXCERPT

    A new proof of the graph removal lemma

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