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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.