Presentation 2008-12-03
A Simple Generation of Multi-dimensional Partitions
Yosuke KIKUCHI, Katsuhisa YAMANAKA, Shin-ichi NAKANO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper gives a simple algorithm to generate all multi-dimensional partitions of a positive integer N. The problem is one of the basic problems in combinatorics, and it includes generations of integer partitions and plane partitions. For a given integer d as dimension, our algorithm generates each partition of a given integer in O(d) time for each without repetition. The known algorithm is complicated and includes many "goto" statements, while our algorithm is simple and efficient. Also, we propose an algorithm to generate all exactly d-dimensional partition in O(d) time for each.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) algorithm / generation / multi-dimensional partition / family tree
Paper # COMP2008-49
Date of Issue

Conference Information
Committee COMP
Conference Date 2008/11/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Simple Generation of Multi-dimensional Partitions
Sub Title (in English)
Keyword(1) algorithm
Keyword(2) generation
Keyword(3) multi-dimensional partition
Keyword(4) family tree
1st Author's Name Yosuke KIKUCHI
1st Author's Affiliation Department of Electronics and Computer Engineering, Tsuyama National College of Technology()
2nd Author's Name Katsuhisa YAMANAKA
2nd Author's Affiliation Graduate School of Information Systems, The University of Electro-Communications
3rd Author's Name Shin-ichi NAKANO
3rd Author's Affiliation Graduate School of Computer Science, Gunma University
Date 2008-12-03
Paper # COMP2008-49
Volume (vol) vol.108
Number (no) 330
Page pp.pp.-
#Pages 7
Date of Issue