Search Results for ""

The third Morley triangle is made by rotating line BC toward vertex A about vertex B by angle (B+4pi)/3. It is an equilateral triangle. It has trilinear vertex matrix [1 ...

A characterization of normal spaces with respect to the definition given by Kelley (1955, p. 112) or Willard (1970, p. 99). It states that the topological space X is normal ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...

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 ...

For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...

A hyperboloid is a quadratic surface which may be one- or two-sheeted. The two-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the line ...

A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

An abstract group is a group characterized only by its abstract properties and not by the particular representations chosen for elements. For example, there are two distinct ...