Green's conjecture and testing linear invariant properties

DOI10.1007/978-3-642-16367-8_30MaRDI QIDQ4933388zbMATH OpenOpenAlexFDO

Authors Asaf Shapira

Publication date 12 October 2010

Published in Property Testing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16367-8_30

zbMATH Keywords

hypergraphslinear invarianceproperty testingremoval lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Randomized algorithms (68W20)

Recommendations

• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• Algebraic property testing: the role of invariance
• Green's conjecture and testing linear-invariant properties
• Testing linear-invariant non-linear properties
• A removal lemma for systems of linear equations over finite fields

Cites work

• A combinatorial proof of the removal lemma for groups
• A removal lemma for systems of linear equations over finite fields
• A Szemerédi-type regularity lemma in abelian groups, with applications
• A variant of the hypergraph removal lemma
• An ergodic Szemerédi theorem for commuting transformations
• Extremal problems on set systems
• Green's conjecture and testing linear-invariant properties
• scientific article; zbMATH DE number 3523693 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On Certain Sets of Integers
• Property testing and its connection to learning and approximation
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regularity Lemma for k-uniform hypergraphs
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• Testability and repair of hereditary hypergraph properties
• Testing linear-invariant non-linear properties
• Testing subgraphs in directed graphs
• The counting lemma for regular k‐uniform hypergraphs

Cited in

(5)

• A linear bound on the dimension in Green-Ruzsa's theorem
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• Flipping out with many flips: hardness of testing \(k\)-monotonicity
• Green's conjecture and testing linear-invariant properties
• Flipping out with many flips: hardness of testing \(k\)-monotonicity

This page was built for publication: Green's conjecture and testing linear invariant properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933388)