Search Results for ""

The Heisenberg group H^n in n complex variables is the group of all (z,t) with z in C^n and t in R having multiplication (w,t)(z,t^')=(w+z,t+t^'+I[w^*z]) (1) where w^* is the ...

A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...

Linear algebra is the study of linear sets of equations and their transformation properties. Linear algebra allows the analysis of rotations in space, least squares fitting, ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

A Hermitian form on a vector space V over the complex field C is a function f:V×V->C such that for all u,v,w in V and all a,b in R, 1. f(au+bv,w)=af(u,w)+bf(v,w). 2. ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...