Date of Degree


Document Type


Degree Name





Melvyn Nathanson

Subject Categories



Eulerian; Hyperbinary; Integer Partitions; Number Theory; Partitions; Stern


The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with a family of identities which can be deduced by iterating a recurrence satisfied by $p_b(n)$ in a suitable way. These identities can then be used to calculate $p_b(n)$ for large values of $n$.

The second chapter restricts these types of partitions even further, limiting the multiplicity of each part. Its object of study is $p_{b,d}(n)$, that is, the number of partitions of $n$ into powers of $b$ repeating each power at most $d$ times. The methods of the first chapter are applied, and the self-similarity of these sequences is discussed in detail.

The third chapter focuses on $p_{A,M}(n)$, the number of partitions of $n$ with parts in $A$ and multiplicities in $M$. A construction of Alon which produces infinite sets $A$ and $M$ so that $p_{A,M}(n) = 1$ is generalized so that $A$ can be chosen to be a subset of powers of a given base.

fms.json (1223 kB)

Included in

Mathematics Commons



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.