Name
Abstract | ||
|---|---|---|
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k 1 for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form an mod m. The main contribution of this paper is a correction to the upper-bound on number of s-partitions presented by Bhatt (1). We will give a precise asymptotics for the number of such partitions for a given integer n. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0020-0190(01)00300-3 | Inf. Process. Lett. |
Keywords | DocType | Volume |
combinatorial problems,integer partitions | Journal | 82 |
Issue | Citations | PageRank |
6 | 1 | 0.41 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William M. Y. Goh | 1 | 37 | 9.89 |
| Pawel Hitczenko | 2 | 52 | 15.48 |
| Ali Shokoufandeh | 3 | 41 | 3.97 |