Multidimensional necklaces and measurable colorings of R^n

Details Multidimensional necklaces and measurable colorings of R^n Multidimensional necklaces and measurable colorings of R^n

2011-11-15

arxiv.org/abs/1111.3519v2

Mathematics

Combinatorics

Scientific paper

A well known generalization of Alon's "splitting nacklace theorem" by Longueville and Zivaljevic states that every k-colored n-dimensional cube can be fairly split using only k cuts in each dimension. Here we prove that for every t there exist a finite coloring (with at least (t+4)^d - (t+3)^d + (t+2)^d - 2^d + d(t+2) +3 different colors) of R^n such that no n-dimensional cube can be fairly split using at most t cuts in each dimension. In particular there is a finite coloring of R^n such that no two disjoint n-dimensional cubes have the same measure of each color.

Affiliated with

Also associated with

No associations

Rating

Multidimensional necklaces and measurable colorings of R^n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multidimensional necklaces and measurable colorings of R^n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multidimensional necklaces and measurable colorings of R^n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709259