MetadataShow full item record
AbstractPartitions play an important role in numerous combinatorial optimization problems. Here we introduce the number of ordered 3-partitions of a multiset M having equal sums denoted by S(m1, ..., mn; α1, ..., αn), for which we find the generating function and give a useful integral formula. Some recurrence formulae are then established and new integer sequences are added to OEIS, which are related to the number of solutions for the 3-signum equation.
CitationAndrica, D., and Bagdasar, O. (2018) ‘Some remarks on 3-partitions of multisets’, Electronic Notes in Discrete Mathematics, 70, pp. 1-8. doi: 10.1016/j.endm.2018.11.001
JournalElectronic Notes in Discrete Mathematics
Series/Report no.Proceedings of TCDM'2018
The following license files are associated with this item:
- Creative Commons
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by/4.0/