"Partitions into Powers of Primes" by Ayla Gafni
 

Document Type

Lecture

Publication Date

9-18-2020

Abstract

Given a set �� ⊆ ℕ, the restricted partition function p��(n) counts the number of integer partitions of n with all parts in A. In this talk, we will explore the features of the restricted partitions function pℙk(n), where ℙk is the set of k-th powers of primes (ℙ). Powers of primes are both sparse and irregular, which makes pℙk(n) quite an elusive function to understand. We will discuss some of the challenges involved in studying restricted partition functions and what is known in the case of primes, k-th powers, and k-th powers of primes.

Relational Format

presentation

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.