相关论文: The local Steiner problem in finite-dimensional no…

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…

We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish…

In a previous paper, the authors introduced several vector space norms on the space of algebraic numbers modulo torsion which corresponded to the Mahler measure on a certain class of numbers and allowed the authors to formulate L^p Lehmer…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

We study the planar least gradient problem with respect to an anisotropic norm $\phi$ for continuous boundary data. We prove existence of minimizers for strictly convex domains $\Omega$. Furthermore, we inspect the issue of uniqueness and…

The goal for the Directed Steiner Tree problem is to find a minimum cost tree in a directed graph G=(V,E) that connects all terminals X to a given root r. It is well known that modulo a logarithmic factor it suffices to consider acyclic…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V(G)$ which contain $v$. In this paper Steiner $3$-eccentricity is studied on trees. Some general properties of the Steiner…

We prove that the a standard adaptive algorithm for the Taylor-Hood discretization of the stationary Stokes problem converges with optimal rate. This is done by developing an abstract framework for indefinite problems which allows us to…

The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree…

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

In this work we consider a finite dimensional approximation for the 2D Euler equations on the sphere, proposed by V. Zeitlin, and show their convergence towards a solution to Euler equations with marginals distributed as the enstrophy…

We prove a lower bound on the number of ordinary conics determined by a finite point set in $\mathbb{R}^2$. An ordinary conic for a subset $S$ of $\mathbb{R}^2$ is a conic that is determined by five points of $S$, and contains no other…

In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…

This paper is devoted to the study of tilt stability of local minimizers, which plays an important role in both theoretical and numerical aspects of optimization. This notion has been comprehensively investigated in the unconstrained…

In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…

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…

P\'al's isominwidth theorem states that for a fixed minimal width, the regular triangle has minimal area. A spherical version of this theorem was proven by Bezdek and Blekherman, if the minimal width is at most $\tfrac \pi 2$. If the width…

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…