English
Related papers

Related papers: The Minimum Norm of a Projector under Linear Inter…

200 papers

We investigate norms of spectral projectors on thin spherical shells for the Laplacian on tori. This is closely related to the boundedness of resolvents of the Laplacian, and to the boundedness of $L^p$ norms of eigenfunctions of the…

Analysis of PDEs · Mathematics 2022-06-22 Pierre Germain , Simon Leo Rydin Myerson

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Probability · Mathematics 2026-04-15 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

Computational Geometry · Computer Science 2017-07-18 Roel Apfelbaum

A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…

Combinatorics · Mathematics 2021-06-28 Wenzhong Liu , M. N. Ellingham , Dong Ye

In this note we present a construction which improves the best known bound on the minimal dispersion of large volume boxes in the unit cube. Let $d>1$. The dispersion of $T \subset [0,1]^d$ is defined as the supremum of the volume taken…

Metric Geometry · Mathematics 2022-01-13 Kurt S. MacKay

Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…

Metric Geometry · Mathematics 2024-02-09 Javier Cabello Sánchez , Adrián Gordillo-Merino

For a $3$-tensor of dimensions $I_1\times I_2\times I_3$, we show that the nuclear norm of its every matrix flattening is a lower bound of the tensor nuclear norm, and which in turn is upper bounded by $\sqrt{\min\{I_i : i\neq j\}}$ times…

Numerical Analysis · Mathematics 2014-12-09 Shenglong Hu

The normalised volume measure on the $\ell_p^n$ unit ball ($1\leq p\leq 2$) satisfies the following isoperimetric inequality: the boundary measure of a set of measure $a$ is at least $cn^{1/p}\tilde{a}\log^{1-1/p}(1/\tilde{a})$, where…

Probability · Mathematics 2008-05-27 Sasha Sodin

Let B be a centrally symmetric convex polygon of R^2 and || p - q || be the distance between two points p,q in R^2 in the normed plane whose unit ball is B. For a set T of n points (terminals) in R^2, a B-Manhattan network on T is a network…

Computational Geometry · Computer Science 2010-06-15 Nicolas Catusse , Victor Chepoi , Karim Nouioua , Yann Vaxès

We prove the following restricted projection theorem. Let $n\ge 3$ and $\Sigma \subset S^{n}$ be an $(n-1)$-dimensional $C^2$ manifold such that $\Sigma$ has sectional curvature $>1$. Let $Z \subset \mathbb{R}^{n+1}$ be analytic and let $0…

Classical Analysis and ODEs · Mathematics 2023-12-08 Jiayin Liu

We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a…

Metric Geometry · Mathematics 2007-05-23 Rene Brandenberg , Thorsten Theobald

A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…

Classical Analysis and ODEs · Mathematics 2017-03-14 Ron Peled

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,…

Computational Geometry · Computer Science 2022-08-15 Stephane Durocher , J. Mark Keil , Debajyoti Mondal

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…

Combinatorics · Mathematics 2022-12-12 Sergiy Borodachov

Given an isotropic random vector $X$ with log-concave density in Euclidean space $\Real^n$, we study the concentration properties of $|X|$ on all scales, both above and below its expectation. We show in particular that: \[ \P(\abs{|X|…

Functional Analysis · Mathematics 2011-06-03 Olivier Guédon , Emanuel Milman

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

Computational Geometry · Computer Science 2024-10-16 Michael N. Vrahatis

We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a given set of $n$ planar points, a rectangle with minimum area that encloses at least $(n-t)$ points. The uncovered points are regarded as outliers.…

Computational Geometry · Computer Science 2021-09-16 Zhengyang Guo , Yi Li

Let $(E, \lVert . \rVert)$ be a two-dimensional real normed space with unit sphere $S = \{x \in E, \lVert x \rVert = 1\}$. The main result of this paper is the following: Consider an affine regular hexagon with vertex set $H = \{\pm v_1,…

Functional Analysis · Mathematics 2011-07-01 Reinhard Wolf

Minimal cubature rules of degree $4n-1$ for the weight functions $$ W_{\a,\b,\pm \frac12}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} ((1-x^2)(1-y^2))^{\pm \frac12} $$ on $[-1,1]^2$ are constructed explicitly and are shown to be closed related to…

Numerical Analysis · Mathematics 2011-02-15 Yuan Xu

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…

Computational Geometry · Computer Science 2022-08-17 Antonios Antoniadis , Mark de Berg , Sándor Kisfaludi-Bak , Antonis Skarlatos