Search Results for ""

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

A pair of linear operators L and A associated with a given partial differential equation which can be used to solve the equation. However, it turns out to be very difficult ...

A roll of 4 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a little Joe" is 1/12, or 8.333...%. A roll of "4 the hard ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...

When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. Furthermore, the area of this ...

Möbius tetrahedra, also called Möbius tetrads (Baker 1922, pp. 61-62) are a pair of tetrahedra, each of which has all the vertices lying on the faces of the other: in other ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

A pair of functions phi_i(x) and phi_j(x) are orthonormal if they are orthogonal and each normalized so that int_a^b[phi_i(x)]^2w(x)dx = 1 (1) int_a^b[phi_j(x)]^2w(x)dx = 1. ...

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...