Related papers: Separations inside a cube
We present a method to project a hypercube of arbitrary dimension on the plane, in such a way as to preserve, as well as possible, the distribution of distances between vertices. The method relies on a Montecarlo optimization procedure that…
We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose…
In a previous study (quant-ph/0207181), we formulated a conjecture that arbitrarily coupled qubits (describable by 4 x 4 density matrices) are separable with an a priori probability of 8/(11 \pi^2) = 0.0736881. For this purpose, we employed…
We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…
Position probability distribution of a set of massive mutually exclusive particles in one dimension has been defined. Examples with a given two mutually exclusive particles system are considered. It is emphasized that quantum particles at…
A formalism is presented for analytically obtaining the probability density function, (P_{n}(s)), for the random distance (s) between two random points in an (n)-dimensional spherical object of radius (R). Our formalism allows (P_{n}(s)) to…
Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…
A cap in a 2-D sphere is considered, smaller than an hemisphere. Two points are randomly chosen in the cap. The probability density that the angular separation between the points have a given value is obtained. The knowledge of this…
Let $K$ be a convex body in Euclidean space ${\mathbb R}^d$, and let a translation invariant, locally finite Borel measure on the space of hyperplanes in ${\mathbb R}^d$ be given. For $\delta\ge 0$, we consider the set of all points $x$ for…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
The classic double bubble theorem says that the least-perimeter way to enclose and separate two prescribed volumes in $\mathbb{R}^N$ is the standard double bubble. We seek the optimal double bubble in $\mathbb{R}^N$ with density, which we…
We report a concise answer--in the case of 2 x 2 systems--to the fundamental quantum-information-theoretic question as to "the volume of separable states" posed by Zyczkowski, Horodecki, Sanpera and Lewenstein (Phys. Rev. A, 58, 883…
Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n…
Colloidal droplets are used in a variety of practical applications. Some of these applications require particles of different sizes. These include medical diagnostic methods, the creation of photonic crystals, the formation of…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
We describe and analyze some Monte Carlo methods for manifolds in Euclidean space defined by equality and inequality constraints. First, we give an MCMC sampler for probability distributions defined by un-normalized densities on such…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…