Graphical partitions

We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n 900.A partition of weight n is a nonincreasing sequence of nonnegative integers (1, 2, . . . , k, . . .) whose sum is n. The weight is denoted by ||. The number of nonzero elements in the sequence is the length of the partition denoted by l(). The set of all partitions of weight n is denoted by P(n).

17p thulanh5 12-09-2011 53 4   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: A Recurrence for Counting Graphical Partitions...

10p thulanh3 10-09-2011 50 5   Download