The Symmetry Preserving Removal Lemma
| dc.creator | Szegedy, Balazs | |
| dc.date | 2008-09-15 | |
| dc.date.accessioned | 2026-07-07T10:03:13Z | |
| dc.date.available | 2026-07-07T10:03:13Z | |
| dc.description | In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemerédi's Theorem on arithmetic progressions. If in an Abelian group $A$ there are sets $S_1,S_2...,S_t$ such that the number of arithmetic progressions $x_1,x_2,...,x_t$ with $x_i\in S_i$ is $o(|A|^2)$ then we can shrink each $S_i$ by $o(|A|)$ elements such that the new sets don't have such a diagonal arithmetic progression. | |
| dc.identifier | https://arxiv.org/abs/0809.2626 | |
| dc.identifier | http://arxiv.org/abs/0809.2626 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169204 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.title | The Symmetry Preserving Removal Lemma | |
| dc.type | text |