Search Results for ""

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

A transformation consisting of a constant offset with no rotation or distortion. In n-dimensional Euclidean space, a translation may be specified simply as a vector giving ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

The "trefoil" curve is the name given by Cundy and Rollett (1989, p. 72) to the quartic plane curve given by the equation x^4+x^2y^2+y^4=x(x^2-y^2). (1) As such, it is a ...

The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...

B. Chilton and R. Whorf have studied stellations of the triakis tetrahedron (Wenninger 1983, p. 36). Whorf has found 138 stellations, 44 of which are fully symmetric and 94 ...

The triakis truncated tetrahedron is a convex space-filling polyhedron which is the shape of the Voronoi cell of carbon atoms in diamond. It can be constructed from the ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

In the above figure, let DeltaABC be a right triangle, arcs AP and AQ be segments of circles centered at C and B respectively, and define a = BC (1) b = CA=CP (2) c = BA=BQ. ...

Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...