S-partitions
Combinatorics
2007-05-23 v1
Abstract
This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form mod m. The main contribution of this paper is a correction to the upper bound on the number of s-partitions presented by Bhatt. We will give a precise asymptotics for the number of such partitions for a given integer n.
Cite
@article{arxiv.math/0110185,
title = {S-partitions},
author = {William M. Y. Goh and Pawel Hitczenko and Ali Shokoufandeh},
journal= {arXiv preprint arXiv:math/0110185},
year = {2007}
}
Comments
5 pages