The multisubset sum problem for finite abelian groups

Amela Muratović-Ribić, Qiang Wang

Abstract


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.

Keywords


Composition, partition, subset sum, polynomials, finite fields, character, finite abelian groups.

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.566.0da

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications