Computation of Euclidean minima in totally definite quaternion fields
We describe an algorithm that allows to compute the Euclidean minimum (for the norm form) of any order of a totally definite quaternion field over a number field [Formula: see text] of degree strictly greater than [Formula: see text]. Our approach is a generalization of the previous work dealing with number fields. The algorithm was practically implemented when [Formula: see text] has degree [Formula: see text].
2016 ◽
Vol 0
(0)
◽
2018 ◽
Vol 14
(09)
◽
pp. 2333-2342
◽
Keyword(s):
2014 ◽
Vol 10
(04)
◽
pp. 885-903
◽
Keyword(s):
2012 ◽
Vol 11
(05)
◽
pp. 1250087
◽
2019 ◽
Vol 15
(08)
◽
pp. 1617-1633
◽
Keyword(s):
1987 ◽
Vol 107
◽
pp. 135-146
◽
2019 ◽
Vol 19
(04)
◽
pp. 2050080
Keyword(s):