English

Combinatorial Structures on van der Waerden sets

Combinatorics 2015-09-30 v2

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 AT(n)T(n)δ\frac{|A\cap T(n)|}{|T(n)|}\geq\delta, where T(n) denotes the nn-th level of TT, for all nn in a van der Waerden set, for some positive real δ\delta, 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<\delta\\leq1, there exists a sequence (nq)q(n_q)_{q} of positive integers such that for every Dkq=0k1[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\delta 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=0k1JqD\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.

Keywords

Cite

@article{arxiv.1301.4297,
  title  = {Combinatorial Structures on van der Waerden sets},
  author = {Konstantinos Tyros},
  journal= {arXiv preprint arXiv:1301.4297},
  year   = {2015}
}

Comments

24 pages

R2 v1 2026-06-21T23:11:36.623Z