Related papers: Remarks on Euclidean Minima

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

We introduce an algorithm that computes explicit class fields of an imaginary quadratic field $K$ for a given modulus $\mathfrak{f}\subset\mathcal{O}_K$ more efficiently than the use of their classical counterparts. Therein, we prove the…

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

Vasiu proved that the level torsion $\ell_{\mathcal{M}}$ of an $F$-crystal $\mathcal{M}$ over an algebraically closed field of characteristic $p>0$ is a non-negative integer that is an effectively computable upper bound of the isomorphism…

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…

In this paper, we prove a classification theorem for the stable compact minimal submanifolds of the Riemannian product of an $m_1$-dimensional ($m_1\geq3$) hypersurface $M_1$ in the Euclidean space and any Riemannian manifold $M_2$, when…

The $k$-center problem is a fundamental optimization problem with numerous applications in machine learning, data analysis, data mining, and communication networks. The $k$-center problem has been extensively studied in the classical…

Here we give refined numerical values for the minimum number of vertices of $k$-chromatic unit distance graphs in the Euclidean plane.

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. Let $\mathcal{N}_K$ be the set of positive integers $n$ such that there exist units $\varepsilon, \delta \in \mathcal{O}_K^\times$ satisfying $\varepsilon + \delta = n$. We…

Clustering is a fundamental unsupervised learning approach. Many clustering algorithms -- such as $k$-means -- rely on the euclidean distance as a similarity measure, which is often not the most relevant metric for high dimensional data…

Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to either $K$, $K(\sqrt{-1})$, $k$, or $k(\sqrt{-1})$. The…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the…

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor (for example, rings of integers in algebraic number fields or holomorphy rings in algebraic function fields). For $k \in \mathbb N$, let $\mathcal…

In this paper, we consider the essential spectrum of submanifolds in Euclidean spaces under various geometric hypotheses. Our results involve extrinsic conditions such as finite total mean curvature, the convergence of the gradient of the…

Let $\varphi_{n,K}$ denote the largest angle in all the triangles with vertices among the $n$ points selected at random in a compact convex subset $K$ of $\mathbb{R}^d$ with nonempty interior, where $d\ge2$. It is shown that the…

Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

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…

The higher Euler-Kronecker constants of a number field $K$ are the coefficients in the Laurent series expansion of the logarithmic derivative of the Dedekind zeta function about $s=1$. These coefficients are mysterious and seem to contain a…