On Balanced Colorings of the n-Cube

Details On Balanced Colorings of the n-Cube On Balanced Colorings of the n-Cube

2009-10-06

arxiv.org/abs/0910.0903v1

Mathematics

Combinatorics

10 pages

Scientific paper

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center. Let $B_{n,2k}$ be the number of balanced 2-colorings of the n-cube with 2k vertices having weight 1. Palmer, Read and Robinson conjectured that for $n\geq 1$, the sequence $\{B_{n,2k}\}_{k=0, 1 ... 2^{n-1}}$ is symmetric and unimodal. We give a proof of this conjecture. We also propose a conjecture on the log-concavity of $B_{n,2k}$ for fixed k, and by probabilistic method we show that it holds when n is sufficiently large.

Affiliated with

Also associated with

No associations

Rating

On Balanced Colorings of the n-Cube 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 On Balanced Colorings of the n-Cube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Balanced Colorings of the n-Cube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357306