Search Results for ""

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...

If A is a unital Banach algebra where every nonzero element is invertible, then A is the algebra of complex numbers.

A method for constructing magic squares of odd order.

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

A version of nim-like games in which the player taking the last piece is the loser. For most impartial games, this form is much harder to analyze, but it requires only a ...

The symbol × used to denote multiplication, i.e., a×b denotes a times b. The symbol × is also used to denote a group direct product, a Cartesian product, or a direct product ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

An algebra which does not satisfy a(bc)=(ab)c is called a nonassociative algebra.

The Paley class of a positive integer m=0 (mod 4) is defined as the set of all possible quadruples (k,e,q,n) where m=2^e(q^n+1), (1) q is an odd prime, and k={0 if q=0; 1 if ...

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...