Search Results for ""

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...

Let H be a Hilbert space and (e_i)_(i in I) an orthonormal basis for H. The set of all products of two Hilbert-Schmidt operators is denoted N(H), and its elements are called ...

The transcendence degree of Q(pi), sometimes called the transcendental degree, is one because it is generated by one extra element. In contrast, Q(pi,pi^2) (which is the same ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

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

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

Given a triangle with angles (pi/p, pi/q, pi/r), the resulting symmetry group is called a (p,q,r) triangle group (also known as a spherical tessellation). In three ...

In the American system, one trillion equals 10^(12)=1000000000000. In the French and German systems, one trillion equals 10^(18). In recent years, the "American" system has ...

The trinomial triangle is a number triangle of trinomial coefficients. It can be obtained by starting with a row containing a single "1" and the next row containing three 1s ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...