The number of partitions of a set and superelliptic Diophantine equations

DOI10.1007/978-3-030-55857-4_3MaRDI QIDQ2232029zbMATH OpenOpenAlexFDO

Authors Dorin Andrica, Ovidiu D. Bagdasar, George C. Ţurcaş

Publication date 4 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-55857-4_3

zbMATH Keywords

elliptic curveshyperelliptic curvesmultisetpartitions of multiset

Mathematics Subject Classification ID

Partitions of sets (05A18) [https://portal.mardi4nfdi.de/w/index.php?search=%2211G30%22&title=Special%3ASearch&profile=advanced&fulltext=1&ns120=1 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Rational points (14G05) Elementary theory of partitions (11P81) Computer solution of Diophantine equations (11Y50)

Recommendations

• On \(k\)-partitions of multisets with equal sums
• Equal values of certain partition functions via Diophantine equations
• An elliptic Diophantine equation from the study of partitions
• Partition analysis, modular functions, and computer algebra
• Some remarks on 3-partitions of multisets

Cited in

(1)

• On \(k\)-partitions of multisets with equal sums

This page was built for publication: The number of partitions of a set and superelliptic Diophantine equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232029)