TOPICS
Search

Search Results for ""


61 - 70 of 500 for BCH codeSearch Results
Consider a knot as being formed from two tangles. The following three operations are called mutations. 1. Cut the knot open along four points on each of the four strings ...
Let Omega be an open, bounded, and connected subset of R^d for some d and let dx denote d-dimensional Lebesgue measure on R^d. In functional analysis, the Poincaré inequality ...
A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...
By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...
The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom !(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes ...
A strong pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, the map v_m|->g_m(v_m,·) is an ...
A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...
A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...
The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...
A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...
1 ... 4|5|6|7|8|9|10 ... 50 Previous Next

...