Search Results for ""

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

A coordinate system defined by the transformation equations x = a/Lambdacnmucnnucospsi (1) y = a/Lambdacnmucnnusinpsi (2) z = a/Lambdasnmudnmusnnudnnu, (3) where ...

A divergenceless vector field, also called a solenoidal field, is a vector field for which del ·F=0. Therefore, there exists a G such that F=del xG. Furthermore, F can be ...

A series which is not convergent. Series may diverge by marching off to infinity or by oscillating. Divergent series have some curious properties. For example, rearranging ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Also let R[z]>0 ...

A compound of five regular dodecahedra with the symmetry of the icosahedron (Wenninger 1983, pp. 145-147) can be constructed by taking a dodecahedron with top and bottom ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...

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 ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...