Search Results for ""

Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...

If A=(a_(ij)) is a diagonal matrix, then Q(v)=v^(T)Av=suma_(ii)v_i^2 (1) is a diagonal quadratic form, and Q(v,w)=v^(T)Aw is its associated diagonal symmetric bilinear form. ...

A square matrix A is called diagonally dominant if |A_(ii)|>=sum_(j!=i)|A_(ij)| for all i. A is called strictly diagonally dominant if |A_(ii)|>sum_(j!=i)|A_(ij)| for all i. ...

A proving technique in homological algebra which consists in looking for equivalent map compositions in commutative diagrams, and in exploiting the properties of injective, ...

Any lemma on commutative diagrams. It can give relations between maps (as in the five lemma) or tell how to construct new diagrams from old ones (as in the snake lemma).

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

A difference-differential equation is a two-variable equation consisting of a coupled ordinary differential equation and recurrence equation. In older literature, the term ...

Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

A table made by subtracting adjacent entries in a sequence, then repeating the process with those numbers.

A real function is said to be differentiable at a point if its derivative exists at that point. The notion of differentiability can also be extended to complex functions ...