Theorem 1.5.
Assuming that:
ℕ
(
r
)
abitrarily coloured
Then
we can find an infinite set
M
and
I
⊆
[
r
]
such that for any
x
1
<
x
2
<
⋯
<
x
r
in
M
, and
y
1
<
y
2
<
⋯
<
y
r
in
M
we have
c
(
x
1
x
2
⋯
x
r
)
=
c
(
y
1
y
2
⋯
y
r
)
if and only if
x
i
=
y
i
for all
i
∈
I
.