English

Dense subsets of products of finite trees

Combinatorics 2013-03-20 v2

Abstract

We prove a "uniform" version of the finite density Halpern-L\"{a}uchli Theorem. Specifically, we say that a tree TT is homogeneous if it is uniquely rooted and there is an integer b2b\geq 2, called the branching number of TT, such that every tTt\in T has exactly bb immediate successors. We show the following. For every integer d1d\geq 1, every b1,...,bdNb_1,...,b_d\in\mathbb{N} with bi2b_i\geq 2 for all i{1,...,d}i\in\{1,...,d\}, every integer k\meg1k\meg 1 and every real 0<ϵ10<\epsilon\leq 1 there exists an integer NN with the following property. If (T1,...,Td)(T_1,...,T_d) are homogeneous trees such that the branching number of TiT_i is bib_i for all i{1,...,d}i\in\{1,...,d\}, LL is a finite subset of N\mathbb{N} of cardinality at least NN and DD is a subset of the level product of (T1,...,Td)(T_1,...,T_d) satisfying D(T1(n)×...×Td(n))ϵT1(n)×...×Td(n)|D\cap \big(T_1(n)\times ...\times T_d(n)\big)| \geq \epsilon |T_1(n)\times ...\times T_d(n)| for every nLn\in L, then there exist strong subtrees (S1,...,Sd)(S_1,...,S_d) of (T1,...,Td)(T_1,...,T_d) of height kk and with common level set such that the level product of (S1,...,Sd)(S_1,...,S_d) is contained in DD. The least integer NN with this property will be denoted by UDHL(b1,...,bdk,ϵ)UDHL(b_1,...,b_d|k,\epsilon). The main point is that the result is independent of the position of the finite set LL. The proof is based on a density increment strategy and gives explicit upper bounds for the numbers UDHL(b1,...,bdk,ϵ)UDHL(b_1,...,b_d|k,\epsilon).

Keywords

Cite

@article{arxiv.1105.2419,
  title  = {Dense subsets of products of finite trees},
  author = {Pandelis Dodos and Vassilis Kanellopoulos and Konstantinos Tyros},
  journal= {arXiv preprint arXiv:1105.2419},
  year   = {2013}
}

Comments

36 pages, no figures; International Mathematics Research Notices, to appear