Pages that link to "Item:Q1758978"

The following pages link to A removal lemma for systems of linear equations over finite fields (Q1758978):

Displaying 36 items.

• Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
• Hypergraph containers (Q496210) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• On the removal lemma for linear systems over abelian groups (Q691583) (← links)
• A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
• An asymmetric random Rado theorem: 1-statement (Q2084991) (← links)
• Induced arithmetic removal: complexity 1 patterns over finite fields (Q2142699) (← links)
• On arithmetic progressions in symmetric sets in finite field model (Q2200438) (← links)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
• A relative Szemerédi theorem (Q2355780) (← links)
• A note on sparse supersaturation and extremal results for linear homogeneous systems (Q2401424) (← links)
• On solution-free sets of integers (Q2403693) (← links)
• Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
• A counting lemma for binary matroids and applications to extremal problems (Q2421560) (← links)
• On the number of monochromatic solutions of integer linear systems on abelian groups (Q2509771) (← links)
• On the number of monochromatic solutions of integer linear systems on abelian groups (Q2857443) (← links)
• Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
• Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
• Sum-Free Sets of Integers with a Forbidden Sum (Q4627481) (← links)
• Kneser graphs are like Swiss cheese (Q4645027) (← links)
• The Maker--Breaker Rado Game on a Random Set of Integers (Q4646256) (← links)
• Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
• Green’s Conjecture and Testing Linear Invariant Properties (Q4933388) (← links)
• A unified framework for testing linear‐invariant properties (Q4982614) (← links)
• (Q5009536) (← links)
• Testing Linear-Invariant Properties (Q5096106) (← links)
• Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
• A removal lemma for linear configurations in subsets of the circle (Q5397387) (← links)
• (Q5743465) (← links)
• The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
• Removal lemmas and approximate homomorphisms (Q5886340) (← links)
• Counting configuration-free sets in groups (Q5890919) (← links)
• Counting configuration-free sets in groups (Q5920085) (← links)
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) (Q6041804) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)