Search Results for ""
1371 - 1380 of 13134 for binomial theorySearch Results
Suppose that {f_n} is a sequence of measurable functions, that f_n->f pointwise almost everywhere as n->infty, and that |f_n|<=g for all n, where g is integrable. Then f is ...
For a group G, consider a subgroup H with elements h_i and an element x of G not in H, then xh_i for i=1, 2, ... constitute the left coset of the subgroup H with respect to x.
Let H be a subgroup of G. A subset T of elements of G is called a left transversal of H if T contains exactly one element of each left coset of H.
A wavelet used in multiresolution representation to analyze the information content of images. The wavelet is defined by ...
A letter is an element of an alphabet. A collection of letters forms a word.
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.
A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...
A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.
In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...
...
View search results from all Wolfram sites (34966 matches)

