Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4655291 | Journal of Combinatorial Theory, Series A | 2014 | 48 Pages |
Abstract
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 θ(k,ε,n).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros,