The number of partitions of a set and Superelliptic Diophantine equations
Book chapter
Authors | Andrica, Dorin, Bagdasar, Ovidiu and Ţurcaş, George Cătălin |
---|---|
Abstract | In 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. |
Keywords | Multiset; Partitions of a multiset; Elliptic curves; Hyperelliptic curves |
Year | 2020 |
Book title | Springer Optimization and Its Applications |
Discrete Mathematics and Applications | |
Publisher | Springer |
ISBN | 9783030558567 |
ISSN | 1931-6828 |
1931-6836 | |
Digital Object Identifier (DOI) | https://doi.org/10.1007/978-3-030-55857-4_3 |
Web address (URL) | http://hdl.handle.net/10545/625498 |
http://www.springer.com/tdm | |
hdl:10545/625498 | |
File | |
File | File Access Level Open |
Publication dates | 22 Nov 2020 |
Publication process dates | |
Deposited | 05 Jan 2021, 11:06 |
Accepted | Jul 2020 |
Contributors | “Babeş-Bolyai” University, Cluj-Napoca, Romania, University of Derby and The Institute of Mathematics of the Romanian Academy “Simion Stoilow” Bucharest, Romania |
https://repository.derby.ac.uk/item/9455w/the-number-of-partitions-of-a-set-and-superelliptic-diophantine-equations
Download files
43
total views29
total downloads0
views this month1
downloads this month