English
Related papers

Related papers: New bounds on the minimal dispersion

200 papers

We investigate the fractional diffusion approximation of a kinetic equation in the upper-half plane with diffusive reflection conditions at the boundary. In an appropriate singular limit corresponding to small Knudsen number and long time…

Analysis of PDEs · Mathematics 2019-09-04 Ludovic Cesbron , Antoine Mellet , Marjolaine Puel

A compact metric space $(X, \rho)$ is given. Let $\mu$ be a Borel measure on $X$. By $r$-cluster we mean a measurable subset of $X$ with diameter at most $r$. A family of $k$ $2r$-clusters is called a $r$-cluster structure of order $k$ if…

Discrete Mathematics · Computer Science 2017-09-26 Alexey Pushnyakov

The applied method of the amplitude envelopes give us the possibility to describe a new class of amplitude equations governing the propagation of optical pulses in media with dispersion, dispersionless media and vacuum. We normalized these…

Pattern Formation and Solitons · Physics 2007-05-23 Lubomir M. Kovachev

Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the coreset literature is to understand what is the best possible…

Data Structures and Algorithms · Computer Science 2024-03-14 Lingxiao Huang , Jian Li , Xuan Wu

We establish explicit lower bounds for advection-diffusion equations in three settings: a polynomial $\dot H^{-1}$ bound for inviscid shears with $u\in L^\infty_t W^{1,1}_y$, a uniform positive lower bound on the mixing scale for diffusive…

Analysis of PDEs · Mathematics 2026-05-21 Chenyang An , Xiaoqian Xu

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

Classical Analysis and ODEs · Mathematics 2018-01-10 Han Yu

We investigate the problem of computing a minimal-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NP-hard so that we cannot expect to find…

Computational Geometry · Computer Science 2016-01-19 Helmut Alt , Nadja Scharf

We give improved lower bounds on the minimum number of $k$-holes (empty convex $k$-gons) in a set of $n$ points in general position in the plane, for $k=5,6$.

Combinatorics · Mathematics 2011-11-28 Pavel Valtr

In this paper we study the blow-ups of the singular points in the boundary of a minimizing cluster lying in the interface of more than two chambers. We establish a sharp lower bound for the perimeter density at those points and we prove…

Analysis of PDEs · Mathematics 2018-01-30 Jonas Hirsch , Michele Marini

An axis-parallel $b$-dimensional box is a Cartesian product $R_1\times R_2\times...\times R_b$ where $R_i$ is a closed interval of the form $[a_i,b_i]$ on the real line. For a graph $G$, its \emph{boxicity} box(G) is the minimum dimension…

Combinatorics · Mathematics 2012-05-07 Abhijin Adiga , L. Sunil Chandran , Naveen Sivadasan

Explicit lower bounds for the length of the shortest opaque set for the unit disc and the unit square in the Euclidean plane are derived. The results are based on an explicit application of the general method of Kawamura, Moriyama, Otachi…

Metric Geometry · Mathematics 2025-12-11 Markus Kiderlen , Florian Pausinger

Suppose $k$ centers are fit to $m$ points by heuristically minimizing the $k$-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with $p\geq 4$ bounded moments; in…

Machine Learning · Computer Science 2013-11-11 Matus Telgarsky , Sanjoy Dasgupta

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the…

Computational Geometry · Computer Science 2009-11-23 Adrian Dumitrescu , Minghui Jiang

We study the properties of the maximal volume $k$-dimensional sections of the $n$-dimensional cube $[-1,1]^n$. We obtain a first order necessary condition for a $k$-dimensional subspace to be a local maximizer of the volume of such…

Metric Geometry · Mathematics 2020-04-21 Grigory Ivanov , Igor Tsiutsiurupa

This paper proposes a new family of lower and upper bounds on the minimum mean squared error (MMSE). The key idea is to minimize/maximize the MMSE subject to the constraint that the joint distribution of the input-output statistics lies in…

Information Theory · Computer Science 2020-06-09 Michael Fauß , Alex Dysto , H. Vincent Poor

We derive upper bounds to free-space concentration of electromagnetic waves, mapping out the limits to maximum intensity for any spot size and optical beam-shaping device. For sub-diffraction-limited optical beams, our bounds suggest the…

Optics · Physics 2020-07-08 Hyungki Shim , Haejun Chung , Owen D. Miller

In this paper, we prove new upper bounds for sums of reciprocals of fractional parts over general aligned boxes, thus extending a previous result of the author concerning bounds for sums of reciprocals over symmetric boxes. These new upper…

Number Theory · Mathematics 2021-02-23 Reynold Fregoli

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

Metric Geometry · Mathematics 2018-05-01 M. M. Skriganov

We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…

Optimization and Control · Mathematics 2020-01-31 Lucas Slot , Monique Laurent