Green’s Conjecture and Testing Linear Invariant Properties

DOI10.1007/978-3-642-16367-8_30zbMath1259.68233OpenAlexW2179385529MaRDI QIDQ4933388

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

hypergraphsproperty testingremoval lemmalinear invariance

Mathematics Subject Classification ID

Hypergraphs (05C65) Randomized algorithms (68W20)

Related Items

Unnamed Item, Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variant of the hypergraph removal lemma
• A combinatorial proof of the removal lemma for groups
• An ergodic Szemerédi theorem for commuting transformations
• Self-testing/correcting with applications to numerical problems
• A removal lemma for systems of linear equations over finite fields
• Hypergraph regularity and the multidimensional Szemerédi theorem
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Testability and repair of hereditary hypergraph properties
• Property testing and its connection to learning and approximation
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Extremal problems on set systems
• Regularity Lemma for k-uniform hypergraphs
• Robust Characterizations of Polynomials with Applications to Program Testing
• Green's conjecture and testing linear-invariant properties
• Testing Linear-Invariant Non-Linear Properties
• The counting lemma for regular k‐uniform hypergraphs
• On Certain Sets of Integers
• Testing subgraphs in directed graphs