Search Results for ""

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...

Let X(x)=X(x_1,x_2,...,x_n) be a random vector in R^n and let f_X(x) be a probability distribution on X with continuous first and second order partial derivatives. The Fisher ...

The isoperimetric quotient of a closed curve is defined as the ratio of the curve area to the area of a circle (A=pir_A^2) with same perimeter (p=2pir_p) as the curve, Q = ...

A theorem in the theory of univalent conformal mappings of families of domains on a Riemann surface, containing an inequality for the coefficients of the mapping functions, ...

On a measure space X, the set of square integrable L2-functions is an L^2-space. Taken together with the L2-inner product with respect to a measure mu, <f,g>=int_Xfgdmu (1) ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...

If a function has a Fourier series given by f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx)+sum_(n=1)^inftyb_nsin(nx), (1) then Bessel's inequality becomes an equality known as ...

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...