On the combinatorics of lecture hall partitions

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A lecture hall partition of length n is an integer sequence λ = (λ1,..., λn) satisfying 0 ≤ λ1/1 ≤ λ2/2 ≤ ... ≤ λn/n. (1) Bousquet-Mélou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.

Original languageEnglish (US)
Pages (from-to)247-262
Number of pages16
JournalRamanujan Journal
Volume5
Issue number3
DOIs
StatePublished - Sep 1 2001

Fingerprint

Bijection
Combinatorics
Partition
Integer Sequences
Odd
Integer

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory

Cite this

@article{f78c27b4272a44a3a8a907d192051809,
title = "On the combinatorics of lecture hall partitions",
abstract = "A lecture hall partition of length n is an integer sequence λ = (λ1,..., λn) satisfying 0 ≤ λ1/1 ≤ λ2/2 ≤ ... ≤ λn/n. (1) Bousquet-M{\'e}lou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-M{\'e}lou and Eriksson.",
author = "Yee, {Ae Ja}",
year = "2001",
month = "9",
day = "1",
doi = "10.1023/A:1012918510262",
language = "English (US)",
volume = "5",
pages = "247--262",
journal = "Ramanujan Journal",
issn = "1382-4090",
publisher = "Springer Netherlands",
number = "3",

}

On the combinatorics of lecture hall partitions. / Yee, Ae Ja.

In: Ramanujan Journal, Vol. 5, No. 3, 01.09.2001, p. 247-262.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On the combinatorics of lecture hall partitions

AU - Yee, Ae Ja

PY - 2001/9/1

Y1 - 2001/9/1

N2 - A lecture hall partition of length n is an integer sequence λ = (λ1,..., λn) satisfying 0 ≤ λ1/1 ≤ λ2/2 ≤ ... ≤ λn/n. (1) Bousquet-Mélou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.

AB - A lecture hall partition of length n is an integer sequence λ = (λ1,..., λn) satisfying 0 ≤ λ1/1 ≤ λ2/2 ≤ ... ≤ λn/n. (1) Bousquet-Mélou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.

UR - http://www.scopus.com/inward/record.url?scp=0035729473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035729473&partnerID=8YFLogxK

U2 - 10.1023/A:1012918510262

DO - 10.1023/A:1012918510262

M3 - Article

AN - SCOPUS:0035729473

VL - 5

SP - 247

EP - 262

JO - Ramanujan Journal

JF - Ramanujan Journal

SN - 1382-4090

IS - 3

ER -