Search Results for ""

Let {u_n(x)} be a sequence of functions. If 1. u_n(x) can be written u_n(x)=a_nf_n(x), 2. suma_n is convergent, 3. f_n(x) is a monotonic decreasing sequence (i.e., ...

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 algebraic equation in n variables is an polynomial equation of the form f(x_1,x_2,...,x_n)=sum_(e_1,...,e_n)c_(e_1,e_2,...,e_n)x_1^(e_1)x_2^(e_2)...x_n^(e_n)=0, where the ...

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

The second-order ordinary differential equation y^('')+(y^')/x+(1-(nu^2)/(x^2))y=(x-nu)/(pix^2)sin(pinu) whose solutions are Anger functions.

The region lying between two concentric circles. The area of the annulus formed by two circles of radii a and b (with a>b) is A_(annulus)=pi(a^2-b^2). The annulus is ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Arc length is defined as the length along a curve, s=int_gamma|dl|, (1) where dl is a differential displacement vector along a curve gamma. For example, for a circle of ...