Citations per year

20042007201020132016201
Abstract: (AIP)
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.
  • Feynman graph
  • graph theory
  • number theory
0 References