On arithmetic partitions of Z_n
Combinatorics
2011-03-25 v2 Number Theory
Abstract
Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of subsets of without certain separations. Chen, Wang, and Zhang then studied the problem of partitioning 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.
Keywords
Cite
@article{arxiv.0806.3709,
title = {On arithmetic partitions of Z_n},
author = {Victor J. W. Guo and Jiang Zeng},
journal= {arXiv preprint arXiv:0806.3709},
year = {2011}
}
Comments
10 pages, 1 figure, European J. Combin. (2008), doi:10.1016/j.ejc.2008.11.009