A note on plane partition diamonds
Abstract
We prove new formulas for DDk(n), the number of plane partition diamonds of length k of n, and, also, for its polynomial part.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.