Measurable events indexed by words

DOI10.1016/J.JCTA.2014.06.003zbMATH Open1297.05027arXiv1303.5001OpenAlexW2963310290MaRDI QIDQ406572FDOQ406572

Authors: Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros 

Publication date: 8 September 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: For every integer $kgeq2$ let $[k{]}^{<mathbbN}$ be the set of all words over $k$, that is, all finite sequences having values in $[k]:=1,\mathrm{...},k$. A Carlson-Simpson tree of $[k{]}^{<mathbbN}$ of dimension $mgeq1$ is a subset of $[k{]}^{<mathbbN}$ of the form [ {w}cup �ig{w^{smallfrown}w_0(a_0)^{smallfrown}...^{smallfrown}w_{n}(a_n): nin {0,...,m-1} ext{ and } a_0,...,a_nin [k]�ig} ] where $w$ is a word over $k$ and $(w_n{)}_{n=0}^{m-1}$ is a finite sequence of left variable words over $k$. We study the behavior of a family of measurable events in a probability space indexed by the elements of a Carlson-Simpson tree of sufficiently large dimension. Specifically we show the following. For every integer $kgeq2$, every $0<varepsilonleq1$ and every integer $ngeq1$ there exists a strictly positive constant $heta(k,varepsilon,n)$ with the following property. If $m$ is a given positive integer, then there exists an integer $mathrmCor(k,varepsilon,m)$ such that for every Carlson--Simpson tree $T$ of $[k{]}^{<mathbbN}$ of dimension at least $mathrmCor(k,varepsilon,m)$ and every family $A_t:tinT$ of measurable events in a probability space $(Omega,Sigma,mu)$ satisfying $mu(A_t)geqvarepsilon$ for every $tinT$, there exists a Carlson--Simpson tree $S$ of dimension $m$ with $SsubseteqT$ and such that for every nonempty $FsubseteqS$ we have [muBig(�igcap_{tin F} A_tBig) geq heta(k,varepsilon,|F|). ] The proof is based, among others, on the density version of the Carlson--Simpson Theorem established recently by the authors, as well as, on a partition result -- of independent interest -- closely related to the work of T. J. Carlson, and H. Furstenberg and Y. Katznelson. The argument is effective and yields explicit lower bounds for the constants $heta(k,varepsilon,n)$.

Full work available at URL: https://arxiv.org/abs/1303.5001

Recommendations

• Measurable events indexed by trees
• Measurable events indexed by products of trees
• A density version of the Carlson-Simpson theorem
• How much are increasing sets positively correlated?
• Large correlated families of positive random variables

zbMATH Keywords

independencewordsCarlson-Simpson trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Partitions of sets (05A18) Other combinatorial set theory (03E05)

Cites Work

• Title not available (Why is that?)
• Regularity and Positional Games
• A dual form of Ramsey's theorem
• Some unifying principles in Ramsey theory
• Primitive Recursive Bounds for Van Der Waerden Numbers
• A density version of the Carlson-Simpson theorem
• A density version of the Hales-Jewett theorem
• Elemental methods in ergodic Ramsey theory
• Ramsey's Theorem for n-Parameter Sets
• A Partition Theorem For Perfect Sets
• Measurable events indexed by trees
• Partition Theorems for Spaces of Variable Words
• One sided ideals and Carlson’s Theorem
• Markov Processes and Ramsey Theory for Trees
• Measurable events indexed by products of trees
• Title not available (Why is that?)
• Idempotents in compact semigroups and Ramsey theory

Cited In (1)

• A structure theorem for stochastic processes indexed by the discrete hypercube

This page was built for publication: Measurable events indexed by words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406572)