Search Results for ""

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...

An operator A:f^((n))(I)|->f(I) assigns to every function f in f^((n))(I) a function A(f) in f(I). It is therefore a mapping between two function spaces. If the range is on ...

The kth exterior power of an element alpha in an exterior algebra LambdaV is given by the wedge product of alpha with itself k times. Note that if alpha has odd degree, then ...

"The" Jacobi identity is a relationship [A,[B,C]]+[B,[C,A]]+[C,[A,B]]=0,, (1) between three elements A, B, and C, where [A,B] is the commutator. The elements of a Lie algebra ...

Let L be a finite-dimensional split semisimple Lie algebra over a field of field characteristic 0, H a splitting Cartan subalgebra, and Lambda a weight of H in a ...