Paper detail

Dense subsets of products of finite trees

We prove a "uniform" version of the finite density Halpern-Läuchli Theorem. Specifically, we say that a tree $T$ is homogeneous if it is uniquely rooted and there is an integer $b\geq 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. We show the following. For every integer $d\geq 1$, every $b_1,...,b_d\in\mathbb{N}$ with $b_i\geq 2$ for all $i\in\{1,...,d\}$, every integer $k\meg 1$ and every real $0<ε\leq 1$ there exists an integer $N$ with the following property. If $(T_1,...,T_d)$ are homogeneous trees such that the branching number of $T_i$ is $b_i$ for all $i\in\{1,...,d\}$, $L$ is a finite subset of $\mathbb{N}$ of cardinality at least $N$ and $D$ is a subset of the level product of $(T_1,...,T_d)$ satisfying \[|D\cap \big(T_1(n)\times ...\times T_d(n)\big)| \geq ε|T_1(n)\times ...\times T_d(n)|\] for every $n\in L$, then there exist strong subtrees $(S_1,...,S_d)$ of $(T_1,...,T_d)$ of height $k$ and with common level set such that the level product of $(S_1,...,S_d)$ is contained in $D$. The least integer $N$ with this property will be denoted by $UDHL(b_1,...,b_d|k,ε)$. The main point is that the result is independent of the position of the finite set $L$. The proof is based on a density increment strategy and gives explicit upper bounds for the numbers $UDHL(b_1,...,b_d|k,ε)$.

preprint2012arXivOpen access

Signal facts

What is known right now

Open access3 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.

Dense subsets of products of finite trees | BZPEER | BZPEER