Search Results for ""

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

Given an open subset U in n-dimensional space and two compact subsets C_0 and C_1 of U, where C_1 is derived from C_0 by a continuous motion, is it possible to move C_0 to ...

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 4-cusped hypocycloid which is sometimes also called a tetracuspid, cubocycloid, or paracycle. The parametric equations of the astroid can be obtained by plugging in n=a/b=4 ...

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

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

The Condon-Shortley phase is the factor of (-1)^m that occurs in some definitions of the spherical harmonics (e.g., Arfken 1985, p. 682) to compensate for the lack of ...

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

A matching is a maximum matching iff it contains no augmenting path.