Search Results for ""

The dual polyhedron of the small rhombihexahedron U_(18) and Wenninger dual W_(86)

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

A function composed of a set of equally spaced jumps of equal length, such as the ceiling function f(x)=[x], floor function f(x)=|_x_|, or nearest integer function f(x)=[x].

An expression built up from statements letters by appropriate application of connectives (Mendelson 1997, p. 13).

The smallest statistical rank (either up or down) of a set of data.

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

Any linear combination of real spherical harmonics A_lP_l(costheta)+sum_(m=1)^l[A_l^mcos(mphi)+B_l^msin(mphi)]P_l^m(costheta) for l fixed whose sum is not premultiplied by a ...

The planes passing through the vertices of a tetrahedron ABCD and tangent to the circumsphere at these points form another tetrahedron called the tangential tetrahedron. The ...

One trillion (10^(12)) bytes. Unfortunately, the term is sometimes also used to mean 2^(40)=1024^4=1099511627776 bytes. However, this usage is deprecated, and the term ...

A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.