Related papers: The Euclidean Algorithm in Cubic Number Fields
We prove that all imaginary biquadratic fields and cyclic quartic fields of class number $1$ are Euclidean.
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
In this paper we give a conjectural refinement of the Davenport-Heilbronn theorem on the density of cubic field discriminants. We explain how this refinement is plausible theoretically and agrees very well with computational data.
We determine the $166\,104$ extremal monomials of the discriminant of a quaternary cubic form. These are in bijection with $D$-equivalence classes of regular triangulations of the $3$-dilated tetrahedron. We describe how to compute these…
The Euclidean $k$-median problem is defined in the following manner: given a set $\mathcal{X}$ of $n$ points in $\mathbb{R}^{d}$, and an integer $k$, find a set $C \subset \mathbb{R}^{d}$ of $k$ points (called centers) such that the cost…
We propose a stochastic variance-reduced cubic regularized Newton method for non-convex optimization. At the core of our algorithm is a novel semi-stochastic gradient along with a semi-stochastic Hessian, which are specifically designed for…
We consider the maximal operator with respect to uncentered cubes on Euclidean space with arbitrary dimension. We prove that for any function with bounded variation, the variation of its maximal function is bounded by the variation of the…
An effective search bound is established for the least non-trivial integer zero of an arbitrary integral cubic form in at least 17 variables.
We consider cubic number fields ordered by their discriminants, and show that there exist arbitrarily long sequences that contain only fields with class numbers greater than a given bound.
Many approximation algorithms and heuristic algorithms to find a fair clustering have emerged. In this paper we define a new and natural variant of fair clustering problem and design a polynomial time algorithm to compute an optimal fair…
We classify all complex quadratic number fields with 2-class group of type (2,2^m) whose Hilbert 2-class fields have class groups of 2-rank equal to 2. These fields all have 2-class field tower of length 2. We still don't know examples of…
We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This…
One of the main themes in this thesis is the description of the signature of both the infinite place and the finite places in cubic function fields of any characteristic and quartic function fields of characteristic at least 5. For these…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…
Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…
We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We are going to show that if looked from the perspective of subtraction, the…
This article focuses on some rings of integers of number fields which are known to be norm-Euclidean domains, but for which no explicit algorithm computing the Euclidean division has yet been studied or implemented. The rings of integers we…
We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…
Nondegenerate quadratic forms over $p$-adic fields are classified by their dimension, discriminant, and Hasse invariant. This paper uses these three invariants, elementary facts about $p$-adic fields and the theory of quadratic forms to…