English
Related papers

Related papers: Random Translates in Minkowski Sums

200 papers

Let $G$ be a finite abelian group, let $0 < \alpha < 1$, and let $A \subseteq G$ be a random set of size $|G|^\alpha$. We let $$ \mu(A) = \max_{B,C:|B|=|C|=|A|}|\{(a,b,c) \in A \times B \times C : a = b + c \}|. $$ The issue is to determine…

Discrete Mathematics · Computer Science 2014-01-07 John P Steinberger

We investigate the following question: what is the set of unit volume which can be best irrigated starting from a single source at the origin, in the sense of branched transport? We may formulate this question as a shape optimization…

Optimization and Control · Mathematics 2018-01-01 Paul Pegon , Filippo Santambrogio , Qinglan Xia

Higher-dimensional Dedekind sums are defined as a generalization of a recent 1-dimensional probability model of Dilcher and Girstmair to a d-dimensional cube. The analysis of the frequency distribution of marked lattice points leads to new…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Sinai Robins , Shelemyahu Zacks

We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in $\mathbb{R}^d$ based on some rules. Variants include boundedness games, where one player wants to keep the positions…

Computer Science and Game Theory · Computer Science 2016-11-28 Stéphane Le Roux , Arno Pauly , Jean-François Raskin

We consider random trigonometric polynomials of the form \[ f_n(x,y)=\sum_{1\le k,l \le n} a_{k,l} \cos(kx) \cos(ly), \] where the entries $(a_{k,l})_{k,l\ge 1}$ are i.i.d. random variables that are centered with unit variance. We…

Probability · Mathematics 2016-10-19 Jürgen Angst , Guillaume Poly , Hung Pham Viet

Let $C$ be a closed convex cone in ${\mathbb R}^n$, pointed and with interior points. We consider sets of the form $A=C\setminus A^\bullet$, where $A^\bullet\subset C$ is a closed convex set. If $A$ has finite volume (Lebesgue measure),…

Metric Geometry · Mathematics 2017-11-08 Rolf Schneider

Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…

Logic · Mathematics 2017-02-15 Jan Krajicek

We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of ellipsoids. We clarify connections among several parameterizations available in the…

Optimization and Control · Mathematics 2018-06-26 Abhishek Halder

We consider the numerical integration $${\rm INT}_d(f)=\int_{\mathbb{B}^{d}}f(x)w_\mu(x)dx $$ for the weighted Sobolev classes $BW^{r}_{p,\mu}$ and the weighted Besov classes $BB_\tau^r(L_{p,\mu})$ in the randomized case setting, where…

Numerical Analysis · Mathematics 2022-01-19 Jiansong Li , Heping Wang

We establish higher-order nonasymptotic expansions for a difference between probability distributions of sums of i.i.d. random vectors in a Euclidean space. The derived bounds are uniform over two classes of sets: the set of all Euclidean…

Statistics Theory · Mathematics 2022-11-30 Mayya Zhilova

Unbounded SubsetSum is a classical textbook problem: given integers $w_1,w_2,\cdots,w_n\in [1,u],~c,u$, we need to find if there exists $m_1,m_2,\cdots,m_n\in \mathbb{N}$ satisfying $c=\sum_{i=1}^n w_im_i$. In its all-target version, $t\in…

Data Structures and Algorithms · Computer Science 2022-03-01 Mingyang Deng , Xiao Mao , Ziqian Zhong

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

Combinatorics · Mathematics 2012-12-27 Raman Sanyal

We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…

Probability · Mathematics 2025-02-18 Martin Huesmann , Michael Goldman , Dario Trevisan

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…

Combinatorics · Mathematics 2023-05-08 Itai Benjamini , Yotam Dikstein , Renan Gross , Maksim Zhukovskii

This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$…

Artificial Intelligence · Computer Science 2011-05-05 Christos Boutsidis , Anastasios Zouzias , Petros Drineas

The Kneser-Poulsen conjecture says that if a finite collection of balls in a Euclidean (spherical or hyperbolic) space is rearranged so that the distance between each pair of centers does not increase, then the volume of the union of these…

Metric Geometry · Mathematics 2018-02-06 Igors Gorbovickis

We generalize the results and conjectures of Tam\'{a}s Lengyel, showing that the \textsc{nim}-values of a large class of two-dimensional subtraction-transfer games are periodic. These are impartial, normal-play games with two piles of…

Combinatorics · Mathematics 2026-05-25 Alon Danai , Paul Ellis , Thotsaporn Aek Thanatipanonda

It seems reasonable that a toroid can be thought of approximately as a solenoid bent into a circle. The correspondence of the inductances of these two objects gives an approximation for the natural logarithm in terms of the average of two…

Popular Physics · Physics 2015-03-13 Ibrahim Semiz

The extremal tail probabilities of moving sums in a marked Poisson random field is examined here. These sums are computed by adding up the weighted occurrences of events lying within a scanning set of fixed shape and size. Change of measure…

Probability · Mathematics 2007-08-22 Hock Peng Chan

We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…

Probability · Mathematics 2014-11-25 Alan Frieze , Wesley Pegden