Search Results for ""

Toroidal functions are a class of functions also called ring functions that appear in systems having toroidal symmetry. Toroidal functions can be expressed in terms of the ...

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-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

A module having only one element: the singleton set {*}. It is a module over any ring R with respect to the multiplication defined by a*=* (1) for every a in R, and the ...

A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...

In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...