A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Given a sequence of numbers ͕a n ͖, it is always possible to find a set of Feynman rules that reproduce that sequence. For the special case of the partitions of the integers, the appropriate Feynman rules give rise to graphs that represent the partitions in a clear pictorial fashion. These Feynman rules can be used to generate the Bell numbers B(n) and the Stirling numbers S(n,k) that are associated with the partitions of the integers.doi:10.1063/1.532883 fatcat:aosvcdyimrdyfmgyxsvzvewe6u