Search Results for ""

A generalization of the concept of set unions and intersections.

If algebraic integers alpha_1, ..., alpha_n are linearly independent over Q, then e^(alpha_1), ..., e^(alpha_n) are algebraically independent over Q. The ...

A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.

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, ...

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 ...

Any irreducible curve may be carried by a factorable Cremona transformation into one with none but ordinary singular points.

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

An 18-sided polygon, sometimes also called an octakaidecagon.