{"paper":{"title":"On the removal lemma for linear configurations in finite abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Llu\\'is Vena","submitted_at":"2015-05-09T14:48:07Z","abstract_excerpt":"We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim that a system without many configurations can be made configuration-free by removing a few of its constituent elements. As applications of this approach we give, an alternative proof of the removal lemma for permutations by Cooper, a general version of a removal lemma for linear systems in finite abelian groups, an interpretation of the mentioned removal lemm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02280","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}