相关论文: Random Translates in Minkowski Sums

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

The convex hull of several i.i.d. beta distributed random vectors in $\mathbb R^d$ is called the random beta polytope. Recently, the expected values of their intrinsic volumes, number of faces, normal and tangent angles and other quantities…

We study the problem of ellipsoidal bounding of convex set-valued data, where the convex set is obtained by the $p$-sum of finitely many ellipsoids, for any real $p\geq 1$. The notion of $p$-sum appears in the Brunn-Minkowski-Firey theory…

We analyze the asymptotic behavior of the average maximal number of balls in a bin obtained by throwing uniformly at random $r$ balls without replacement into $n$ bins, $T$ times. Writing the expected maximum as $\frac{r}{n}T+…

We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

Suppose that A is a finite set of integers of diameter D. Suppose also that the set of integers B is such that A+B is a tiling of the integers, that is each integer is uniquely expressible as a+b, with a in A, b in B. It is well known that…

A set $U$ of unit vectors is selectively balancing if one can find two disjoint subsets $U^+$ and $U^-$, not both empty, such that the Euclidean distance between the sum of $U^+$ and the sum of $U^-$ is smaller than $1$. We prove that the…

In machine learning and computer graphics, a fundamental task is the approximation of a probability density function through a well-dispersed collection of samples. Providing a formal metric for measuring the distance between probability…

We consider tessellations of the Euclidean $(d-1)$-sphere by $(d-2)$-dimensional great subspheres or, equivalently, tessellations of Euclidean $d$-space by hyperplanes through the origin; these we call conical tessellations. For random…

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

We build on the correspondence between abstract key polynomials and minimal pairs made by Novacoski and show how to relate the valuations that are generated by each object. We can then give a geometric interpretation of valuations built in…

We consider a collection of balls in Euclidean space and the problem of determining if Brownian motion has a positive probability of avoiding all the balls

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

We obtain estimates for the Kolmogorov distance to appropriately chosen gaussians, of linear functions \[ \sum_{i\in [n]^d} \theta_i X_i \] of random tensors $\boldsymbol{X}=\langle X_i:i\in [n]^d\rangle$ which are symmetric and…

Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, including…

The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among simplexes for the regular simplex (the regular tetrahedron, in three dimensions), maximal among parallelepipeds for the hypercube, and maximal among…

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…