1.
Armstrong D. Cyclic Sieving of Multisets with Bounded Multiplicity and the Frobenius Coin Problem. Electron. J. Combin. [Internet]. 2026Aug.28 [cited 2026Aug.29];33(3):#P3.40. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i3p40