Is there a positive integer n ≥ 2 and words u
1, u
2, ..., u
n such that both equalities
(u
1u
2 ⋅⋅⋅ u
n)
2 = u
12u
22 ⋅⋅⋅ u
n2,
(u
1u
2 ⋅⋅⋅ u
n)
3 = u
13u
23⋅⋅⋅ u
n3
hold simultaneously and the words u
i, i = 1, ..., n, do not pairwise commute (that is, u
iu
j ≠ u
ju
i for at least one pair of indices i,j∈{1,2,...,n })?
For the solution an award of 200€ (
100 € upped during WORDS 2011 in Prague) is promised.
Details here.
Recently, the problem has been solved by Aleksi Saarela.
--
StepanHolub - 01 Aug 2011