Abstract
We introduce a novel binary representation to represent integer partitions that offers improved storage efficiency compared to the standard integer representation. We then present a recursive algorithm to generate a cyclic 3-Gray code for integer partitions under this new binary representation with a maximum of k parts. Our algorithm produces each integer partition in constant amortized time per string, using O(n2) space.
| Original language | English |
|---|---|
| Pages (from-to) | 261-268 |
| Number of pages | 8 |
| Journal | Procedia Computer Science |
| Volume | 273 |
| DOIs | |
| Publication status | Published - 2025 |
| Event | 13th Latin American Algorithms, Graphs, and Optimization Symposium, LAGOS 2025 - Buenos Aires, Argentina Duration: 10 Nov 2025 → 14 Nov 2025 |
Keywords
- CAT algorithm
- Ferrers diagrams
- Gray code
- Integer partition
- integer composition
- postorder traversal
Fingerprint
Dive into the research topics of 'Generating a cyclic 3-Gray code for integer partitions with maximum parts in constant amortized time'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver