TOPICS
Search

Search Results for ""


3201 - 3210 of 9247 for Random Walk 2 DimensionalSearch Results
An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...
A minimal free resolution of a finitely generated graded module M over a commutative Noetherian Z-graded ring R in which all maps are homogeneous module homomorphisms, i.e., ...
A Hermitian inner product on a complex vector space V is a complex-valued bilinear form on V which is antilinear in the second slot, and is positive definite. That is, it ...
The Klein-Beltrami model of hyperbolic geometry consists of an open disk in the Euclidean plane whose open chords correspond to hyperbolic lines. Two lines l and m are then ...
Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...
Let H be a complex Hilbert space, and define a nest as a set N of closed subspaces of H satisfying the conditions: 1. 0,H in N, 2. If N_1,N_2 in N, then either N_1 subset= ...
The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...
An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...
Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...
Let h:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) be efficiently computable by an algorithm (solving a P-problem). For fixed y in {0,1}^(l(n)), view h(x,y) as a function h_y(x) of x ...
1 ... 318|319|320|321|322|323|324 ... 925 Previous Next

...