Related papers: Euclid's Algorithm in quartic CM-fields

In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000.

The list of norm-Euclidean imaginary quadratic fields is known and finite. For each known case, we give a division algorithm that finds a remainder at distance less than the Euclidean minimum of the field.

We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…

When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.

Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…

Conditionally on the Generalized Riemann Hypothesis (GRH), we prove the following results: (1) a cyclic number field of degree $5$ is norm-Euclidean if and only if $\Delta=11^4,31^4,41^4$; (2) a cyclic number field of degree $7$ is…

We study elements of small norm in quadratic fields of Riachaud-Degert type.

There is considered the problem of describing up to linear conformal equivalence those harmonic cubic homogeneous polynomials for which the squared-norm of the Hessian is a nonzero multiple of the quadratic form defining the Euclidean…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…

We give an elementary approach to studying whether rings of $S$-integers in complex quadratic fields are Euclidean with respect to the $S$-norm.

In this paper, we propose a new construction of quadratic bent functions in polynomial forms. Right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 is applied in the proof.

It is known on the Generalised Riemann Hypothesis that there are precisely $13$ cyclic cubic fields that are norm-Euclidean. Unconditionally, there is a gap between analytic estimates which hold for all sufficiently large conductors and…

This paper gives an algorithm to determine whether a number in a cyclic quartic field is a sum of two squares, mainly based on local-global principle of isotropy of quadratic forms.

This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…

The Euclidean minimum $M(K)$ of a number field $K$ is an important numerical invariant that indicates whether $K$ is norm-Euclidean. When $K$ is a non-CM field of unit rank 2 or higher, Cerri showed $M(K)$, as the supremum in the Euclidean…

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the…

In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields…

Some upper bounds for the number of monogenizations of quartic orders are established by considering certain classical Diophantine equations, namely index form equations in quartic number fields, and cubic and quartic Thue equations.

In this paper, we use some of our previous results to improve an upper bound of Bayer-Fluckiger, Borello and Jossen on the Euclidean minima of algebraic number fields. Our bound depends on the degree $n$ of the field, its signature,…