The following expression arises in the study of hierarchical models. I suspect that the sum of the underlined $4$ terms become constant as $\alpha\rightarrow \infty$. Mathematica agrees when prompted with 'toy' versions, but I'm having some difficulty seeing how it generalizes.

I would greatly appreciate any help or observations.

\begin{align}
\log \text{P}\propto
\underbrace{
\log \Gamma(k \alpha)
- \log \Gamma(k\alpha + length(\ell)) -
k \log \Gamma(\alpha) + \sum^k_{i=1} \log \Gamma(c_{i} + \alpha)} \ + \ f(\text{other parameters})
\end{align}
**Where:** $\ell$ is a list of items; Each item in $\ell$ must be assigned to exactly one bin, so $c_{i}$ is the count of items in $\ell$ assigned to bin $i$, and there are a total of $k$ bins.

Current thinking: It is well known that as $\alpha\rightarrow \infty$, the argument of the sum in the rightmost term $\log \Gamma(c_{i}+a)$ increases only linearly in its arguments rather than superlinearly. This is because $\displaystyle \lim_{\alpha\rightarrow\infty} \big(\frac{\partial^2}{\partial\alpha^2}\log \Gamma(c_{i} + \alpha)\big) = \lim_{\alpha\rightarrow\infty} \big(\frac{\partial^2}{\partial c_{i}^2}\log \Gamma(c_{i} + \alpha)\big) = \displaystyle \lim_{\alpha\rightarrow\infty} \big(\frac{\partial}{\partial c_{\ell,i}}\Psi(c_{i} + \alpha)\big)=0$, where $\Psi$ is the Digamma function. Therefore any partition of $\ell$ (i.e. any choices of the different $c_{i}$) will cause this term to sum to the same constant.

The other terms are all constant for fixed $\alpha$, $\ell$, and $k$.