Splitting multidimensional necklaces

Details Splitting multidimensional necklaces Splitting multidimensional necklaces

2006-10-26

arxiv.org/abs/math/0610800v1

Mathematics

Combinatorics

Scientific paper

The well-known "splitting necklace theorem" of Noga Alon says that each "necklace" having beads of n different colors can be fairly divided between k "thieves" by at most n(k-1) cuts. We demonstrate that Alon's result is a special case of a multidimensional, consensus division theorem for n continuous probability measures on a d-cube [0,1]^d. The dissection is performed by m_1+...+ m_d=n(k-1) hyperplanes parallel to the sides of [0,1]^d dividing the cube into m_1 x m_2 x ... x m_d elementary parallelepipeds where the integers m_i are prescribed in advance.

Affiliated with

Also associated with

No associations

Rating

Splitting multidimensional necklaces 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 Splitting multidimensional necklaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Splitting multidimensional necklaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114651