Search Results for ""

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.

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...

A general system of fourth-order curvilinear coordinates based on the cyclide in which Laplace's equation is separable (either simply separable or R-separable). Bôcher (1894) ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...

A field is any set of elements that satisfies the field axioms for both addition and multiplication and is a commutative division algebra. An archaic name for a field is ...

In functional analysis, the Lax-Milgram theorem is a sort of representation theorem for bounded linear functionals on a Hilbert space H. The result is of tantamount ...

"Stampacchia's theorem" is a name given to any number of related results in functional analysis, and while the body of the theorem often varies depending on the literature ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...