Related papers: Separations inside a cube
Colloidosomes are created in the laboratory from a Pickering emulsion of water droplets in oil. The colloidosomes have approximately the same diameter and by choosing (hairy) particles of different diameters it is possible to control the…
We introduce the boolean convolution for probability measures on the unit circle. Roughly speaking, it describes the distribution of the product of two boolean independent unitary random variables. We find an analogue of the characteristic…
From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
The diameter of the Cayley graph of the Rubik's Cube group is the fewest number of turns needed to solve the Cube from the hardest initial configuration. For the 2$\times$2$\times$2 Cube, the diameter is 11 in the half-turn metric, 14 in…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
Precision measurement of small separations between two atoms or molecules has been of interest since the early days of science. Here, we discuss a scheme which yields spatial information on a system of two identical atoms placed in a…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
In this paper we present the comparison of experiments and numerical simulations for bubble cutting by a wire. The air bubble is surrounded by water. In the experimental setup an air bubble is injected on the bottom of a water column. When…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
In a circle (an S^1) with circumference 1 assume m objects distributed pseudo-randomly. In the universal covering R^1 assume the objects replicated accordingly, and take an interval L>1. In this interval, make the normalized histogram of…
We report major advances in the research program initiated in "Moment-Based Evidence for Simple Rational-Valued Hilbert-Schmidt Generic 2 x 2 Separability Probabilities" (J. Phys. A, 45, 095305 [2012]). A highly succinct separability…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
Often experimentalists study colloidal suspensions that are nominally monodisperse. In reality these samples have a polydispersity of 4-10%. At the level of an individual particle, the consequences of this polydispersity are unknown as it…
Wet particle separation is widely used in mineral processing and plastic recycling to separate mixtures of particulate materials into further usable fractions due to density differences. This work presents efforts aiming to numerically…
We estimate locations of the regions of the percolation and of the non-percolation in the plane $(\lambda,\beta)$: the Poisson rate -- the inverse temperature, for interacted particle systems in finite dimension Euclidean spaces. Our…