Search Results for ""

Let A be a commutative ring and let C_r be an R-module for r=0,1,2,.... A chain complex C__ of the form C__:...|->C_n|->C_(n-1)|->C_(n-2)|->...|->C_2|->C_1|->C_0 is said to ...

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

There are several versions of the Berry paradox, the original version of which was published by Bertrand Russell and attributed to Oxford University librarian Mr. G. Berry. ...

An ordinary differential equation of the form x^my^'=f(x,y), where m is a positive integer, f is analytic at x=y=0, f(0,0)=0, and f_y^'(0,0)!=0. Zwillinger (1997, p. 120), ...

Caesar's method is an encryption scheme involving shifting an alphabet (so a->c, b->d, c->e, d->f, etc., x->z,y->a,z->b). It is one of the most basic encryption methods, and ...

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...