Search Results for ""

A technically defined group characterizing a system of linear differential equations y_j^'=sum_(k=1)^na_(jk)(x)y_k for j=1, ..., n, where a_(jk) are complex analytic ...

The angular position of a quantity. For example, the phase of a function cos(omegat+phi_0) as a function of time is phi(t)=omegat+phi_0. The complex argument of a complex ...

The complex plane C with the origin removed, i.e., C-{0}. The punctured plane is sometimes denoted C^* (although this notation conflicts with that for the Riemann sphere C-*, ...

The Riemann sphere, also called the extended complex plane, is a one-dimensional complex manifold C^* (C-star) which is the one-point compactification of the complex numbers ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...

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

Elliptic alpha functions relate the complete elliptic integrals of the first K(k_r) and second kinds E(k_r) at elliptic integral singular values k_r according to alpha(r) = ...

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...