### 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é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 | |

State | Published - Apr 6 2002 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On the refined lecture hall theorem'. Together they form a unique fingerprint.

## Cite this

Yee, A. J. (2002). On the refined lecture hall theorem.

*Discrete Mathematics*,*248*(1-3), 293-298. https://doi.org/10.1016/S0012-365X(01)00352-1