Search Results for ""
531 - 540 of 1636 for Bin Packing ProblemSearch Results
A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...
The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...
A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...
R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...
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)} ...
...
View search results from all Wolfram sites (160700 matches)

