Partitions in squares |
| |
Authors: | Jan Bohman Carl-Erik Fröberg Hans Riesel |
| |
Affiliation: | (1) Department of Computer Science, Lund University, Lund, Sweden;(2) Department of Computer Science, Royal Institute of Technology, Stockholm, Sweden |
| |
Abstract: | In this paper we study primarily partitions in different squares. A complete characterization of the least number of terms needed in different cases is given. The asymptotic number of partitions in squares and in different squares is deduced by use of numerical results obtained from extensive computer runs. Some other related problems are also discussed. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|