Coloring the square (Frederic van der Plancke)	Discuss about this problem
Given n, let S2:={1..n}2 , let d2 = euclidian distance on S2, let m=ceil(n(2/3)) , let S3:={1..m}3 and let d3 be a metric (Euclidean?) on S3 find f:S2-->S3 injective (i.e. p<>q => f(p)<>f(q)) such that : SUM [over all (p,q) in S22 such that d(p,q) = 1] d(f(p),f(q)) is minimal Please send us a simpler description.