Search Results for ""

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

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

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

A ternary diagram is a triangular diagram which displays the proportion of three variables that sum to a constant and which does so using barycentric coordinates. The ...

A scatter diagram, also called a scatterplot or a scatter plot, is a visualization of the relationship between two variables measured on the same set of individuals. Scatter ...

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

A proving technique in homological algebra which consists in looking for equivalent map compositions in commutative diagrams, and in exploiting the properties of injective, ...

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...