Search Results for ""

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

A knot equivalent to a polygonal knot. Knots which are not tame are called wild knots.

In a category C, a terminal object is an object T in Ob(C) such that for any other object X in Ob(C), there is one, and only one morphism from X to T.

A ternary tree is a tree-like structure that is rooted and in which each vertex has at most three children.

A tetractys, also called a tetraktys or decad, is an arrangement of 10 points in the form of a triangle with 1 point in the first row, two in the second, three in the third, ...

Let rho be a reciprocal difference. Then Thiele's interpolation formula is the continued fraction f(x)=f(x_1)+(x-x_1)/(rho(x_1,x_2)+)(x-x_2)/(rho_2(x_1,x_2,x_3)-f(x_1)+) ...

Let R be a ring, and let I and J be ideals of R with I subset= J. Then J/I is an ideal of R/I and (R/I)/(J/I)=R/J.

The Thompson group is the sporadic group Th of order |Th| = 90745943887872000 (1) = 2^(15)·3^(10)·5^3·7^2·13·19·31. (2) It is implemented in the Wolfram Language as ...

1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...