Mathematically sound structures and fast algorithms for things around representation theory, especially algebraic Lie theory and accompanying combinatorics.
I want a function num_multipartitions(n,r) for the number of r-component multipartitions of n. How can one compute this? (without listing all the multipartitions). For the usual partitions, we use the sophisticated asymptotic stuff from FLINT. Can one use this?
ulthiel
commented
3 years ago
I want a function num_multipartitions(n,r) for the number of r-component multipartitions of n. How can one compute this? (without listing all the multipartitions). For the usual partitions, we use the sophisticated asymptotic stuff from FLINT. Can one use this?
Does this paper help?
Lemma 2.4 in Craven's paper!