Sharp bounds for the partition function of integer sequences |
| |
| Authors: | Daniel C. Mayer |
| |
| Affiliation: | (1) Institut für Mathematik, Karl-Franzens-Universität, Elisabethstraße 16, A-8010 Graz, Austria |
| |
| Abstract: | By means of a new criterion for higher multiplicities of additive representations of integers as sums of distinct terms of a fixed integer sequence sharp bounds are determined for the partition function of many sequences with the aid of a computer. |
| |
| Keywords: | Primary 10A45 10J06 10J15 10L10 |
| 本文献已被 SpringerLink 等数据库收录！ |
