English
Related papers

Related papers: Random Translates in Minkowski Sums

200 papers

We provide sharp upper bounds for the number of symmetrizations required to transform a star shaped set in ${\mathbb R}^n$ arbitrarily close (in the Hausdorff metric) to the Euclidean ball.

Metric Geometry · Mathematics 2015-05-18 Dan Itzhak Florentin , Alexander Segal

A classical theorem of Macbeath states that for any integers $d \geq 2$, $n \geq d+1$, $d$-dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with $n$ vertices. In this paper…

Metric Geometry · Mathematics 2025-12-30 Z. Lángi , S. Wang

Asymptotic normality for the natural volume measure of random polytopes generated by random points distributed uniformly in a convex body in spherical or hyperbolic spaces is proved. Also the case of Hilbert geometries is treated and…

Probability · Mathematics 2019-09-13 Florian Besau , Christoph Thäle

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

Metric Geometry · Mathematics 2024-07-30 Shiri Artstein-Avidan , Tomer Falah , Boaz A. Slomka

We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to…

Probability · Mathematics 2018-03-13 Juhan Aru , Bhargav Narayanan , Alex Scott , Ramarathnam Venkatesan

We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…

Probability · Mathematics 2026-04-28 Serik Sagitov

Let $\xi$ be a real random variable with mean zero and variance one and $A={a_1,...,a_n}$ be a multi-set in $\R^d$. The random sum $$S_A := a_1 \xi_1 + ... + a_n \xi_n $$ where $\xi_i$ are iid copies of $\xi$ is of fundamental importance in…

Combinatorics · Mathematics 2013-01-03 Hoi H. Nguyen , Van H. Vu

In a $d$-dimensional convex body $K$ random points $X_0, \dots, X_d$ are chosen. Their convex hull is a random simplex. The expected volume of a random simplex is monotone under set inclusion, if $K \subset L$ implies that the expected…

Metric Geometry · Mathematics 2016-06-08 Benjamin Reichenwallner , Matthias Reitzner

We show that there exist $(d-1)$ - Ahlfors regular compact sets $E \subset \mathbb{R}^{d}, d\geq 2$ such that for any $t< d-1$, we have \[ \sup_T \frac{\mathcal{H}^{d-1}(E\cap T)}{w(T)^t}<\infty \] where the supremum is over all tubes $T$…

Classical Analysis and ODEs · Mathematics 2016-04-20 Changhao Chen

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

Combinatorics · Mathematics 2024-12-11 Pu Gao , Yuval Ohapkin

We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…

Probability · Mathematics 2023-07-20 Michael Goldman , Dario Trevisan

We provide sharp lower and upper bounds for the Hausdorff dimension of the intersection of a typical random covering set with a fixed analytic set both in Ahlfors regular metric spaces and in the $d$-dimensional torus. In metric spaces, we…

Probability · Mathematics 2016-05-24 Esa Järvenpää , Maarit Järvenpää , Henna Koivusalo , Bing Li , Ville Suomala , Yimin Xiao

Let $\mathcal{A}$ be the group algebra $\mathbf{k}[S_n]$ of the $n$-th symmetric group $S_n$ over a commutative ring $\mathbf{k}$. For any two subsets $A$ and $B$ of $[n]$, we define the elements \[ \nabla_{B,A}:=\sum_{\substack{w\in…

Combinatorics · Mathematics 2025-07-31 Darij Grinberg

The problem of determining the volume of a tubular neighbourhood has a long and rich history. Bounds on the volume of neighbourhoods of algebraic sets have turned out to play an important role in the probabilistic analysis of condition…

Numerical Analysis · Mathematics 2013-10-01 Martin Lotz

In this paper we give a simple, explicit construction of polytopal bounded remainder sets of all possible volumes, for any irrational rotation on the $d$ dimensional adelic torus $\mathbb{A}^d/\mathbb{Q}^d$. Our construction involves ideas…

Number Theory · Mathematics 2021-06-23 Akshat Das , Joanna Furno , Alan Haynes

The colorful simplicial depth of a collection of d+1 finite sets of points in Euclidean d-space is the number of choices of a point from each set such that the origin is contained in their convex hull. We use methods from combinatorial…

Combinatorics · Mathematics 2016-07-04 Karim Adiprasito , Philip Brinkmann , Arnau Padrol , Pavel Paták , Zuzana Patáková , Raman Sanyal

In this paper we give an explicit construction of bounded remainder sets of all possible volumes, for any irrational rotation on the adelic torus $\mathbb A/\mathbb Q$. Our construction involves ideas from dynamical systems and harmonic…

Dynamical Systems · Mathematics 2019-04-02 Joanna Furno , Alan Haynes , Henna Koivusalo

We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…

Metric Geometry · Mathematics 2026-02-24 Steven Hoehner

Let ${\mathbb E}^d$ denote the $d$-dimensional Euclidean space. The $r$-ball body generated by a given set in ${\mathbb E}^d$ is the intersection of balls of radius $r$ centered at the points of the given set. The author [Discrete…

Metric Geometry · Mathematics 2024-01-02 Károly Bezdek

We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…

Discrete Mathematics · Computer Science 2014-01-03 Amanda Redlich