Search Results for ""

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...

Let lim stand for the limit lim_(x->c), lim_(x->c^-), lim_(x->c^+), lim_(x->infty), or lim_(x->-infty), and suppose that lim f(x) and lim g(x) are both zero or are both ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

A test used to determine the statistical significance of an observation. Two main types of error can occur: 1. A type I error occurs when a false negative result is obtained ...

A triangle center function (sometimes simply called a center function) is a nonzero function f(a,b,c) that is homogeneous f(ta,tb,tc)=t^nf(a,b,c) (1) bisymmetry in b and c, ...

In order to find a root of a polynomial equation a_0x^n+a_1x^(n-1)+...+a_n=0, (1) consider the difference equation a_0y(t+n)+a_1y(t+n-1)+...+a_ny(t)=0, (2) which is known to ...

A financial measure of a fund's sensitivity to market movements which measures the relationship between a fund's excess return over Treasury Bills and the excess return of a ...

Let {a_n} be a series of positive terms with a_(n+1)<=a_n. Then sum_(n=1)^(infty)a_n converges iff sum_(k=0)^infty2^ka_(2^k) converges.