The number of partitions of a set and Superelliptic Diophantine equations
Affiliation“Babeş-Bolyai” University, Cluj-Napoca, Romania
University of Derby
The Institute of Mathematics of the Romanian Academy “Simion Stoilow” Bucharest, Romania
MetadataShow full item record
AbstractIn this chapter we start by presenting some key results concerning the number of ordered k-partitions of multisets with equal sums. For these we give generating functions, recurrences and numerical examples. The coefficients arising from these formulae are then linked to certain elliptic and superelliptic Diophantine equations, which are investigated using some methods from Algebraic Geometry and Number Theory, as well as specialized software tools and algorithms. In this process we are able to solve some recent open problems concerning the number of solutions for certain Diophantine equations and to formulate new conjectures.
CitationAndrica D., Bagdasar O., and Ţurcaş G.C. (2020). ‘The number of partitions of a set and Superelliptic Diophantine equations’. In Raigorodskii A.M., and Rassias M.T. (Eds.). ‘Discrete Mathematics and Applications’. Switzerland: Springer, pp. 1-20.