Search Results for ""

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

The mutual information between two discrete random variables X and Y is defined to be I(X;Y)=sum_(x in X)sum_(y in Y)P(x,y)log_2((P(x,y))/(P(x)P(y))) (1) bits. Additional ...

Let N be a nilpotent, connected, simply connected Lie group, and let D be a discrete subgroup of N with compact right quotient space. Then N/D is called a nilmanifold.

A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...

The oriented matroid of a finite configuration of points extracts relative position and orientation information from the configuration. An oriented matroid can be described ...

Let G be a locally compact Abelian group. Let G^* be the group of all continuous homeomorphisms G->R/Z, in the compact open topology. Then G^* is also a locally compact ...

A type of error-correcting code that is related to Hadamard matrices.

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.