Search Results for ""
241 - 250 of 580 for Tree diagramsSearch Results
The meeting point of lines that connect corresponding points from homothetic figures. In the above figure, O is the homothetic center of the homothetic figures ABCDE and ...
The H-fractal is a fractal constructed by starting with the line segments corresponding to a capital letter H, then iteratively placing smaller H's centered at the top and ...
For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...
"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...
The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...
An Abelian category is a category for which the constructions and techniques of homological algebra are available. The basic examples of such categories are the category of ...
Also called Chvátal's art gallery theorem. If the walls of an art gallery are made up of n straight line segments, then the entire gallery can always be supervised by |_n/3_| ...
An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...
Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...
Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...
...
View search results from all Wolfram sites (4178 matches)

