• Some remarks on 3-partitions of multisets.

      Andrica, Dorin; Bagdasar, Ovidiu; Babeş-Bolyai University; University of Derby (Elsevier, 2018-12-06)
      Partitions 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.