Search Results for ""

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

Let (X,A,mu) and (Y,B,nu) be measure spaces. A measurable rectangle is a set of the form A×B for A in A and B in B.

2^(20)=1024^2=1048576 bytes. Although the term megabyte is almost universally used to refer to 1024^2 bytes, such usage is deprecated in favor of the standard SI naming ...

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

The polynomials M_k(x;delta,eta) which form the Sheffer sequence for g(t) = {[1+deltaf(t)]^2+[f(t)]^2}^(eta/2) (1) f(t) = tan(t/(1+deltat)) (2) which have generating function ...

A_m(lambda)=int_(-infty)^inftycos[1/2mphi(t)-lambdat]dt, (1) where the function phi(t)=4tan^(-1)(e^t)-pi (2) describes the motion along the pendulum separatrix. Chirikov ...

When a closed interval [a,b] is partitioned by points a<x_1<x_2<...<x_(n-1)<b, the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ..., ...

Metamathematics is another word for proof theory. The branch of logic dealing with the study of the combination and application of mathematical symbols is also sometimes ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...