1
$\begingroup$

Given an integer $n$ the number of partitions of $n$ into two colors can be represented as $$p_2(n)=\sum_{k=0}^n p(k)p(n-k)$$ where $p(k)$ counts the number of ordinary partitions of $k.$ What is the distribution of $$P(k)=\frac{p(k)p(n-k)}{p_2(n)}$$ as $n\to \infty.$

I feel as though this question has probably been addressed in the past but I am unaware of where in the literature. Does anyone know where I can find this?

$\endgroup$
2
  • $\begingroup$ $P(k)$ is maximal for $k$ around $n/2$, of course, and is concentrated therein. Specify, what exactly asymptotical question are you interested in. $\endgroup$ May 3, 2013 at 22:53
  • $\begingroup$ I'm more interested in a sharp concentration inequality or for that matter a place where I can reference it. $\endgroup$ May 3, 2013 at 23:05

1 Answer 1

1
$\begingroup$

The Hardy-Ramanujan asymptotic formula gives $p(n) \sim \exp(C\sqrt{n})/(4n\sqrt{3})$ with $C= \pi \sqrt{2/3}$. From this one sees that if $\ell$ is not too big then $$ p(n+\ell)p(n-\ell) \sim p(n)^2 \exp(C (\sqrt{n+\ell}+\sqrt{n-\ell} -2\sqrt{n}) ) \sim p(n)^2 \exp\Big( -C \frac{\ell^2}{4n^{3/2}} \Big). $$

Thus your function is concentrated around $k=n/2$ in an interval of size about $n^{3/4}$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.