New results and conjectures on 2-partitions of multisets.
|Authors||Bagdasar, Ovidiu and Andrica, Dorin|
The 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.
|Keywords||Combinatorial mathematics; Integer programming; Generating functions; Recurrence formulae; Integral formulae; Integer sequences; Asymptotic formula|
|Journal||Proceedings of the 7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)|
|Publisher||Institute of Electrical and Electronic Engineers|
|Digital Object Identifier (DOI)||https://doi.org/10.1109/ICMSAO.2017.7934928|
|Web address (URL)||http://hdl.handle.net/10545/622402|
|Publication dates||Apr 2017|
|Publication process dates|
|Deposited||21 Mar 2018, 11:38|
|Contributors||University of Derby and Babes¸-Bolyai University|
File Access Level
File Access Level
3views this month
0downloads this month