Related papers: Nearest Points on Toric Varieties
In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation…
A classical result of Johnson and Lindenstrauss states that a set of $n$ high dimensional data points can be projected down to $O(\log n/\epsilon^2)$ dimensions such that the square of their pairwise distances is preserved up to a small…
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…
The tangent degree $\tau(X)$ of a projective variety $X^n\subset\mathbb P^N$ is the number of tangent spaces to $X$ at smooth points passing through a general point of the tangent variety $Tan(X)\subseteq\mathbb P^N$, if positive and…
This note is a continuation of the author's previous work on "Sharp bounds for the max-sliced Wasserstein distance." We use the same technique to obtain an upper bound for the expected max-sliced 2-Wasserstein distance between a compactly…
In this paper we consider variational problems involving 1-dimensional connected sets in the Euclidean plane, such as the classical Steiner tree problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal partition…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this…
Macpherson defined Chern-Schwartz-Macpherson (CSM) classes by introducing the (local) Euler obstruction function, which is an integer valued function on the variety that is constant on each stratum of a Whitney stratification of an…
Log-Euclidean distances are commonly used to quantify the similarity between positive definite matrices using geometric considerations. This paper analyzes the behavior of this distance when it is used to measure closeness between…
An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…
We provide a relation between Brauer-Manin obstruction and descent obstruction for torsors over open varieties under a connected linear algebraic group or a group of multiplicative type is given. Such a relation is further refined for…
The Paouris inequality gives the large deviation estimate for Euclidean norms of log-concave vectors. We present a modified version of it and show how the new inequality may be applied to derive tail estimates of l_r-norms and suprema of…
Topology optimization under uncertainty (TOuU) often defines objectives and constraints by statistical moments of geometric and physical quantities of interest. Most traditional TOuU methods use gradient-based optimization algorithms and…
In this paper, we focus on non-asymptotic bounds related to the Euler scheme of an ergodic diffusion with a possibly multiplicative diffusion term (non-constant diffusion coefficient). More precisely, the objective of this paper is to…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
A known first order method to find a feasible solution to a conic problem is an adapted von Neumann algorithm. We improve the distance reduction step there by projecting onto the convex hull of previously generated points using a primal…
Let X be a toric variety over a number field k with \kbar[X]^\times=\kbar^\times. Let W\subset X be a closed subset of codimension at least 2. We prove that X\setminus W satisfies strong approximation with algebraic Brauer--Manin…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
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.