Search Results for ""

A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...

A transformation of the form w=f(z)=(az+b)/(cz+d), (1) where a, b, c, d in C and ad-bc!=0, (2) is a conformal mapping called a linear fractional transformation. The ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...

If perpendiculars A^', B^', and C^' are dropped on any line L from the vertices of a triangle DeltaABC, then the perpendiculars to the opposite sides from their perpendicular ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...