TOPICS
Search

Search Results for ""


141 - 150 of 464 for Combinatorial designSearch Results
A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...
The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...
Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...
The S distribution is defined in terms of its distribution function F(x) as the solution to the initial value problem (dF)/(dx)=alpha(F^g-F^h), where F(x_0)=F_0 (Savageau ...
One of the beautiful arrangements of circles found at the Temple of Osiris at Abydos, Egypt (Rawles 1997). The pattern also appears in Italian art from the 13th century ...
Regular tessellations of the plane by two or more convex regular polygons such that the same polygons in the same order surround each polygon vertex are called semiregular ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...
A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...
A superegg is a solid described by the equation |sqrt((x^2+y^2)/(a^2))|^n+|z/b|^n=1. (1) The special case n=2 gives a spheroid. Special cases of volume V_n are given by V_1 = ...
1 ... 12|13|14|15|16|17|18 ... 47 Previous Next

...