Add to ORKGGeneralizing 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 condition. In this paper, we improve on their main theorems by applying a convolution formula for cyclic multinomial coefficients due to Raney-Mohanty
This paper presents a theorem on the binomial coefficients of combinatorial geometric series and its...
Enumerating formulae are constructed which count the number of partitions of a positive integer into...
We studyM(n), the number of distinct values taken by multinomial coefficients with upper entry n, an...
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...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
AbstractWe introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be ...
This paper focuses on the successive partition method applied to a multinomial coefficient like part...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
Additive combinatorics is built around the famous theorem by Sze-merédi which asserts existence of ...
Dedicated to George Szekeres on the occasion of his 90th birthday Abstract. MacMahon devoted a signi...
This paper focuses on the successive partition method applied to a binomial coefficient in combinato...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
This paper presents a theorem on the binomial coefficients of combinatorial geometric series and its...
Enumerating formulae are constructed which count the number of partitions of a positive integer into...
We studyM(n), the number of distinct values taken by multinomial coefficients with upper entry n, an...
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...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
AbstractWe introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be ...
This paper focuses on the successive partition method applied to a multinomial coefficient like part...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
Additive combinatorics is built around the famous theorem by Sze-merédi which asserts existence of ...
Dedicated to George Szekeres on the occasion of his 90th birthday Abstract. MacMahon devoted a signi...
This paper focuses on the successive partition method applied to a binomial coefficient in combinato...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
This paper presents a theorem on the binomial coefficients of combinatorial geometric series and its...
Enumerating formulae are constructed which count the number of partitions of a positive integer into...
We studyM(n), the number of distinct values taken by multinomial coefficients with upper entry n, an...