Search Results for ""

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

"The" trifolium is the three-lobed folium with b=a, i.e., the 3-petalled rose curve. It is also known as the paquerette de mélibée (Apéry 1987, p. 85), with paquerette being ...

Consider the solid enclosed by the three hyperboloids specified by the inequalities x^2+y^2-z^2 <= 1 (1) y^2+z^2-x^2 <= 1 (2) z^2+x^2-y^2 <= 1. (3) This work dubs this solid ...

As defined by Gray (1997, p. 201), Viviani's curve, sometimes also called Viviani's window, is the space curve giving the intersection of the cylinder of radius a and center ...

An amicable quadruple as a quadruple (a,b,c,d) such that sigma(a)=sigma(b)=sigma(c)=sigma(d)=a+b+c+d, (1) where sigma(n) is the divisor function. If (a,b) and (x,y) are ...

Arc length is defined as the length along a curve, s=int_gamma|dl|, (1) where dl is a differential displacement vector along a curve gamma. For example, for a circle of ...

A factorization of the form 2^(4n+2)+1=(2^(2n+1)-2^(n+1)+1)(2^(2n+1)+2^(n+1)+1). (1) The factorization for n=14 was discovered by Aurifeuille, and the general form was ...