| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654604 | European Journal of Combinatorics | 2009 | 8 Pages |
Abstract
Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of subsets of ZnZn without certain separations. Chen, Wang, and Zhang then studied the problem of partitioning ZnZn into arithmetical progressions of a given type under some technical conditions. In this paper, we improve on their main theorems by applying a convolution formula for cyclic multinomial coefficients due to Raney–Mohanty.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Victor J.W. Guo, Jiang Zeng,