Name
Abstract | ||
|---|---|---|
For every integer k⩾2 let [k]<N be the set of all words over k. A Carlson–Simpson tree of [k]<N of dimension m⩾1 is a subset of [k]<N of the form{w}∪{w⌢w0(a0)⌢…⌢wn(an):n∈{0,…,m−1}and a0,…,an∈[k]} where w is a word over k and (wn)n=0m−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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.jcta.2014.06.003 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Words,Carlson–Simpson trees,Independence | Integer,Discrete mathematics,Combinatorics,Finite sequence,Probability space,Measure (mathematics),Omega,Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
127 | 127 | 0097-3165 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pandelis Dodos | 1 | 5 | 2.33 |
| V. Kanellopoulos | 2 | 7 | 2.66 |
| Konstantinos Tyros | 3 | 6 | 2.63 |