Combinatorial theory and statistical design
Combinatorial theory and statistical design
Kathy O'Hara's constructive proof of the unimodality of the Gaussian polynomials
American Mathematical Monthly
Modern computer algebra
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Derivatives are essentially integer partitions
Discrete Mathematics
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
Mathematics of Operations Research
Hi-index | 0.04 |
The coefficients of g^(^s^) in expanding the rth derivative of the composite function g@?f by Faa di Bruno's formula, is determined by a Diophantine linear system, which is proved to be equivalent to the problem of enumerating partitions of a finite set of integers attached to r and s canonically.