Search Results for ""
1331 - 1340 of 13135 for Combinatorial MathematicsSearch Results
A Maurer rose is a plot of a "walk" along an n- (or 2n-) leafed rose curve in steps of a fixed number d degrees, including all cosets.
Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...
A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...
A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...
Simple majority vote is the only procedure which is anonymous, dual, and monotonic.
The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...
Let (X,A,mu) and (Y,B,nu) be measure spaces. A measurable rectangle is a set of the form A×B for A in A and B in B.
2^(20)=1024^2=1048576 bytes. Although the term megabyte is almost universally used to refer to 1024^2 bytes, such usage is deprecated in favor of the standard SI naming ...
In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...
One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...
...
View search results from all Wolfram sites (60124 matches)

