Search Results for ""

Let H be a Hilbert space and (e_i)_(i in I) an orthonormal basis for H. The set of all products of two Hilbert-Schmidt operators is denoted N(H), and its elements are called ...

Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

In this illusion, the vertical lines in the above figure are parallel, but appear to be tilted at an angle. In 1860, F. Zöllner sent his discovery in a letter to physicist ...

If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

de Rham's function is the function defined by the functional equations phi_alpha(1/2x) = alphaphi_alpha(x) (1) phi_alpha(1/2(x+1)) = alpha+(1-alpha)phi_alpha(x) (2) (Trott ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...