The multisubset sum problem for finite abelian groups
Amela Muratović-Ribić, Qiang Wang
Abstract
Open-access reader
Amela Muratović-Ribić, Qiang Wang
Abstract
Open-access reader
We use a similar techique as in M. Kosters, The subset problem for finite abelian groups, J. Combin. Theory Ser. A 120 (2013), 527-530, to derive a formula for the number of multisubsets of a finite abelian group G with any given size and any given multiplicity such that the sum is equal to a given element g from G. This also gives the number of partitions of g into a given number of parts over a finite abelian group.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We use a similar techique as in M. Kosters, The subset problem for finite abelian groups, J. Combin. Theory Ser. A 120 (2013), 527-530, to derive a formula for the number of multisubsets of a finite abelian group G with any given size and any given multiplicity such that the sum is equal to a given element g from G. This also gives the number of partitions of g into a given number of parts over a finite abelian group.
Key concepts: Abelian group, Mathematics, Rank of an abelian group, Combinatorics, Elementary abelian group, Multiplicity (mathematics), Free abelian group, Torsion subgroup