On the refined lecture hall theorem

Ae Ja Yee

doi:10.1016/S0012-365X(01)00352-1

On the refined lecture hall theorem

Ae Ja Yee

Mathematics

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

A lecture hall partition of length n is a sequence (λ₁,lambda;₂,..,λ_n of nonnegative integers satisfying 0 ≤ λ₁/1 ≤ ⋯≤λ_n/n. ousquet-Mélou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and In. In this paper, we construct a bijection which is an identity mapping in the limiting case.

Original language	English (US)
Pages (from-to)	293-298
Number of pages	6
Journal	Discrete Mathematics
Volume	248
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(01)00352-1
State	Published - Apr 6 2002

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(01)00352-1

Cite this

@article{1ec04a42988b40caa65cea3830258a44,

title = "On the refined lecture hall theorem",

abstract = "A lecture hall partition of length n is a sequence (λ1,lambda;2,..,λn of nonnegative integers satisfying 0 ≤ λ1/1 ≤ ⋯≤λn/n. ousquet-M{\'e}lou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and In. In this paper, we construct a bijection which is an identity mapping in the limiting case.",

author = "Yee, \{Ae Ja\}",

year = "2002",

month = apr,

day = "6",

doi = "10.1016/S0012-365X(01)00352-1",

language = "English (US)",

volume = "248",

pages = "293--298",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - On the refined lecture hall theorem

AU - Yee, Ae Ja

PY - 2002/4/6

Y1 - 2002/4/6

N2 - A lecture hall partition of length n is a sequence (λ1,lambda;2,..,λn of nonnegative integers satisfying 0 ≤ λ1/1 ≤ ⋯≤λn/n. ousquet-Mélou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and In. In this paper, we construct a bijection which is an identity mapping in the limiting case.

AB - A lecture hall partition of length n is a sequence (λ1,lambda;2,..,λn of nonnegative integers satisfying 0 ≤ λ1/1 ≤ ⋯≤λn/n. ousquet-Mélou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and In. In this paper, we construct a bijection which is an identity mapping in the limiting case.

UR - https://www.scopus.com/pages/publications/31244434021

UR - https://www.scopus.com/pages/publications/31244434021#tab=citedBy

U2 - 10.1016/S0012-365X(01)00352-1

DO - 10.1016/S0012-365X(01)00352-1

M3 - Article

AN - SCOPUS:31244434021

SN - 0012-365X

VL - 248

SP - 293

EP - 298

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On the refined lecture hall theorem

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this