Learn More
A lecture hall partition of length n is a sequence (λ1, λ2, . . . , λn) of nonnegative integers satisfying 0 ≤ λ1/1 ≤ · · · ≤ λn/n. M. Bousquet-Mélou and K. Eriksson showed that there is an one to(More)