Bootstrapping partition regularity of linear systems

Abstract: Suppose that

A

is a

k i m e s d

matrix of integers and write

m a t h f r a k R_{A} : m a t h b b N i g h t a r r o w m a t h b b N c u p i n f t y

for the function taking

r

to the largest

N

such that there is an

r

-colouring

m a t h c a l C

of

[N]

with

. We show that if

m a t h f r a k R_{A} (r) < i n f t y

for all

r i n m a t h b b N

then

m a t h f r a k R_{A} (r) l e q e x p (e x p (r^{O_{A} (1)}))

for all

r g e q 2

. When the kernel of

A

consists only of Brauer configurations -- that is vectors of the form

(y, x, x + y, d o t s, x + (d - 2) y)

-- the above has been proved by Chapman and Prendiville with good bounds on the

O_{A} (1)

term.

Recommendations

Cites Work

Cited In (1)

This page was built for publication: Bootstrapping partition regularity of linear systems