Search Results for ""

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...

Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...

In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...

The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...

A tetractys, also called a tetraktys or decad, is an arrangement of 10 points in the form of a triangle with 1 point in the first row, two in the second, three in the third, ...