Search Results for ""
1151 - 1160 of 13135 for Combinatorial MathematicsSearch Results
A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...
A balanced incomplete block design (v, k, lambda, r, b) exists only for b>=v (or, equivalently, r>=k).
A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...
"Fluxion" is the term for derivative in Newton's calculus, generally denoted with a raised dot, e.g., f^.. The "d-ism" of Leibniz's df/dt eventually won the notation battle ...
If a proposition P is true for all B, this is written P forall B. forall is one of the two so-called quantifiers, and translates the universal quantifier forall . The Wolfram ...
An expression occurring in existential sentences. "For some x" is the same as " exists x." Unlike in everyday language, it is does not necessarily refer to a plurality of ...
Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...
A one-dimensional map whose increments are distributed according to a normal distribution. Let y(t-Deltat) and y(t+Deltat) be values, then their correlation is given by the ...
A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...
Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...
...
View search results from all Wolfram sites (60124 matches)

