The polynomial part of a restricted partition function related to the Frobenius problem
Matthias Beck, Ira M. Gessel, Takao Komatsu
math.COarXiv:math/0306036
Abstract
Given a set of positive integers A = a1,...,an, we study the number pA (t) of nonnegative integer solutions (m1,...,mn) to m1 a1 + ... mn an = t. We derive an explicit formula for the polynomial part of pA.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz