Brad Wilson

Sorry, we do not have enough data to show an influence graph for this author.
Learn More
Euler proved the following recurrence for p(n), the number of partitions of an integer n : (1) p(n) + ∞ X k=1 (−1) k (p(n − ω(k)) + p(n − ω(−k))) = 0 for ω(k) = 3k 2 +k 2. Using the Jacobi Triple Product identity we show analogues of Euler's recurrence formula for common restricted partition functions. Moreover following Kolberg, these recurrences allow us(More)
  • 1