In science:

However, even if we accept this argument, it does not follow that a set and its convex hull are equivalent insofar as determination of independencies goes.

Conditional Plausibility Measures and Bayesian Networks

Let (X ′ , E ) be the Skolem hull of X0 inside (Vκ , ε).

On the consistency of the definable tree property on \aleph_1

Hull, “D-branes and the noncommutative torus,” hepth/9711165, J.

On Theories With Light-Like Noncommutativity

Let σ denote the boundary of the convex hull of γ .

Sextactic points on a simple closed curve

Right: pattern of Hull , which cannot be folded ﬂat, for any mountain-valley assignment.

When Can You Fold a Map?

In other words the set of bistochastic matrices is the convex hull of the set of permutation matrices.

Random unistochastic matrices

Thus, a triangle is a pseudo-triangle. A pseudo-triangulation of a set S of n points in the plane is a partition of the convex hull of S into pseudotriangles using S as a vertex set.

Computational Geometry Column 43

She proved that a pointed pseudo-triangulation is rigid when viewed as a bar and joint framework, and that removal of a convex hull edge yields a mechanism with one degree of freedom (1-dof ) that executes an expansive motion.

Computational Geometry Column 43

For example, the hulls K form almost surely a simple path if and only if κ ≤ 4.

The Random-Cluster Model

If A ⊆ RN then cone hull(A) is a union of all rays through the origin intersecting A.

A sufficient condition for global invertibility of Lipschitz mapping

It is well known that the image F (Iq ) of BB mapping is contained in the convex hull of the control points.

A sufficient condition for global invertibility of Lipschitz mapping

This process is related to the rancher in two dimensions, since the future behavior of xn is inﬂuenced through the shape of the convex hull of the graph of xn at the tip.

Random walks that avoid their past convex hull

Euclidean norm and conv denotes the convex hull.

Concentration of norms and eigenvalues of random matrices

A in terms of the convex hull distance fc (A, ·) from A.

Concentration of norms and eigenvalues of random matrices

Thus it provides concentration for functions which satisfy a Lipschitz type condition with respect to the convex hull distance.