Search Results for ""

A generalization of Turán's theorem to non-complete graphs.

Given a Poisson distribution with a rate of change lambda, the distribution function D(x) giving the waiting times until the hth Poisson event is D(x) = ...

The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...

An exterior angle beta of a polygon is the angle formed externally between two adjacent sides. It is therefore equal to 2pi-alpha, where alpha is the corresponding internal ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

Let A be a C^*-algebra and A_+ be its positive part. Suppose that E is a complex linear space which is a left A-module and lambda(ax)=(lambdaa)x=a(lambdax), where lambda in ...

A manifold with a Riemannian metric that has zero curvature is a flat manifold. The basic example is Euclidean space with the usual metric ds^2=sum_(i)dx_i^2. In fact, any ...

A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...

Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...