Related papers: The Euclidean Algorithm in Cubic Number Fields
In this paper we considerably extend the class of known $\alpha$-minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
This paper deals with nonsmooth convex optimization problems in Euclidean spaces. We identify special elements of the subdifferential of a convex function, called specular gradients. Based on this observation, we propose three numerical…
We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
Analogous to the notion of mutually unbiased bases for Hilbert spaces, we consider mutually unbiased unitary bases (MUUB) for the space of operators, $M(d, \mathbb{C})$, acting on such Hilbert spaces. The notion of MUUB reflects the…
We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these…
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due…
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…
In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of $n$ points in a three-dimensional space. A cubic shell is a closed volume between two concentric and face-parallel cubes.…
We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…
The size function for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. It was conjectured to attain its maximum at the trivial class of Arakelov divisors. This conjecture was…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…
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…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
We propose a stochastic variance-reduced cubic regularized Newton algorithm to optimize the finite-sum problem over a Riemannian submanifold of the Euclidean space. The proposed algorithm requires a full gradient and Hessian update at the…
In this paper, we show several bounds for the numerical radius of a Hilbert space operator in terms of the Euclidean operator norm. The obtained forms will enable us to find interesting refinements of celebrated results in the literature.…