Binary Diagrams for Storing Ascending Compositions
暂无分享，去创建一个
It is known that the integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. In this paper we give an efficient data structure for storing all ascending compositions of a positive integer. Using this structure, we improved the fastest known algorithm for generating integer partitions.
[1] George E. Andrews,et al. The truncated pentagonal number theorem , 2012, J. Comb. Theory, Ser. A.
[2] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[3] Rung-Bin Lin. Efficient Data Structures for Storing the Partitions of Integers , 2005 .
[4] Mircea Merca,et al. Fast Algorithm for Generating Ascending Compositions , 2012, J. Math. Model. Algorithms.
[5] Emil Grosswald,et al. The Theory of Partitions , 1984 .