TOPICS
Search

Search Results for ""


61 - 70 of 464 for Combinatorial designSearch Results
If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...
Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...
A right angle is an angle equal to half the angle from one end of a line segment to the other. A right angle is pi/2 radians or 90 degrees. A triangle containing a right ...
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
A polygon whose vertex angles are equal (Williams 1979, p. 32).
An equilateral polygon is a polygon whose edges are all of equal length (Williams 1979, pp. 31-32). The most prominent examples of equilateral polygons are the regular ...
A distribution of error such that the error remaining is always given approximately by the last term dropped.
The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).
Almost all natural numbers are very, very, very large (Steinbach 1990, p. 111).
The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.
1 ... 4|5|6|7|8|9|10 ... 47 Previous Next

...