TOPICS
Search

Search Results for ""


511 - 520 of 1613 for packing problemSearch Results
A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...
The complex lattice Lambda_6^omega corresponding to real lattice K_(12) having the densest hypersphere packing (kissing number) in twelve dimensions. The associated ...
The first de Villiers point is the perspector of the reference triangle and its BCI triangle, which is Kimberling center X_(1127) and has triangle center function ...
Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...
The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...
A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...
The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...
The Lester circle is the circle on which the circumcenter C, nine-point center N, and the first and second Fermat points X and X^' lie (Kimberling 1998, pp. 229-230). Besides ...
An ordering for the Cartesian product × of any two sets A and B with order relations <A and <B, respectively, such that if (a_1,b_1) and (a_2,b_2) both belong to A×B, then ...
Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...
1 ... 49|50|51|52|53|54|55 ... 162 Previous Next

...