English
Related papers

Related papers: New bounds on the minimal dispersion

200 papers

We show there exists a packing of identical spheres in $\mathbb{R}^d$ with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as $d\to\infty$. This improves upon previous bounds for general $d$ by a factor of order $\log d$ and is…

Metric Geometry · Mathematics 2023-12-18 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

We make a further step in the open problem of unisolvence for unsymmetric Kansa collocation, proving that the MultiQuadric Kansa method with fixed collocation points and random fictitious centers is almost surely unisolvent, for stationary…

Numerical Analysis · Mathematics 2025-03-04 Maryam Mohammadi , Alvise Sommariva , Marco Vianello

We consider finite point subsets (distributions) in compact metric spaces. Non-trivial bounds for sums of distances between points of distributions and for discrepancies of distributions in metric balls are given in the case of general…

Combinatorics · Mathematics 2015-12-02 M. M. Skriganov

We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, and $X \in A$ and $Y \in B$ are…

Probability · Mathematics 2019-03-06 Anup Rao , Amir Yehudayoff

K-means clustering is a workhorse of unsupervised learning, but it is notoriously brittle to outliers, distribution shifts, and limited sample sizes. Viewing k-means as Lloyd--Max quantization of the empirical distribution, we develop a…

Machine Learning · Computer Science 2026-04-14 Vikrant Malik , Taylan Kargin , Babak Hassibi

We construct partitions of $\mathbb{R}^n$ into three sets $\{\mathscr{X}(1),\mathscr{X}(2),\mathscr{X}(3)\}$ that locally minimize interfacial area among compactly supported volume preserving variations and that blow down at infinity to…

Analysis of PDEs · Mathematics 2025-07-21 Lia Bronsard , Robin Neumayer , Michael Novack , Anna Skorobogatova

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Statistics Theory · Mathematics 2016-12-06 Adil Ahidar-Coutrix , Philippe Berthet

We prove a sharp quantitative version of recent Faber-Krahn inequalities for the continuous Wavelet transforms associated to a certain family of Cauchy wavelet windows . Our results are uniform on the parameters of the family of Cauchy…

Functional Analysis · Mathematics 2024-11-26 Jaime Gómez , David Kalaj , Petar Melentijević , João P. G. Ramos

The ball-constrained weighted maximin dispersion problem $(\rm P_{ball})$ is to find a point in an $n$-dimensional Euclidean ball such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We propose a new…

Optimization and Control · Mathematics 2016-04-11 Shu Wang , Yong Xia

It is proved that the projection constants of two- and three-dimensional spaces are bounded by $4/3$ and $(1+\sqrt 5)/2$, respectively. These bounds are attained precisely by the spaces whose unit balls are the regular hexagon and…

Functional Analysis · Mathematics 2016-09-06 Hermann König , Nicole Tomczak-Jaegermann

In a geometric $k$-clustering problem the goal is to partition a set of points in $\mathbb{R}^d$ into $k$ subsets such that a certain cost function of the clustering is minimized. We present data structures for orthogonal range-clustering…

Computational Geometry · Computer Science 2017-05-18 Mikkel Abrahamsen , Mark de Berg , Kevin Buchin , Mehran Mehr , Ali D. Mehrabi

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

Combinatorics · Mathematics 2019-11-12 Sascha Kurz , Reinhard Laue

We review some recent advances in the field of element-based algebraic stabilization for continuous finite element discretizations of nonlinear hyperbolic problems. The main focus is on multidimensional convex limiting techniques designed…

Numerical Analysis · Mathematics 2026-02-17 Dmitri Kuzmin

We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…

Computational Complexity · Computer Science 2014-07-09 Thomas P. Hayes , Cristopher Moore

We investigate the sets of uniform limits $A(\bar{B}_n)$, $A(\bar{D}^I)$ of polynomials on the closed unit ball $\bar{B}_n$ of $\mathbb{C}^n$ and on the cartesian product $\bar{D}^I$ where $I$ is an arbitrary set and $\bar{D}$ is the closed…

Complex Variables · Mathematics 2013-04-22 K. Makridis , V. Nestoridis

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

We revisit the classic Pandora's Box (PB) problem under correlated distributions on the box values. Recent work of arXiv:1911.01632 obtained constant approximate algorithms for a restricted class of policies for the problem that visit boxes…

Data Structures and Algorithms · Computer Science 2023-07-25 Shuchi Chawla , Evangelia Gergatsouli , Jeremy McMahan , Christos Tzamos

In this paper, we extend a Ma\~n\'e's famous result on expansive homeomorphisms, originally presented in [17], to the setting of flows. Specifically, we provide a complete characterization of minimal expansive flows without fixed points on…

Dynamical Systems · Mathematics 2025-08-22 Alfonso Artigue , Elias Rego

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

Representation Theory · Mathematics 2019-09-10 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…

Computational Complexity · Computer Science 2024-10-30 Swastik Kopparty , Harry Sha