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
Overview 1, 2, 3, . . . l-sequences Euler’s partition theorem The l-Euler theorem Lecture hall partitions l-Lecture hall partitions
Overview 1, 2, 3, . . . l-sequences Euler’s partition theorem The l-Euler theorem Lecture hall partitions l-Lecture hall partitions Binomial coefficients l-nomial coefficients
- Page 1 and 2: Euler’s partition theorem and the
- Page 3 and 4: Overview Euler’s partition theore
- Page 5: Overview 1, 2, 3, . . . l-sequences
- Page 9 and 10: Sylvester’s Bijection
- Page 11 and 12: l-sequences For integer l ≥ 2, de
- Page 13 and 14: l-sequences For integer l ≥ 2, de
- Page 15 and 16: l = 2 The l-Euler theorem [BME2]: T
- Page 17 and 18: l = 3 The l-Euler theorem [BME2]: T
- Page 19: The insertion step To insert a k +
- Page 22 and 23: Binary numeration system 1 0 1 1 0
- Page 24 and 25: Binary numeration system 1 0 1 1 0
- Page 26: Theorem [Fraenkel 1985] Every nonne
- Page 31 and 32: Lecture Hall Partitions
- Page 33 and 34: The Lecture Hall Theorem [BME1] The
- Page 35 and 36: Θ (l) n : Bijection for the l-Lect
- Page 44 and 45: Truncated lecture hall partitions L
- Page 46 and 47: Theorem [Corteel,S 2004] Given posi
- Page 48 and 49: The l-nomial coefficient Example (
- Page 50 and 51: Let u l and v l be the roots of the
- Page 52 and 53: Let u l and v l be the roots of the
- Page 54 and 55: An l-nomial theorem [LS]: An analog
Overview<br />
1, 2, 3, . . .<br />
l-<strong>sequences</strong><br />
Euler’s <strong>partition</strong> <strong><strong>the</strong>orem</strong><br />
The l-Euler <strong><strong>the</strong>orem</strong><br />
Lecture hall <strong>partition</strong>s<br />
l-Lecture hall <strong>partition</strong>s<br />
Binomial coefficients<br />
l-nomial coefficients
Change language