5 research outputs found

    Symmetries and Ramsey properties of trees

    Get PDF
    AbstractIn this paper we show the extent to which a finite tree of fixed height is a Ramsey object in the class of trees of the same height can be measured by its symmetry group

    Operators on the Stopping Time Space

    Full text link
    Let S1S^1 be the stopping time space and B1(S1)\mathcal{B}_1(S^1) be the Baire-1 elements of the second dual of S1S^1. To each element xx^{**} in the space B1(S1)\mathcal{B}_1(S^1) we associate a positive Borel measure μx\mu_{x^{**}} on the Cantor set. We use the measures {μx:xB1(S1)}\{\mu_{x^{**}}: x^{**}\in\mathcal{B}_1(S^1) \} to characterize the operators T:XS1T:X\to S^1, defined on a space XX with an unconditional basis, which preserve a copy of S1S^1. In particular, we show that TT preserves a copy of S1S^1 if and only if the set {μx:  xB1(S1)}\{\mu_{x^{**}}:\;x^{**}\in\mathcal{B}_1(S^1)\} is non separable as a subset of M(2N)\mathcal{M}(2^\mathbb{N}).Comment: 19 page

    Dense subsets of products of finite trees

    Full text link
    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\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).Comment: 36 pages, no figures; International Mathematics Research Notices, to appea

    A density version of the Carlson--Simpson theorem

    Full text link
    We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer k2k\geq 2 and every set AA of words over kk satisfying lim supnA[k]nkn>0\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0 there exist a word cc over kk and a sequence (wn)(w_n) of left variable words over kk such that the set {c}{cw0(a0)...wn(an):nN  and  a0,...,an[k]}\{c\}\cup \big\{c^{\smallfrown}w_0(a_0)^{\smallfrown}...^{\smallfrown}w_n(a_n) : n\in\mathbb{N} \ \text{ and } \ a_0,...,a_n\in [k]\big\} is contained in AA. While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.Comment: 73 pages, no figure
    corecore