A bijective proof and generalization of Siladić's Theorem
Abstract
In a recent paper, Dousse introduced a refinement of Siladić's theorem on partitions, where parts occur in two primary and three secondary colors. Her proof used the method of weighted words and $q$difference equations. The purpose of this paper is to give a bijective proof of a generalization of Dousse's theorem from two primary colors to an arbitrary number of primary colors.
 Publication:

arXiv eprints
 Pub Date:
 May 2019
 DOI:
 10.48550/arXiv.1906.00089
 arXiv:
 arXiv:1906.00089
 Bibcode:
 2019arXiv190600089K
 Keywords:

 Mathematics  Combinatorics;
 Mathematics  Number Theory;
 11P84 (Primary);
 05A19 (Secondary)
 EPrint:
 26 pages