Search Results for ""

For a set of positive gamma_k, k=0, 1, 2..., Turán's inequalities are given by gamma_k^2-gamma_(k-1)gamma_(k+1)>=0 for k=1, 2, ....

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

A generalization of spun knots due to Zeeman. This method produces four-dimensional knot types that cannot be produced by ordinary spinning.

A class of area-preserving maps of the form theta_(i+1) = theta_i+2pialpha(r_i) (1) r_(i+1) = r_i, (2) which maps circles into circles but with a twist resulting from the ...

The term "twisted sphere" is used to mean either a projective plane (Henle 1994, p. 110) or the corkscrew surface obtained by extending a sphere along a diameter and then ...

The collection of twistors in Minkowski space that forms a four-dimensional complex vector space.

Except for triangles, every simple polygon has at least two nonoverlapping ears.

The two-point form of a line in the Cartesian plane passing through the points (x_1,y_1) and (x_2,y_2) is given by y-y_1=(y_2-y_1)/(x_2-x_1)(x-x_1), or equivalently, ...