On the number of hypercubic bipartitions of an integer

Details On the number of hypercubic bipartitions of an integer On the number of hypercubic bipartitions of an integer

2011-06-24

arxiv.org/abs/1106.4997v1

Mathematics

Combinatorics

13 pages

Scientific paper

We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \max(\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs $(n_1,n_2)$ summing to $n$ that yield the maximum $f(n) = \min(n_1,n_2) + f(n_1) + f(n_2)$. This new characterization allows us, for a given $n\in\nats$, to determine the number $h(n)$ of these bipartitions that yield the said maximum $f(n)$. We present recursive formulae for $h(n)$, a generating function $h(x)$, and an explicit formula for $h(n)$ in terms of a special representation of $n$.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394250