1
$\begingroup$

This question is a variant of the question posed by Brian Hopkins.

Let $\operatorname{pdist}(n)$ be the number of partitions of $n$ into distinct parts. Also, let $\operatorname{pdist}(S, n)$ denote the number of partitions of $n$ into distinct parts, all of which come from the set $S$. (Here again we take $S$ to be some subset of $[n]= \{ 1, 2, ... , n \}$. )

Is it true that for every $t$ from $0$ to $\operatorname{pdist}(n)$, we can find a set $S$ such that $\operatorname{pdist} ( S, n) = t$ ?

$\endgroup$
2
  • $\begingroup$ My question (based on another one of yours) is here. Have you seen if Bogdanov's solution there helps in the distinct part situation? $\endgroup$ Commented Sep 15, 2019 at 20:42
  • $\begingroup$ It seems that the argument works literally... $\endgroup$ Commented Sep 15, 2019 at 21:09

0

You must log in to answer this question.

Browse other questions tagged .