Some remarks on 3-partitions of multisets

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-12-01 DOI:10.1016/j.endm.2018.11.001

Dorin Andrica, Ovidiu Bagdasar

引用次数: 6

Abstract

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(m₁,…, m_n; $α_{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.

查看原文本刊更多论文

关于多集的3-分区的一些注释

分区在许多组合优化问题中起着重要的作用。这里我们引入一个多集M的有序3分区的数目，它们具有相等的和，记为S(m1，…，mn;α1，…，αn)，求出了生成函数，并给出了一个有用的积分公式。然后建立了一些递推公式，并在OEIS中加入了新的整数序列，这些序列与3- sgn方程的解的个数有关。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.