Search Results for ""
221 - 230 of 580 for Tree diagramsSearch Results
The unknot, also called the trivial knot (Rolfsen 1976, p. 51), is a closed loop that is not knotted. In the 1930s Reidemeister first proved that knots exist which are ...
A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...
A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...
The mapping of a grid of regularly ruled squares onto a cone with no overlap or misalignment. Cone nets are possible for vertex angles of 90 degrees, 180 degrees, and 270 ...
Any lemma on commutative diagrams. It can give relations between maps (as in the five lemma) or tell how to construct new diagrams from old ones (as in the snake lemma).
Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...
A nonassociative algebra obeyed by objects such as the Lie bracket and Poisson bracket. Elements f, g, and h of a Lie algebra satisfy [f,f]=0 (1) [f+g,h]=[f,h]+[g,h], (2) and ...
Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...
The Curry triangle, also sometimes called the missing square puzzle, is a dissection fallacy created by American neuropsychiatrist L. Vosburgh Lions as an example of a ...
Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...
...
View search results from all Wolfram sites (4178 matches)

