Search Results for ""

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

If A is a graded module and there exists a degree-preserving linear map phi:A tensor A->A, then (A,phi) is called a graded algebra. Cohomology is a graded algebra. In ...

Let ad=bc, then Hirschhorn's 3-7-5 identity, inspired by the Ramanujan 6-10-8 identity, is given by (1) Another version of this identity can be given using linear forms. Let ...

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...

Let U=(U,<··>) be a T2 associative inner product space over the field C of complex numbers with completion H, and assume that U comes with an antilinear involution xi|->xi^* ...

Abstract algebra is the set of advanced topics of algebra that deal with abstract algebraic structures rather than the usual number systems. The most important of these ...

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A proof of a formula on limits based on the epsilon-delta definition. An example is the following proof that every linear function f(x)=ax+b (a,b in R,a!=0) is continuous at ...

A number t_x=tan^(-1)(1/x)=cot^(-1)x, where x is an integer or rational number, tan^(-1)x is the inverse tangent, and cot^(-1)x is the inverse cotangent. Gregory numbers ...