MetadataShow full item record
AbstractThe interplay between integer sequences and partitions has led to numerous interesting results, with implications in generating functions, integral formulae, or combinatorics. An illustrative example is the number of solutions at level n to the signum equation. Denoted by S(n), this represents the number of ways of choosing + and - such that ±1±2±3±···±n = 0 (see A063865 in OEIS). The Andrica-Tomescu conjecture regarding the asymptotic behaviour of S(n) was solved affirmatively in 2013, and new conjectures were formulated since then. In this paper we present recurrence formulae, generating functions and integral formulae for the number of ordered 2-partitions of the multiset M having equal sums. Certain related integer sequences not currently indexed in the OEIS are then presented. Finally, we formulate conjectures regarding the unimodality, distribution and asymptotic behaviour of these sequences.
CitationBagdasar, O. and Andrica, D. (2017) , 'New results and conjectures on 2-partitions of multisets.', Proceedings of the 7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO), Sharjah, 4th - 6th April, pp. 1-5.
JournalProceedings of the 7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-sa/4.0/