The arithmetical combinatorics of k,l-regular partitions

DOI10.1016/J.DISC.2022.113278zbMATH Open1506.05021arXiv2207.12366OpenAlexW4310118245MaRDI QIDQ2111933FDOQ2111933

Isaac Konan

Publication date: 17 January 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not divisible by $l$ and occurring less than $k$ times. While this refinement of Glaisher theorem is easy to establish by computation of the generating function, there is still no one-to-one canonical correspondence explaining it. Our paper brings an answer to this open problem through an arithmetical approach. Furthermore, in the case $l=2$, we discuss the possibility of constructing a Schur-type companion of the Little Glaisher theorem via the weighted words.

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

zbMATH Keywords

integer partitionsregular partitionsGlaisher identity

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new four parameter \(q\)-series identity and its partition implications
• Euler's partition theorem for all moduli and new companions to Rogers-Ramanujan-Andrews-Gordon identities
• Weighted words at degree two. II: Flat partitions, regular partitions, and application to level one perfect crystals
• Beyond Göllnitz' theorem. II: Arbitrarily many primary colors
• Beyond Göllnitz' theorem. I: A bijective approach

Cited In (4)

• Classifying \(\omega\)-regular aperiodic \(k\)-partitions
• ARITHMETIC PROPERTIES OF -REGULAR BIPARTITIONS
• Title not available (Why is that?)
• A Fine Hierarchy of ω-Regular k-Partitions

   Recommendations

• A bijective proof and generalization of Siladić's theorem 👍 👎
• Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k 👍 👎
• Schur's Partition Theorem, Companions, Refinements and Generalizations 👍 👎
• A unifying combinatorial approach to refined little Göllnitz and Capparelli's companion identities 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The arithmetical combinatorics of \(k,l\)-regular partitions

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