Search Results for ""

Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...

Select three points at random on the circumference of a unit circle and find the distribution of areas of the resulting triangles determined by these three points. The first ...

A compact manifold is a manifold that is compact as a topological space. Examples are the circle (the only one-dimensional compact manifold) and the n-dimensional sphere and ...

A general system of fourth-order curvilinear coordinates based on the cyclide in which Laplace's equation is separable (either simply separable or R-separable). Bôcher (1894) ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...