Search Results for ""

A fixed point is a point that does not change upon application of a map, system of differential equations, etc. In particular, a fixed point of a function f(x) is a point x_0 ...

Let A be a C^*-algebra. A C^*-subalgebra (that is a closed *-subalgebra) B of A is called hereditary if bab^' in B for all b,b^' in B and a in A, or equivalently if for a in ...

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...

The algebra A is called a pre-C^*-algebra if it satisfies all conditions to be a C^*-algebra except that its norm need not be complete.

A fixed point for which the stability matrix has equal negative eigenvalues.

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

A fixed point for which the stability matrix has equal positive eigenvalues.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...