Combinatorial Structures on van der Waerden sets

DOI10.1017/S0963548314000868MaRDI QIDQ5364262zbMATH OpenOpenAlexFDO

Publication date 4 October 2017

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.4297

Abstract: In this paper we provide two results. The first one consists an infinitary version of the Furstenberg-Weiss Theorem. More precisely we show that every subset

A

of a homogeneous tree

T

such that

f r a c | A c a p T (n) | | T (n) | g e q d e l t a

, where T(n) denotes the

n

-th level of

T

, for all

n

in a van der Waerden set, for some positive real

d e l t a

, contains a strong subtree having a level sets which forms a van der Waerden set. The second result is the following. For every sequence

(m_{q})_{q}

of positive integers and for every real

0 < d e l t a \leq 1

, there exists a sequence

(n_{q})_{q}

of positive integers such that for every

satisfying

frac{�ig{|}Dcap prod_{q=0}^{k-1} [n_q]�ig{|}}{prod_{q=0}^{k-1}n_q}geqdelta

for every

k

in a van der Waerden set, there is a sequence

(J_{q})_{q}

, where

J_{q}

is an arithmetic progression of length

m_{q}

contained in

[n_{q}]

for all

q

, such that

p r o d_{q = 0}^{k - 1} J_{q} s u b s e t e q D

for every

k

in a van der Waerden set. Moreover, working in an abstract setting, we obtain

J_{q}

to be any configuration of natural numbers that can be found in an arbitrary set of positive density.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Combinatorial Structures on van der Waerden sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364262)