Related papers: Interaction of Poisson hyperplane processes and co…

We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of…

Random motions on the line and on the plane with space-varying velocities are considered and analyzed in this paper. On the line we investigate symmetric and asymmetric telegraph processes with space-dependent velocities and we are able to…

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…

We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…

We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…

We apply a hyperspherical formulation to a trapped Bose-Einstein condensate with dipolar and contact interactions. Central to this approach is a general correspondence between K-harmonic hyperspherical methods and a suitable Gaussian ansatz…

We introduce a Bose-Hubbard Hamiltonian with random disordered interactions as a model to study the interplay of superfluidity and glassiness in a system of three-dimensional hard-core bosons at half-filling. Solving the model using…

A recent series of papers has examined the extension of disjunctive-programming techniques to mixed-integer second-order-cone programming. For example, it has been shown---by several authors using different techniques---that the convex hull…

Suppose that $Z$ is a random closed subset of the hyperbolic plane $\H^2$, whose law is invariant under isometries of $\H^2$. We prove that if the probability that $Z$ contains a fixed ball of radius 1 is larger than some universal constant…

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…

The pentagram map is a projectively natural iteration defined on polygons, and also on a generalized notion of a polygon which we call {\it twisted polygons}. In this note we describe our recent work on the pentagram map, in which we find a…

Modelling the first-order intensity function is one of the main aims in point process theory, and it has been approached so far from different perspectives. One appealing model describes the intensity as a function of a spatial covariate.…

A branching process of particles moving at finite velocity over the geodesic lines of the hyperbolic space (Poincar\'e half-plane and Poincar\'e disk) is examined. Each particle can split into two particles only once at Poisson paced times…

We prove that the volumes determined by the lengths of the non-zero vectors $\pm\vecx$ in a random lattice L of covolume 1 define a stochastic process that, as the dimension n tends to infinity, converges weakly to a Poisson process on the…

Consider that the coordinates of $N$ points are randomly generated along the edges of a $d$-dimensional hypercube (random point problem). The probability that an arbitrary point is the $m$th nearest neighbor to its own $n$th nearest…

The Separation Problem asks for the minimum number s(O,K) of hyperplanes required to strictly separate any interior point O of a convex body K from all faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real d-space , and…

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…