Pages that link to "Item:Q1024351"

The following pages link to A combinatorial proof of the removal lemma for groups (Q1024351):

Displaying 8 items.

• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
• A quantitative version of the non-Abelian idempotent theorem (Q633235) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime (Q653939) (← links)
• A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces (Q1671780) (← links)
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces (Q1673988) (← links)
• A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
• Counting configuration-free sets in groups (Q5890919) (← links)