Related papers: Remarks on Euclidean Minima

We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…

We study Nordhaus-Gaddum problems for Kemeny's constant $\mathcal{K}(G)$ of a connected graph $G$. We prove bounds on $\min\{\mathcal{K}(G),\mathcal{K}(\overline{G})\}$ and the product $\mathcal{K}(G)\mathcal{K}(\overline{G})$ for various…

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

Let $K$ be a totally real number field of degree $n$ over $\mathbb{Q}$, with discriminant and regulator $\Delta_K, R_K$ respectively. In this paper, using a similar method to van Woerden, we prove that the number of classes of perfect unary…

Let $H$ be a Krull monoid with finite class group $G$. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of all possible factorization lengths $k$ is…

The Euler-Mascheroni constant $\gamma=0.5772\dots\!$ is the $K=\mathbb{Q}$ example of an Euler-Kronecker constant $\gamma_K$ of a number field $K.$ In this note we consider the size of the $\gamma_q=\gamma_{K_q}$ for cyclotomic fields…

Let $K$ be a number field of degree $n$ over ${\mathbb Q}$. Then the 4-rank of the strict class group of $K$ is at least ${\text{rank}_2 \, } ({ E_{K}^{+} } / E_K^2) - \lfloor n /2 \rfloor$ where $E_K$ and ${ E_{K}^{+} }$ denote the units…

Let $\alpha\in\r$ and let $\vec{v}\in\r^3$ be a unit vector. A singular minimal surface $\Sigma$ in Euclidean space is a surface $\Sigma$ whose mean curvature $H$ satisfies $H=\alpha\frac{\langle N,\vec{v}\rangle}{\langle…

The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.

$k$-center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean version is NP-hard to approximate within a factor of 1.93, even in the plane, if one…

We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…

We compute the Z-rank of the subgroup of elements of the multiplicative group of a number field K that are norms from every finite level of the cyclotomic Z{\ell}-extension of K. Thus we compare its {\ell}-adification with the group of…

In this paper, we give a new upper bound on the minimum Euclidean weight of Type II $\ZZ_{2k}$-codes and the concept of extremality for the Euclidean weights when $k=3,4,5,6$. Together with the known result, we demonstrate that there is an…

The $K$-medoids problem is a challenging combinatorial clustering task, widely used in data analysis applications. While numerous algorithms have been proposed to solve this problem, none of these are able to obtain an exact (globally…

Consider the length $L_{MM}^E$ of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = \beta_{MM}^E(d) N^{1-1/d}(1+A/N+... )$, we obtain precise…

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison…

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

The Margulis constant for Kleinian groups is the smallest constant $c$ such that for each discrete group $G$ and each point $x$ in the upper half space ${\bold H}^3$, the group generated by the elements in $G$ which move $x$ less than…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…