A note on plane partition diamonds
Mircea Cimpoeas, Alexandra Teodor
Abstract
We prove new formulas for $\operatorname{DD}_k(n)$, the number of plane partition diamonds of length $k$ of $n$, and, also, for its polynomial part.
Mircea Cimpoeas, Alexandra Teodor
We prove new formulas for $\operatorname{DD}_k(n)$, the number of plane partition diamonds of length $k$ of $n$, and, also, for its polynomial part.
This paper contains 5 sections, 14 theorems, 58 equations.
Proposition 2.1
(Bell bell) $p_{\mathbf a}(n)$ is a quasi-polynomial of degree $r-1$, with the period $D$, i.e. where $d_{\mathbf a,m}(n+D)=d_{\mathbf a,m}(n)$ for $0\leq m\leq k-1$ and $n\geq 0$, and $d_{\mathbf a,k-1}(n)$ is not identically zero.