Euler's partition theorem and the combinatorics of -sequences
Euler's partition theorem and the combinatorics of -sequences
Euler's partition theorem and the combinatorics of -sequences
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Let {a n } = {a (l)<br />
n }.<br />
The l-Lecture Hall Theorem [BME2]: The generating function<br />
for integer <strong>sequences</strong> λ 1 , λ 2 , . . . , λ n satisfying:<br />
L (l)<br />
n :<br />
λ 1<br />
a n<br />
≥ λ 2<br />
a n−1<br />
≥ . . . ≥ λ n−1<br />
a 2<br />
≥ λ n<br />
a 1<br />
≥ 0<br />
is<br />
L (l)<br />
n (q) =<br />
n∏<br />
i=1<br />
1<br />
(1 − q a i−1 +a i )<br />
lim n→∞ (l-Lecture Hall Theorem) = l-Euler Theorem<br />
since as n → ∞,<br />
a n /a n−1 → c l