Induced arithmetic removal for partition-regular patterns of complexity 1
arXiv:2412.15170 · doi:10.1016/j.jcta.2025.106126
Abstract
In 2019, Fox, Tidor and Zhao (arXiv:1911.03427) proved an induced arithmetic removal lemma for linear patterns of complexity 1 in vector spaces over a fixed finite field. With no further assumptions on the pattern, this induced removal lemma cannot guarantee a fully pattern-free recolouring of the space, as some `non-generic' instances must necessarily remain. On the other hand, Bhattacharyya et al. (arXiv:1212.3849) showed that in the case of translation-invariant patterns, it is possible to obtain recolourings that eliminate the given pattern completely, with no exceptions left behind. This paper demonstrates that such complete removal can be achieved for all partition-regular arithmetic patterns of complexity 1.
arXiv commentFinal journal version, with minor edits and fixed typos. Added alt-descriptions to images
References in corpus (6)
- The true complexity of a system of linear equations
- Linear forms and higher-degree uniformity for functions on
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- An Improved Lower Bound for Arithmetic Regularity
- Testing linear-invariant properties
- Induced arithmetic removal: complexity 1 patterns over finite fields