Researchers find fractal structure to partition function

Researchers from Emory University, the University of Wisconsin Madison, Yale, and the Technical University of Darmstadt in Germany have discovered that partition numbers behave like fractals, possessing an infinitely-repeating structure.

The partition number P(N) of an integer N is the number of distinct ways in which N can be written as a sum of positive integers. For instance, 6 = 6, 5+1, 4+2, 4+1+1, 3+3, 3+2+1, 3+1+1+1, 2+2+2, 2+2+1+1, 2+1+1+1+1, and 1+1+1+1+1+1, so that P(6) = 11. P(N) grows very rapidly with N. For instance, P(100) = 190,569,292.

Partition numbers have captured the imagination of mathematicians since the time of

Continue reading Researchers find fractal structure to partition function

IBM’s Watson Defeats Jeopardy champs in trial round

As we mentioned in an earlier Blog, the US television show Jeopardy! has agreed to host a showdown between a new question-answering computer system developed by IBM and two former Jeopardy! champions. The new system, named “Watson” by IBM, accepts input in the form of natural English inquiries, and then responds with its best determination of the answer. For the Jeopardy! contest, of course, the roles of “question” and “answer” are reversed.

In a practice round conducted on 13 Jan 2011 at IBM’s Yorktown Heights Research Center, Watson defeated its human challengers (former Jeopardy! champions Ken Jennings and Brad

Continue reading IBM’s Watson Defeats Jeopardy champs in trial round