Search Results for ""

A vector Laplacian can be defined for a vector A by del ^2A=del (del ·A)-del x(del xA), (1) where the notation ✡ is sometimes used to distinguish the vector Laplacian from ...

Separation of variables is a method of solving ordinary and partial differential equations. For an ordinary differential equation (dy)/(dx)=g(x)f(y), (1) where f(y)is nonzero ...

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

sum_(n=0)^(infty)[(q)_infty-(q)_n] = g(q)+(q)_inftysum_(k=1)^(infty)(q^k)/(1-q^k) (1) = g(q)+(q)_inftyL(q) (2) = g(q)+(q)_infty(psi_q(1)+ln(1-q))/(lnq) (3) = ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...