Partitions of Zn into arithmetic progressions

We introduce the notion of arithmetic progression blocks or m-AP-blocks of ⌊n, which can be represented as sequences of the form (x,x+m,x+2m,...,x+(i-1) m)(modn). Then we consider the problem of partitioning ⌊n into m-AP-blocks. We show that subject to a technical condition, the number of partitions of ⌊n into m-AP-blocks of a given type is independent of m, and is equal to the cyclic multinomial coefficient which has occurred in Waring's formula for symmetric functions. The type of such a partition of ⌊n is defined by the type of the underlying set partition. We give a combinatorial proof of this formula and the construction is called the separation algorithm. When we restrict our attention to blocks of sizes 1 and p+1, we are led to a combinatorial interpretation of a formula recently derived by Mansour and Sun as a generalization of the Kaplansky numbers. By using a variant of the cycle lemma, we extend the bijection to deal with an improvement of the technical condition recently given by Guo and Zeng.

[1]  Yeong-Nan Yeh,et al.  Cyclic Tableaux and Symmetric Functions , 1995 .

[2]  Norma Zagaglia Salvi,et al.  Scattered subsets , 2003, Discret. Math..

[3]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

[4]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[5]  Wenchang Chu.  On the number of combinations without k -separations , 1987 .

[6]  Victor J. W. Guo,et al.  On arithmetic partitions of Z n , 2008 .

[7]  Helmut Prodinger,et al.  Two selection problems revisited , 1986, J. Comb. Theory, Ser. A.

[8]  H. Ryser.  Combinatorial Mathematics: THE PRINCIPLE OF INCLUSION AND EXCLUSION , 1963 .

[9]  Frank K. Hwang.  Selecting k Objects from a Cycle with p Pairs of Separation s , 1984, J. Comb. Theory, Ser. A.

[10]  Frank K. Hwang,et al.  Selecting Non-consecutive Balls Arranged in Many Lines , 1984, J. Comb. Theory, Ser. A.

[11]  Irving Kaplansky,et al.  Solution of the “Problème des ménages” , 1943 .

[12]  Jiang Zeng,et al.  On arithmetic partitions of Zn , 2008, Eur. J. Comb..

[13]  Toufik Mansour,et al.  On the number of combinations without certain separations , 2008, Eur. J. Comb..

[14]  T. Motzkin,et al.  A problem of arrangements , 1947 .

[15]  F. K. HWANG.  Cycle Polynomials , 1981 .

[16]  R. Brualdi.  Introductory Combinatorics , 1992 .

[17]  Helmut Prodinger,et al.  On the Number of Combinations without a Fixed Distance , 1983, J. Comb. Theory, Ser. A.

[18]  Irving Kaplansky.  Selected papers and other writings , 1995 .

[19]  Nachum Dershowitz,et al.  The Cycle Lemma and Some Applications , 1990, Eur. J. Comb..

[20]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

[21]  William O. J. Moser.  The number of subsets without a fixed circular distance , 1986, J. Comb. Theory, Ser. A.

[22]  John Konvalina.  On the Number of Combinations without Unit Separation , 1981, J. Comb. Theory, Ser. A.

[23]  Victor J. W. Guo.  A new proof of a theorem of Mansour and Sun , 2008, Eur. J. Comb..