TOPICS
Search

Search Results for ""


11171 - 11180 of 13135 for Computational GeometrySearch Results
The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...
A field is any set of elements that satisfies the field axioms for both addition and multiplication and is a commutative division algebra. An archaic name for a field is ...
A set X whose elements can be numbered through from 1 to n, for some positive integer n. The number n is called the cardinal number of the set, and is often denoted |X| or ...
Given a first-order ordinary differential equation (dy)/(dx)=F(x,y), (1) if F(x,y) can be expressed using separation of variables as F(x,y)=X(x)Y(y), (2) then the equation ...
First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...
A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...
The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...
Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...
A diagram lemma which states that, given the commutative diagram of additive Abelian groups with exact rows, the following holds: 1. If f_0 is surjective, and f_1 and f_3 are ...
A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

...