Search Results for ""

The wallpaper groups are the 17 possible plane symmetry groups. They are commonly represented using Hermann-Mauguin-like symbols or in orbifold notation (Zwillinger 1995, p. ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The one-dimensional wave equation is given by (partial^2psi)/(partialx^2)=1/(v^2)(partial^2psi)/(partialt^2). (1) In order to specify a wave, the equation is subject to ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

Send a Message

The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...

The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...