Difference sets in Quadratic Density Hales Jewett conjecture with 2 letters

Abstract: The Quadratic Density Hales Jewett conjecture with

2

letters states that for large enough

n

, every dense subset of

{0, 1}^{n^{2}}

contains a combinatorial line where the wildcard set is of the form

g a m m a i m e s g a m m a

where

g a m m a s u b s e t 1, 2, d o t s n

. We show in an elementary way that every dense subset of

{0, 1}^{n^{2}}

for sufficiently large

n

contains two elements whose difference set is of the type

g a m m a_{1} i m e s g a m m a_{2}

where

g a m m a_{1}, g a m m a_{2}

are both nonempty subsets of

1, 2, d o t s n

. Further we give examples of dense subspaces of

{0, 1}^{n^{2}}

, for any

n

, such that the wildcard set of the combinatorial lines obtained only take the form

g a m m a i m e s g a m m a

with

| g a m m a | = 4 k

for some integer

k > 0

.

This page was built for publication: Difference sets in Quadratic Density Hales Jewett conjecture with 2 letters