Some minimisation algorithms in arithmetic invariant theory

Some minimisation algorithms in arithmetic invariant theory
复制标题

算术不变量理论中的一些最小化算法

DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Lazar Radivcevi'c
Lazar Radivcevi'c
中科院分区:
--
文献类型:
--
作者:
T. Fisher;Lazar Radivcevi'c

文献摘要

被引文献

相似文献

我们扩展的工作Cremona,费舍尔和斯托尔最小化属1曲线的度2,3,4,5,一些其他的表示相关的属1曲线,研究Bhargava和何。具体来说,我们描述算法最小化二度(2,2)-形式,3 × 3 × 3立方体和2 × 2 × 2 × 2超立方体。我们还证明了一个定理有关的最小判别式的雅可比椭圆曲线。
We extend the work of Cremona, Fisher and Stoll on minimising genus one curves of degrees 2,3,4,5, to some of the other representations associated to genus one curves, as studied by Bhargava and Ho. Specifically we describe algorithms for minimising bidegree (2,2)-forms, 3 x 3 x 3 cubes and 2 x 2 x 2 x 2 hypercubes. We also prove a theorem relating the minimal discriminant to that of the Jacobian elliptic curve.