AbstractGeneralizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of subsets of Zn without certain separations. Chen, Wang, and Zhang then studied the problem of partitioning Zn 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
AbstractIn this paper the following theorem is proved and generalized. The partitions of any positiv...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
AbstractIn this paper we enumerate the number of ways of selecting k objects from n objects arrayed ...
AbstractWe introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be ...
AbstractGeneralizing a classical problem in enumerative combinatorics, Mansour and Sun counted the n...
10 pages, 1 figure, European J. Combin.International audienceGeneralizing a classical problem in enu...
Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
AbstractWe give combinatorial proofs of the formulas for the number of multichains in the k-divisibl...
AbstractWe give a new proof of a theorem of Mansour and Sun by using number theory and Rothe’s ident...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractA general theorem for providing a class of combinatorial identities where the sum is over al...
International audienceWe give combinatorial proofs of the formulas for the number of multichains in ...
AbstractWe study M(n), the number of distinct values taken by multinomial coefficients with upper en...
AbstractThis paper is about a connection between a general problem of partitions in Z/nZ and the exp...
AbstractIn this paper the following theorem is proved and generalized. The partitions of any positiv...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
AbstractIn this paper we enumerate the number of ways of selecting k objects from n objects arrayed ...
AbstractWe introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be ...
AbstractGeneralizing a classical problem in enumerative combinatorics, Mansour and Sun counted the n...
10 pages, 1 figure, European J. Combin.International audienceGeneralizing a classical problem in enu...
Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
AbstractWe give combinatorial proofs of the formulas for the number of multichains in the k-divisibl...
AbstractWe give a new proof of a theorem of Mansour and Sun by using number theory and Rothe’s ident...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractA general theorem for providing a class of combinatorial identities where the sum is over al...
International audienceWe give combinatorial proofs of the formulas for the number of multichains in ...
AbstractWe study M(n), the number of distinct values taken by multinomial coefficients with upper en...
AbstractThis paper is about a connection between a general problem of partitions in Z/nZ and the exp...
AbstractIn this paper the following theorem is proved and generalized. The partitions of any positiv...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
AbstractIn this paper we enumerate the number of ways of selecting k objects from n objects arrayed ...
DOI
Add to ORKG