Diophantine Quadruples and Cayley's Hyperdeterminant

Simple item page
dc.creatorGibbs, Philip
dc.date2001-07-28
dc.date2001-09-09
dc.date.accessioned2026-07-07T04:42:46Z
dc.date.available2026-07-07T04:42:46Z
dc.descriptionA famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Such Diophantine sets have been used to construct high rank elliptic curves. Here I demonstrate a link with Cayley's hyperdeterminants which provides a fruitful generalisation of Diophantine quadruples.
dc.identifierhttps://arxiv.org/abs/math/0107203
dc.identifierhttp://arxiv.org/abs/math/0107203
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61921
dc.subjectNumber Theory
dc.subject11D09; 14M12; 11G05
dc.titleDiophantine Quadruples and Cayley's Hyperdeterminant
dc.typetext

Files

Collections

arXiv