Search Results for ""

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

A second-order partial differential equation, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called elliptic if the matrix Z=[A B; B C] (2) is positive ...

Let a closed surface have genus g. Then the polyhedral formula generalizes to the Poincaré formula chi(g)=V-E+F, (1) where chi(g)=2-2g (2) is the Euler characteristic, ...

The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

The Hénon-Heiles equation is a nonlinear nonintegrable Hamiltonian system with x^.. = -(partialV)/(partialx) (1) y^.. = -(partialV)/(partialy), (2) where the potential energy ...

A class formed by sets in R^n which have essentially the same structure, regardless of size, shape and dimension. The "essential structure" is what a set keeps when it is ...

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