Papers
Topics
Authors
Recent
Search
2000 character limit reached

Partitions into a small number of part sizes

Published 2 Feb 2015 in math.CO | (1502.00366v4)

Abstract: We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0 \pmod{4}$ for (A,B) = (36,30), (72,42), (252,114), (196,70), and likely many other progressions for which our method should easily generalize. Of some independent interest, we prove that the overpartition function $\bar{p}(n) \equiv 0 \pmod{16}$ in the first three progressions (the fourth is known), and thereby show that $\nu_3(An+B) \equiv 0 \pmod{2}$ in each of these progressions as well, and discuss the relationship between these congruences in more generality. We end with open questions in this area.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.