The All-Thing

All stick and no carrot, since ought-three.




| web page

Other views:
RSS 1.0
RSS 0.91
Plain (good for lynx)

Past posts:

Sun Mon Tue Wed Thu Fri Sat
20 21 22 23 24
25 26 27 28 29 30 31

Recent comments:
Re: Re: Gateway ECDT by William
Re: Gateway ECDT by Greg
Re: Re: Linux Media Jukebox/PVR by William
Re: Linux Media Jukebox/PVR by fiona!

Recent search referers:
bit torrent hip-hop clipse
bizarre flem
chinese bittorrent
pr0n torrent
"burrows wheeler transform"
bittorrent pr0n (x2)
hot to spell thing in chinese
"Gateway 200x" review burner
torrent pr0n (x2)
Expert Judgement on Markers to Deter Inadvertent Human Intrusion into the Waste Isolation Pilot Plant
seven samurai torrent
dueling banjos sheet music
download XIII crack (x2)
xiii torrent
no cd XIII (x2)
Torrent xbox

William's Aggregated Feeds

Creative Commons License
This work is licensed under a Creative Commons License.


Thu, 09 Oct 2003
Whitney Numbers

This was cool. I've been working on a problem at work and at one point we needed to find the maximum number of ways of dividing an /n/-dimensional space into k partitions. It's easy enough to figure this out for the one- and two-dimensional case, and pretty mind-bending for the three-dimensional case, but what about the generalization?

So we go to the Online Encyclopedia of Integer Sequences, type in (get this) 2, 4, 8 (the first three entries for the 3-d case) and lo and behold, we get:

Cool or what? (A complete fluke as their sequence is the table read by anti-diagonals... wtf?)

So anyways, the solution is

W(n,k)=if k=0 or n=0 then 1 else W(n,k-1)+W(n-1,k-1), or
W(n,k)=Sum(binomial(k,i), i=0..n)

if you were curious (so order exponential, unfortunately for us).

Posted at 13:38 | trackback | (leave a comment) | back


Your Comment

URL/Email: [http://... or mailto:you@wherever] (optional)
Title: (optional)
Save my Name and URL/Email for next time