Search Results for ""

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

Let G=SL(n,C). If lambda in Z^n is the highest weight of an irreducible holomorphic representation V of G, (i.e., lambda is a dominant integral weight), then the G-map ...

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

A term in social choice theory meaning each alternative receives equal weight for a single vote.

An unknown is an independent variable of a function. A function with n independent variables is said to be a function "in," "with," or "of" n unknowns.

where _2F_1(a,b;c;z) is a hypergeometric function and _3F_2(a,b,c;d,e;z) is a generalized hypergeometric function.

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...