|
|||||
|
|
Computing the integer partition function |
|
| Authors: | Neil Calkin Jimena Davis Kevin James Elizabeth Perez Charles Swannack |
| Affiliation: | Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634-0975 ; Department of Mathematics, North Carolina State University, Raleigh, North Carolina 27695 ; Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634-0975 ; Applied Mathematics and Statistics, The Johns Hopkins University, G.W.C. Whiting School of Engineering, 302 Whitehead Hall, 3400 North Charles Street, Baltimore, Maryland 21218-2682 ; Department of Electrical and Computer Engineering, Clemson University, Clemson, South Carolina 29634 |
| Abstract: | In this paper we discuss efficient algorithms for computing the values of the partition function and implement these algorithms in order to conduct a numerical study of some conjectures related to the partition function. We present the distribution of  for  for primes up to  and small powers of  and  . |
| Keywords: | Partition function discrete fast Fourier transforms |
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 | |
| 点击此处可从《Mathematics of Computation》下载全文 | |
