Partitions of Z_n into arithmetic progressions

DOI10.1016/J.EJC.2008.09.027zbMATH Open1234.05034arXiv0805.1622OpenAlexW1968992675MaRDI QIDQ1024267FDOQ1024267

Authors: William Y. C. Chen, David G. L. Wang, Iris F. Zhang 

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We introduce the notion of arithmetic progression blocks or AP-blocks of $mathbb{Z}_n$, which can be represented as sequences of the form $(x,x+m,x+2m,\mathrm{...},x+(i-1)m)pmodn$. Then we consider the problem of partitioning $mathbb{Z}_n$ into AP-blocks for a given difference $m$. We show that subject to a technical condition, the number of partitions of $mathbb{Z}_n$ into $m$-AP-blocks of a given type is independent of $m$. When we restrict our attention to blocks of sizes one or two, we are led to a combinatorial interpretation of a formula recently derived by Mansour and Sun as a generalization of the Kaplansky numbers. These numbers have also occurred as the coefficients in Waring's formula for symmetric functions.

Full work available at URL: https://arxiv.org/abs/0805.1622

Recommendations

• On arithmetic partitions of \(\mathbb Z_n\)
• Combinatorics of integer partitions in arithmetic progression
• A COMPLETE SOLUTION OF THE PARTITION OF A NUMBER INTO ARITHMETIC PROGRESSIONS
• scientific article; zbMATH DE number 5577844
• scientific article

zbMATH Keywords

separation algorithmcycle lemmanumber of partitions\(m\)-AP-blocksarithmetic progression blockscyclic multinomial coefficientsKaplansky numbersWaring's formula

Mathematics Subject Classification ID

Partitions of sets (05A18) Arithmetic progressions (11B25)

Cites Work

• Title not available (Why is that?)
• A problem of arrangements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new proof of a theorem of Mansour and Sun
• Scattered subsets
• Title not available (Why is that?)
• Cyclic Tableaux and Symmetric Functions
• Solution of the “Problème des ménages”
• Title not available (Why is that?)
• Selecting non-consecutive balls arranged in many lines
• Two selection problems revisited
• The cycle lemma and some applications
• On the number of combinations without unit separation
• Cycle Polynomials
• Selecting k objects from a cycle with p pairs of separation s
• On the number of combinations without certain separations
• On the number of combinations without a fixed distance
• Title not available (Why is that?)
• On arithmetic partitions of \(\mathbb Z_n\)
• The number of subsets without a fixed circular distance

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On arithmetic partitions of \(\mathbb Z_n\)
• The number of s-separated k-sets in various circles
• A COMPLETE SOLUTION OF THE PARTITION OF A NUMBER INTO ARITHMETIC PROGRESSIONS
• Partitions into \(k\)th powers of terms in an arithmetic progression

This page was built for publication: Partitions of \(\mathbb Z_n\) into arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024267)