Search Results for ""

An expression built up from statements letters by appropriate application of connectives (Mendelson 1997, p. 13).

A 1-form w is said to be exact in a region R if there is a function f that is defined and of class C^1 (i.e., is once continuously differentiable in R) and such that df=w.

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).

All elementary functions can be extended to the complex plane. Such definitions agree with the real definitions on the x-axis and constitute an analytic continuation.

Let A be a matrix with the elementary divisors of its characteristic matrix expressed as powers of its irreducible polynomials in the field F[lambda], and consider an ...

The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...