Combinatorial Structures on van der Waerden sets. (9th January 2015)

• Record Type: Journal Article
• Authors: TYROS, KONSTANTINOS
• Is Part Of: Combinatorics, probability and computing. Volume 24:Number 6(2015:Nov.)
• Page Start: 929
• Page End: 953
• Publication Date: 2015-01-09
• Subjects: 05D10; Combinatorial analysis -- Periodicals; Probabilities -- Periodicals; Computer science -- Mathematics -- Periodicals; 511.6
• DOI: 10.1017/S0963548314000868
• Languages: English
• ISSNs: 0963-5483

Abstract

Abstract : In this paper we provide two results. The first one consists of an infinitary version of the Furstenberg–Weiss theorem. More precisely we show that every subset A of a homogeneous tree T such that $\frac{|A\cap T(n)|}{|T(n)|}\geqslant\delta, $ where T ( n ) denotes the n th level of T, for all n in a van der Waerden set, for some positive real δ, contains a strong subtree having a level set which forms a van der Waerden set. The second result is the following. For every sequence ( mq ) q ∈ℕ of positive integers and for every real 0 < δ ⩽ 1, there exists a sequence ( nq ) q ∈ℕ of positive integers such that for every D ⊆ ∪ k ∏ q =0 k-1 [ nq ] satisfying $\frac{\big|D\cap \prod_{q=0}^{k-1} [n_q]\big|s}{\prod_{q=0}^{k-1}n_q}\geqslant\delta$ for every k in a van der Waerden set, there is a sequence ( Jq ) q ∈ℕ, where Jq is an arithmetic progression of length mq contained in [ nq ] for all q, such that ∏ q =0 k-1 Jq ⊆ D for every k in a van der Waerden set. Moreover, working in an abstract setting, we may require Jq to be any configuration of natural numbers that can be found in an arbitrary set of positive density.