Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T11:18:11.747Z Has data issue: false hasContentIssue false

Bootstrapping partition regularity of linear systems

Published online by Cambridge University Press:  09 March 2020

Tom Sanders*
Affiliation:
Mathematical Institute, University of Oxford, Radcliffe Observatory Quarter, Woodstock Road, OxfordOX2 6GG, UK (tom.sanders@maths.ox.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Suppose that A is a k × d matrix of integers and write $\Re _A:{\mathbb N}\to {\mathbb N}\cup \{ \infty \} $ for the function taking r to the largest N such that there is an r-colouring $\mathcal {C}$ of [N] with $\bigcup _{C \in \mathcal {C}}{C^d}\cap \ker A =\emptyset $. We show that if ℜA(r) < ∞ for all $r\in {\mathbb N}$ then $\mathfrak {R}_A(r) \leqslant \exp (\exp (r^{O_{A}(1)}))$ for all r ⩾ 2. When the kernel of A consists only of Brauer configurations – that is, vectors of the form (y, x, x + y, …, x + (d − 2)y) – the above statement has been proved by Chapman and Prendiville with good bounds on the OA(1) term.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 2020