Combinatorial Structures on van der Waerden sets

preprint2013arXivOpen access

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 AA of a homogeneous tree TT such that ∣A∩T(n)∣∣T(n)∣≥δ\frac{|A\cap T(n)|}{|T(n)|}\geqδ, where T(n) denotes the nn-th level of TT, for all nn in a van der Waerden set, for some positive real δδ, contains a strong subtree having a level sets which forms a van der Waerden set. The second result is the following. For every sequence (mq)q(m_q)_{q} of positive integers and for every real 0<δleq10<δ\\leq1, there exists a sequence (nq)q(n_q)_{q} of positive integers such that for every D⊆⋃k∏q=0k−1[nq]D\subseteq \bigcup_k\prod_{q=0}^{k-1}[n_q] satisfying $$\frac{\big{|}D\cap \prod_{q=0}^{k-1} [n_q]\big{|}}{\prod_{q=0}^{k-1}n_q}\geqδ$$ for every kk in a van der Waerden set, there is a sequence (Jq)q(J_q)_{q}, where JqJ_q is an arithmetic progression of length mqm_q contained in [nq][n_q] for all qq, such that ∏q=0k−1Jq⊆D\prod_{q=0}^{k-1}J_q\subseteq D for every kk in a van der Waerden set. Moreover, working in an abstract setting, we obtain JqJ_q to be any configuration of natural numbers that can be found in an arbitrary set of positive density.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.