English
Related papers

Related papers: Random Translates in Minkowski Sums

200 papers

Turan's method, as expressed in his books, is a careful study of trigonometric polynomials from different points of view. The present article starts from a problem asked by Turan: how to construct a sequence of real numbers x(j) (j=…

Classical Analysis and ODEs · Mathematics 2011-10-21 Jean-Pierre Kahane

We obtain the leading orders of the maximum and the minimum of local times for the simple random walk on the two-dimensional torus at time proportional to the cover time. We also estimate the number of points with large (or small) values of…

Probability · Mathematics 2014-10-22 Yoshihiro Abe

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Combinatorics · Mathematics 2011-08-26 Konrad J. Swanepoel , Pavel Valtr

We extend Bobkov and Chistyakov's (2015) upper bounds on concentration functions of sums of independent random variables to a multivariate entropic setting. The approach is based on pointwise estimates on densities of sums of independent…

Probability · Mathematics 2026-03-05 James Melbourne , Tomasz Tkocz , Katarzyna Wyczesany

In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…

Metric Geometry · Mathematics 2017-06-23 Benjamin Reichenwallner

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

Metric Geometry · Mathematics 2015-03-20 Sascha Kurz , Valery Mishkin

Suppose that we are to place $m$ balls into $n$ bins sequentially using the $d$-choice paradigm: For each ball we are given a choice of $d$ bins, according to $d$ hash functions $h_1,\dots,h_d$ and we place the ball in the least loaded of…

Data Structures and Algorithms · Computer Science 2018-04-26 Anders Aamand , Mathias Bæk Tejs Knudsen , Mikkel Thorup

A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points,…

Metric Geometry · Mathematics 2007-12-07 Konrad J. Swanepoel

Consider linear regression where the examples are generated by an unknown distribution on $R^d\times R$. Without any assumptions on the noise, the linear least squares solution for any i.i.d. sample will typically be biased w.r.t. the least…

Machine Learning · Computer Science 2018-10-08 Michał Dereziński , Manfred K. Warmuth , Daniel Hsu

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

We comment on, elaborate, and extend the work of Warren Ewens and Herbert Wilf, described in their http://www.pnas.org/content/104/27/11189.full.pdf about the maximum in balls-and-boxes problem. In particular we meta-apply their ingenious…

Statistics Theory · Mathematics 2011-06-29 Shalosh B. Ekhad , Doron Zeilberger

Given a $k$-point configuration $x\in (\mathbb{R}^d)^k$, we consider the $\binom{k}{d}$-vector of volumes determined by choosing any $d$ points of $x$. We prove that a compact set $E\subset \R^d$ determines a positive measure of such volume…

Classical Analysis and ODEs · Mathematics 2021-02-05 Belmiro Galo , Alex McDonald

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

Combinatorics · Mathematics 2009-11-02 Donald M. Davis

The asymptotic law for the expected nodal volume of random non-Gaussian monochromatic band-limited functions is determined in vast generality. Our methods combine microlocal analytic techniques and modern probability theory. A particularly…

Probability · Mathematics 2021-09-09 Zakhar Kabluchko , Andrea Sartori , Igor Wigman

This paper proves that for every convex body in R^n there exist 5n-4 Minkowski symmetrizations, which transform the body into an approximate Euclidean ball. This result complements the sharp c n log n upper estimate by J. Bourgain, J.…

Functional Analysis · Mathematics 2007-05-23 Bo'az Klartag

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Discrete Mathematics · Computer Science 2010-03-03 Anastasios Zouzias

An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…

Probability · Mathematics 2015-08-27 Patrizia Berti , Irene Crimaldi , Luca Pratelli , Pietro Rigo

This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball…

Metric Geometry · Mathematics 2026-05-05 Gershon Wolansky

We show that if $\mathcal{L}_1$ and $\mathcal{L}_2$ are linear transformations from $\mathbb{Z}^d$ to $\mathbb{Z}^d$ satisfying certain mild conditions, then, for any finite subset $A$ of $\mathbb{Z}^d$, $$|\mathcal{L}_1 A+\mathcal{L}_2…

Combinatorics · Mathematics 2024-11-21 David Conlon , Jeck Lim

For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…

Probability · Mathematics 2019-07-16 Markus Heydenreich , Remco van der Hofstad