The multisubset sum problem for finite abelian groups
From MaRDI portal
Abstract: In this note, we give the explicit formula for the number of multisubsets of a finite abelian group with any given size such that the sum is equal to a given element . This also gives the number of partitions of into a given number of parts over a finite abelian group. An inclusion-exclusion formula for the number of multisubsets of a subset of with a given size and a given sum is also obtained.
Recommendations
Cited in
(10)- Counting compositions over finite abelian groups
- The subset sum problem for finite abelian groups
- Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs
- A reciprocity on finite abelian groups involving zero-sum sequences
- scientific article; zbMATH DE number 7297830 (Why is no real title available?)
- The number of additive triples in subsets of abelian groups
- Spanning subset sums for finite Abelian groups
- Applications of the multisubset sum problem over finite abelian groups
- The group permanent determines the finite abelian group
- On immanants of the Cayley table of finite abelian groups
This page was built for publication: The multisubset sum problem for finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950082)